Sciweavers

1855 search results - page 280 / 371
» A coding theorem for distributed computation
Sort
View
136
Voted
ICS
1999
Tsinghua U.
15 years 8 months ago
Reorganizing global schedules for register allocation
Instruction scheduling is an important compiler technique for exploiting more instruction-level parallelism (ILP) in high-performance microprocessors, and in this paper, we study ...
Gang Chen, Michael D. Smith
134
Voted
ICS
1999
Tsinghua U.
15 years 8 months ago
Improving the performance of speculatively parallel applications on the Hydra CMP
Hydra is a chip multiprocessor (CMP) with integrated support for thread-level speculation. Thread-level speculation provides a way to parallelize sequential programs without the n...
Kunle Olukotun, Lance Hammond, Mark Willey
144
Voted
HPCA
1998
IEEE
15 years 8 months ago
Supporting Highly-Speculative Execution via Adaptive Branch Trees
Most of the prediction mechanisms predict a single path to continue the execution on a branch. Alternatively, we may exploit parallelism from either possible paths of a branch, di...
Tien-Fu Chen
134
Voted
HPCA
1998
IEEE
15 years 8 months ago
The Potential for Using Thread-Level Data Speculation to Facilitate Automatic Parallelization
As we look to the future, and the prospect of a billion transistors on a chip, it seems inevitable that microprocessors will exploit having multiple parallel threads. To achieve t...
J. Gregory Steffan, Todd C. Mowry
126
Voted
IEEEPACT
1998
IEEE
15 years 8 months ago
Optimistic Register Coalescing
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
Jinpyo Park, Soo-Mook Moon