The Community for Technology Leaders
2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT) (2012)
Minneapolis, MN, USA
Sept. 19, 2012 to Sept. 23, 2012
ISBN: 978-1-5090-6609-4
pp: 241-251
Alberto Ros , Department of Computer Engineering, University of Murcia, Spain
Stefanos Kaxiras , Department of Information Technology, Uppsala University, Sweden
ABSTRACT
Much of the complexity and overhead (directory, state bits, invalidations) of a typical directory coherence implementation stems from the effort to make it “invisible” even to the strongest memory consistency model. In this paper, we show that a much simpler, directory-less/broadcast-less, multicore coherence can outperform a directory protocol but without its complexity and overhead. Motivated by recent efforts to simplify coherence, we propose a hardware approach that does not require any application guidance. The cornerstone of our approach is a dynamic, application-transparent, write-policy (write-back for private data, write-through for shared data), simplifying the protocol to just two stable states. Self-invalidation of the shared data at synchronization points allows us to remove the directory (and invalidations) completely, with just a data-race-free guarantee from software. This leads to our main result: a virtually costless coherence that outperforms a MESI directory protocol (by 4.8%) while at the same time reducing shared cache and network energy consumption (by 14.2%) for 15 parallel benchmarks, on 16 cores.
INDEX TERMS
Protocols, Coherence, Multicore processing, Complexity theory, Hardware, Proposals,multiple writers, Multicore, simple cache coherence, directory-less protocol, dynamic write policy, self-invalidation
CITATION
Alberto Ros, Stefanos Kaxiras, "Complexity-effective multicore coherence", 2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 241-251, 2012, doi:
90 ms
(Ver 3.3 (11022016))