Sciweavers

131 search results - page 12 / 27
» Copy Elimination for Parallelizing Compilers
Sort
View
MICRO
2000
IEEE
133views Hardware» more  MICRO 2000»
15 years 2 months ago
Compiler controlled value prediction using branch predictor based confidence
Value prediction breaks data dependencies in a program thereby creating instruction level parallelism that can increase program performance. Hardware based value prediction techni...
Eric Larson, Todd M. Austin
CODES
2004
IEEE
15 years 1 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
MICRO
1994
IEEE
118views Hardware» more  MICRO 1994»
15 years 1 months ago
Characterizing the impact of predicated execution on branch prediction
Branch instructions are recognized as a major impediment to exploiting instruction level parallelism. Even with sophisticated branch prediction techniques, many frequently execute...
Scott A. Mahlke, Richard E. Hank, Roger A. Bringma...
NGC
2007
Springer
150views Communications» more  NGC 2007»
14 years 9 months ago
Customized Plug-in Modules in Metascheduler CSF4 for Life Sciences Applications
Abstract As more and more life science researchers start to take advantages of grid technologies in their work, the demand increases for a robust yet easy to use metascheduler or r...
Zhaohui Ding, Xiaohui Wei, Yuan Luo, Da Ma, Peter ...
PPOPP
1990
ACM
15 years 1 months ago
Employing Register Channels for the Exploitation of Instruction Level Parallelism
Abstract - A multiprocessor system capable of exploiting fine-grained parallelism must support efficient synchronization and data passing mechanisms. This paper demonstrates the us...
Rajiv Gupta