• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 761
Next 10 →

Dynamo: A Transparent Dynamic Optimization System

by Vasanth Bala, Evelyn Duesterwald , Sanjeev Banerjia - ACM SIGPLAN NOTICES , 2000
"... We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stream as it executes on the processor. The input native instruction stream to Dynamo can be dynamically generated (by a JIT ..."
Abstract - Cited by 479 (2 self) - Add to MetaCart
We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stream as it executes on the processor. The input native instruction stream to Dynamo can be dynamically generated (by a JIT

Symbiotic Jobscheduling for a Simultaneous Multithreading Processor

by Allan Snavely, Dean Tullsen - In Eighth International Conference on Architectural Support for Programming Languages and Operating Systems , 2000
"... Simultaneous Multithreading machines fetch and execute instructions from multiple instruction streams to increase system utilization and speedup the execution of jobs. When there are more jobs in the system than there is hardware to support simultaneous execution, the operating system scheduler must ..."
Abstract - Cited by 347 (15 self) - Add to MetaCart
Simultaneous Multithreading machines fetch and execute instructions from multiple instruction streams to increase system utilization and speedup the execution of jobs. When there are more jobs in the system than there is hardware to support simultaneous execution, the operating system scheduler

Slipstream processors: improving both performance and fault tolerance

by Karthik Sundaramoorthy, Zach Purser, Eric Rotenberg - In Proceedings of the ninth international conference on Architectural
"... Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effect. We propose creating a shorter but otherwise equivalent version of the original program by removing ineffectual computat ..."
Abstract - Cited by 187 (6 self) - Add to MetaCart
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effect. We propose creating a shorter but otherwise equivalent version of the original program by removing ineffectual

Exploiting large ineffectual instruction sequences

by Eric Rotenberg , 1999
"... A processor executes the full dynamic instruction stream in order to compute the final output of a program, yet we observe equivalent, smaller instruction streams that produce the same cor-rect output. Based on this observation, we attempt to identify large, dynamically-contiguous regions of instruc ..."
Abstract - Cited by 23 (3 self) - Add to MetaCart
A processor executes the full dynamic instruction stream in order to compute the final output of a program, yet we observe equivalent, smaller instruction streams that produce the same cor-rect output. Based on this observation, we attempt to identify large, dynamically-contiguous regions

Understanding the Backward Slices of Performance Degrading Instructions

by Craig B. Zilles, Gurindar S. Sohi - in Proceedings of the 27th Annual International Symposium on Computer Architecture , 2000
"... For many applications, branch mispredictions and cache misses limit a processor's performance to a level well below its peak instruction throughput. A small fraction of static instructions, whose behavior cannot be anticipated using current branch predictors and caches, contribute a large fract ..."
Abstract - Cited by 85 (3 self) - Add to MetaCart
be reduced to less than one tenth of the full dynamic instruction stream when considering the 512 instructions before the performance degrading instruction. 1

A Comparison of Dynamic Branch Predictors that use Two Levels of Branch History

by Tse-Yu Yeh, Yale N. Patt - in Proceedings of the 20th Annual International Symposium on Computer Architecture , 1993
"... Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive dy ..."
Abstract - Cited by 278 (9 self) - Add to MetaCart
Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive

An Infrastructure for Adaptive Dynamic Optimization

by Derek Bruening, Timothy Garnett, Saman Amarasinghe , 2003
"... Dynamic optimization is emerging as a promising approach to overcome many of the obstacles of traditional static compilation. But while there are a number of compiler infrastructures for developing static optimizations, there are very few for developing dynamic optimizations. We present a framework ..."
Abstract - Cited by 189 (6 self) - Add to MetaCart
and lightweight, API. This is achieved by restricting optimization units to linear streams of code and using adaptive levels of detail for representing instructions. The interface is not restricted to optimization and can be used for instrumentation, profiling, dynamic translation, etc.. To demonstrate

Dynamic instruction stream editing

by Marc Corliss , 2006
"... ..."
Abstract - Cited by 10 (2 self) - Add to MetaCart
Abstract not found

ARB: A hardware mechanism for dynamic reordering of memory references

by Manoj Franklin, Gurindar S. Sohi - IEEE Transactions on Computers , 1996
"... To exploit instruction level parallelism, it is important not only to execute multiple memory references per cycle, but also to reorder memory references, especially to execute loads before stores that precede them in the sequential instruction stream. To guarantee correctness of execution in such s ..."
Abstract - Cited by 166 (10 self) - Add to MetaCart
To exploit instruction level parallelism, it is important not only to execute multiple memory references per cycle, but also to reorder memory references, especially to execute loads before stores that precede them in the sequential instruction stream. To guarantee correctness of execution

Cooperating Threads Architecture: Improving both Performance and Fault Tolerance

by Karthik Sundaramoorthy, Zach Purser, Eric Rotenberg , 2000
"... Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effect. We propose creating a shorter but otherwise equivalent version of the original program by removing ineffectual computat ..."
Abstract - Add to MetaCart
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effect. We propose creating a shorter but otherwise equivalent version of the original program by removing ineffectual
Next 10 →
Results 1 - 10 of 761
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University