As processors continue to exploit more instruction level parallelism, a greater demand is placed on reducing the effects of memory access latency. In this paper, we introduce a novel modification of the processor pipeline called memory renaming. Memory renaming applies register access techniques to load instructions, reducing the effect of delays caused by the need to calculate effective addresses for the load and all preceding stores before the data can be fetched. Memory renaming allows the processor to speculatively fetch values when the producer of the data can be reliably determined without the need for an effective address. This work extends previous studies of data value and dependence speculation. When memory renaming is added to th...
Processor performance is directly impacted by the latency of the memory system. As processor core cy...
A novel dynamic register renaming approach is proposed in this work. The key idea of the novel schem...
In the long-lived M-renaming problem, N processes repeatedly acquire and release names ranging over ...
As processors continue to exploit more instruction level parallelism, greater demands are placed on ...
In this paper, we present a novel mechanism that implements register renaming, dynamic speculation a...
Modern superscalar processors support a large number of in-flight instructions, which requires sizea...
The register file is one of the critical components of current processors in terms of access time an...
To exploit instruction level parallelism, it is important not only to execute multiple memory refere...
Memory operations remain a significant bottleneck in dynamically scheduled pipelined processors, due...
Register files are becoming one of the critical components of current out-of-order processors in ter...
Data communications between producer instructions and consumer instructions through memory incur ext...
Abstract—The Register File is one of the critical components of current processors in terms of acces...
Abstract. Modern microprocessor designs implement register renaming using register alias tables (RAT...
This paper proposes and evaluates a new microarchitecture for out-of-order processors that supports ...
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3...
Processor performance is directly impacted by the latency of the memory system. As processor core cy...
A novel dynamic register renaming approach is proposed in this work. The key idea of the novel schem...
In the long-lived M-renaming problem, N processes repeatedly acquire and release names ranging over ...
As processors continue to exploit more instruction level parallelism, greater demands are placed on ...
In this paper, we present a novel mechanism that implements register renaming, dynamic speculation a...
Modern superscalar processors support a large number of in-flight instructions, which requires sizea...
The register file is one of the critical components of current processors in terms of access time an...
To exploit instruction level parallelism, it is important not only to execute multiple memory refere...
Memory operations remain a significant bottleneck in dynamically scheduled pipelined processors, due...
Register files are becoming one of the critical components of current out-of-order processors in ter...
Data communications between producer instructions and consumer instructions through memory incur ext...
Abstract—The Register File is one of the critical components of current processors in terms of acces...
Abstract. Modern microprocessor designs implement register renaming using register alias tables (RAT...
This paper proposes and evaluates a new microarchitecture for out-of-order processors that supports ...
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3...
Processor performance is directly impacted by the latency of the memory system. As processor core cy...
A novel dynamic register renaming approach is proposed in this work. The key idea of the novel schem...
In the long-lived M-renaming problem, N processes repeatedly acquire and release names ranging over ...