Sciweavers

741 search results - page 1 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
ISCA
1998
IEEE
107views Hardware» more  ISCA 1998»
13 years 9 months ago
Memory Dependence Prediction Using Store Sets
For maximum performance, an out-of-order processor must issue load instructions as early as possible, while avoiding memory-order violations with prior store instructions that wri...
George Z. Chrysos, Joel S. Emer
IEEEPACT
2002
IEEE
13 years 9 months ago
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
Soner Önder
HPCA
2006
IEEE
14 years 5 months ago
Store vectors for scalable memory dependence prediction and scheduling
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
Samantika Subramaniam, Gabriel H. Loh
JILP
2000
84views more  JILP 2000»
13 years 4 months ago
Memory Dependence Prediction in Multimedia Applications
We identify that a set of multimedia applications exhibit highly regular read-after-read (RAR) and read-after-write (RAW) memory dependence streams. We exploit this regularity to ...
Andreas Moshovos, Gurindar S. Sohi
ICS
1999
Tsinghua U.
13 years 9 months ago
Classifying load and store instructions for memory renaming
Memory operations remain a significant bottleneck in dynamically scheduled pipelined processors, due in part to the inability to statically determine the existence of memory addr...
Glenn Reinman, Brad Calder, Dean M. Tullsen, Gary ...