Issue No. 04 - April (2009 vol. 58)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.146
Fernando Castro , Universidad Complutense de Madrid, Madrid
Regana Noor , University of Rochester, Rochester
Alok Garg , University of Rochester, Rochester
Daniel Chaver , Universidad Complutense de Madrid, Madrid
Michael C. Huang , University of Rochester, Rochester
Luis Piñuel , Universidad Complutense de Madrid, Madrid
Manuel Prieto , Universidad Complutense de Madrid, Madrid
Francisco Tirado , Universidad Complutense de Madrid, Madrid
One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-order execution. Traditional age-ordered associative load queues are complex, inefficient, and power hungry. In this paper, we introduce two new dependence checking schemes with different design tradeoffs, but both explicitly rely on timing information as a primary instrument to rule out dependence violation. Our timing-centric designs operate at a fraction of the energy cost of an associative LQ and achieve the same functionality with an insignificant performance impact on average. Studies with parallel benchmarks also show that they are equally effective and efficient in a chip-multiprocessor environment.
LSQ, memory disambiguation, energy efficiency.
D. Chaver et al., "Replacing Associative Load Queues: A Timing-Centric Approach," in IEEE Transactions on Computers, vol. 58, no. , pp. 496-511, 2008.