Tardis: Time Traveling Coherence Algorithm for Distributed Shared Memory

Author(s)
Yu, Xiangyao; Devadas, Srinivas
Thumbnail
Downloadtardis.pdf (599.0Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
A new memory coherence protocol, Tardis, is proposed. Tardis uses timestamp counters representing logical time as well as physical time to order memory operations and enforce sequential consistency in any type of shared memory system. Tardis is unique in that as compared to the widely-adopted directory coherence protocol, and its variants, it completely avoids multicasting and only requires O(log N) storage per cache block for an N-core system rather than O(N) sharer information. Tardis is simpler and easier to reason about, yet achieves similar performance to directory protocols on a wide range of benchmarks run on 16, 64 and 256 cores.
Date issued
2016-03
URI
http://hdl.handle.net/1721.1/114457
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
2015 International Conference on Parallel Architecture and Compilation (PACT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Yu, Xiangyao, and Srinivas Devadas. "Tardis: Time Traveling Coherence Algorithm for Distributed Shared Memory." 2015 International Conference on Parallel Architecture and Compilation (PACT), 18-21 October, 2015, San Francisco, California, IEEE, 2015, pp. 227–40.
Version: Author's final manuscript
ISBN
978-1-4673-9524-3
Collections