Tardis: Time Traveling Coherence Algorithm for Distributed Shared Memory
Name
tardis.pdf
Size
599.04 KB
Format
Adobe PDF
Checksum (MD5)
146f5c8a499d2a3b83f6f721b7120f25
Author(s)
Yu, Xiangyao
Devadas, Srinivas
Date Issued
March 2016
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
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/PACT.2015.12
