enter search term and/or author name
A lifetime optimal algorithm for speculative PRE
Jingling Xue, Qiong Cai
A lifetime optimal algorithm, called MC-PRE, is presented for the first time that performs speculative PRE based on edge profiles. In addition to being computationally optimal in the sense that the total number of dynamic computations for an...
Instruction packing: Toward fast and energy-efficient instruction scheduling
Joseph J. Sharkey, Dmitry V. Ponomarev, Kanad Ghose, Oguz Ergin
Traditional dynamic scheduler designs use one issue queue entry per instruction, regardless of the actual number of operands actively involved in the wakeup process. We propose Instruction Packing---a novel microarchitectural technique that reduces...
CAVA: Using checkpoint-assisted value prediction to hide L2 misses
Luis Ceze, Karin Strauss, James Tuck, Josep Torrellas, Jose Renau
Modern superscalar processors often suffer long stalls because of load misses in on-chip L2 caches. To address this problem, we propose hiding L2 misses with Checkpoint-Assisted VAlue prediction (CAVA). On an L2 cache miss, a predicted value is...
Efficient address remapping in distributed shared-memory systems
Lixin Zhang, Mike Parker, John Carter
As processor performance continues to improve at a rate much higher than DRAM and network performance, we are approaching a time when large-scale distributed shared memory systems will have remote memory latencies measured in tens of thousands of...