Sciweavers

271 search results - page 46 / 55
» Complexity-Effective Superscalar Processors
Sort
View
EUROPAR
2001
Springer
13 years 12 months ago
Execution Latency Reduction via Variable Latency Pipeline and Instruction Reuse
Operand bypass logic might be one of the critical structures for future microprocessors to achieve high clock speed. The delay of the logic imposes the execution time budget to be ...
Toshinori Sato, Itsujiro Arita
ISCA
1999
IEEE
87views Hardware» more  ISCA 1999»
13 years 11 months ago
Memory Forwarding: Enabling Aggressive Layout Optimizations by Guaranteeing the Safety of Data Relocation
By optimizing data layout at run-time, we can potentially enhance the performance of caches by actively creating spatial locality, facilitating prefetching, and avoiding cache con...
Chi-Keung Luk, Todd C. Mowry
ISCA
1998
IEEE
142views Hardware» more  ISCA 1998»
13 years 11 months ago
An Analysis of Correlation and Predictability: What Makes Two-Level Branch Predictors Work
Pipeline flushes due to branch mispredictions is one of the most serious problems facing the designer of a deeply pipelined, superscalar processor. Many branch predictors have bee...
Marius Evers, Sanjay J. Patel, Robert S. Chappell,...
ISCA
1998
IEEE
102views Hardware» more  ISCA 1998»
13 years 11 months ago
Dynamic History-length Fitting: A Third Level of Adaptivity for Branch Prediction
Accurate branch prediction is essential for obtaining high performance in pipelined superscalar processors that execute instructions speculatively. Some of the best current predic...
Toni Juan, Sanji Sanjeevan, Juan J. Navarro
ISCA
1992
IEEE
125views Hardware» more  ISCA 1992»
13 years 11 months ago
Limits of Control Flow on Parallelism
This paper discusses three techniques useful in relaxing the constraints imposed by control flow on parallelism: control dependence analysis, executing multiple flows of control s...
Monica S. Lam, Robert P. Wilson