2017 · 22 citations · 36 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureParallel ComputingSpeculative DesignCache CoherenceMemory ConsistencyOut-of-order ExecutionSpeculative ExecutionCoherence ProtocolsCommitDirectory-based CoherenceLoad ReorderingOut-of-order Commit MechanismsOut-of-order Memory ConsistencySpeculative Load ExecutionTotal Store Order
In Total Store Order memory consistency (TSO), loads can be speculatively reordered to improve performance. If a load-load reordering is seen by other cores, speculative loads must be squashed and re-executed. In architectures with an unordered interconnection network and directory coherence, this has been the established view for decades. We show, for the first time, that it is not necessary to squash and re-execute speculatively reordered loads in TSO when their reordering is seen. Instead, the reordering can be hidden form other cores by the coherence protocol. The implication is that we can irrevocably bind speculative loads. This allows us to commit reordered loads out-of-order without having to wait (for the loads to become non-speculative) or without having to checkpoint committed state (and rollback if needed), just to ensure correctness in the rare case of some core seeing the reordering. We show that by exposing a reordering to the coherence layer and by appropriately modifying a typical directory protocol we can successfully hide load-load reordering without perceptible performance cost and without deadlock. Our solution is cost-effective and increases the performance of out-of-order commit by a sizable margin, compared to the base case where memory operations are not allowed to commit if the consistency model could be violated.
36
Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh et al. · 2008 · 3.4K citations
GARNET: A detailed on-chip network model inside a full-system simulator
Niket Agarwal, Tushar Krishna, Li-Shiuan Peh et al. · 2009 · 759 citations · Full text
Peter Sewell, Susmit Sarkar, Scott Owens et al. · Communications of the ACM · 2010 · 457 citations