Sciweavers

Share
IBMRD
2006

Decomposing the load-store queue by function for power reduction and scalability

9 years 3 months ago
Decomposing the load-store queue by function for power reduction and scalability
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and number of in-flight instructions are scaled. In this paper, we propose an alternate organization of an LSQ that separates the forwarding functionality from checking that loads received their correct values. Two main techniques are exploited: 1) the store forwarding logic is only accessed by those loads and stores that are likely to be involved in forwarding, and 2) the checking structure is banked by address. The result of these techniques is that a small collection of small, low bandwidth structures can be substituted for the large, high bandwidth structures used in conventional designs. By our calculations, these proposed techniques reduce LSQ dynamic power by a factor of 3-5 while achieving equivalent performance.
Lee Baugh, Craig B. Zilles
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where IBMRD
Authors Lee Baugh, Craig B. Zilles
Comments (0)
books