Memory ordering: a value-based approach
Cain, H.W.
Lipasti, M.H.
This paper appears in: Micro, IEEE
Publication Date: Nov.-Dec. 2004
Volume: 24,
Issue: 6
On page(s): 110-117
ISSN: 0272-1732
INSPEC Accession Number: 8293739
Digital Object Identifier: 10.1109/MM.2004.81
Current Version Published: 2005-01-31
Abstract
Value-based replay enforces memory ordering by simply reexecuting load instructions in program order prior to commit, eliminating the need for associative search functionality from the load queue. The load queue can therefore be implemented as a first-in-first-out buffer, like the reorder buffer, which is fundamentally more scalable and power-efficient. In order to mitigate the bandwidth and resource occupancy costs of replay, a set of heuristics filter the set of loads that must be replayed, resulting in negligible performance degradation and data cache bandwidth increases relative to a conventional machine
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
