loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 IEEE International Conference on Computer Design (ICCD'03)
Distributed Reorder Buffer Schemes for Low Power
San Jose, California
October 13-October 15
ISBN: 0-7695-2025-1
Gurhan Kucuk, State University of New York, Binghamton
Oguz Ergin, State University of New York, Binghamton
Dmitry Ponomarev, State University of New York, Binghamton
Kanad Ghose, State University of New York, Binghamton
We consider two approaches for reducing the complexity and power dissipation in processors that use separate register file to maintain committed register values. The first approach relies on a distributed implementation of the Reorder Buffer (ROB) that spreads the centralized ROB structure across the function units (FUs), with each distributed component sized to match the FU workload and with one write port and two read ports on each component. The second approach combines the use of the previously proposed retention latches and a distributed ROB implementation that uses minimally-ported distributed components. Such a combination avoids any read and write port conflicts on the distributed ROB components (with the exception of possible port conflicts in the course of commitment) and does not incur the associated performance degradation. Our designs are evaluated using the simulation of the SPEC 2000 benchmarks and SPICE simulations of the actual ROB layouts in 0.18 micron process. The ROB power savings of up to 49% can be realized with only 1.7% performance loss on the average.
Citation:
Gurhan Kucuk, Oguz Ergin, Dmitry Ponomarev, Kanad Ghose, "Distributed Reorder Buffer Schemes for Low Power," iccd, pp.364, 2003 IEEE International Conference on Computer Design (ICCD'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.