Brief Announcement: Optimal Record and Replay under Causal Consistency
Pages 277 - 279
Abstract
We investigate the minimum record needed to replay executions of processes that share causally consistent memory. For a version of causal consistency, we identify optimal records under both offline and online recording setting. Under the offline setting, a central authority has information about every process' view of the execution and can decide what information to record for each process. Under the online setting, each process has to decide on the record at runtime as the operations are observed.
References
[1]
George W. Dunlap, Dominic G. Lucchetti, Michael A. Fetterman, and Peter M. Chen . 2008. Execution Replay of Multiprocessor Virtual Machines Proceedings of the Fourth ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE '08). ACM, New York, NY, USA, 121--130.
[2]
Nima Honarmand and Josep Torrellas . 2014. RelaxReplay: Record and Replay for Relaxed-consistency Multiprocessors. SIGARCH Comput. Archit. News Vol. 42, 1 (Feb. . 2014), 223--238.
[3]
Russell Llewellyn Jones . 2016. Record and Replay under Relaxed Consistency. Master's thesis. bibinfoschoolUniversity of Illinois at Urbana-Champaign. deftempurl%http://hdl.handle.net/2142/92729 tempurl
[4]
Russell L. Jones, Muhammad S. Khan, and Nitin H. Vaidya . 2018. Optimal Record and Replay under Causal Consistency arXiv: to be submitted.
[5]
Rivka Ladin, Barbara Liskov, Liuba Shrira, and Sanjay Ghemawat . 1992. Providing High Availability Using Lazy Replication. ACM Trans. Comput. Syst. Vol. 10, 4 (Nov. . 1992), 360--391.
[6]
Dongyoon Lee, Benjamin Wester, Kaushik Veeraraghavan, Satish Narayanasamy, Peter M. Chen, and Jason Flinn . 2010. Respec: Efficient Online Multiprocessor Replayvia Speculation and External Determinism. SIGPLAN Not. Vol. 45, 3 (March . 2010), 77--90.
[7]
Robert H. B. Netzer . 1993. Optimal Tracing and Replay for Debugging Shared-memory Parallel Programs. SIGPLAN Not. Vol. 28, 12 (Dec. . 1993), 1--11.
[8]
Robert C. Steinke and Gary J. Nutt . 2004. A Unified Theory of Shared Memory Consistency. J. ACM Vol. 51, 5 (Sept. . 2004), 800--849.
Index Terms
- Brief Announcement: Optimal Record and Replay under Causal Consistency
Recommendations
Brief Announcement: Eventually Consistent Linearizability
PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed ComputingEventually consistent linearizability (ec-linearizability) is a new correctness condition for eventually consistent distributed systems (modeled as shared objects). Unlike the existing definitions of eventual consistency, ec-linearizability is suitable ...
Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model
DISC '08: Proceedings of the 22nd international symposium on Distributed ComputingEmerging distributed systems have a dynamic structure that is self-defined at any time by entities that autonomously decide to locally run the same distributed application. As extreme, a distributed system might thus also cease its existence when no ...
Brief Announcement: Partially Replicated Causally Consistent Shared Memory
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingDistributed shared memory systems maintain multiple replicas of the shared memory registers. Maintaining causal consistency in such systems has received significant attention in the past. However, much of the previous literature focuses on \em full ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2018 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 July 2018
Check for updates
Qualifiers
- Announcement
Funding Sources
- Toyota InfoTechnology Center
- National Science Foundation
Conference
PODC '18
PODC '18: ACM Symposium on Principles of Distributed Computing
July 23 - 27, 2018
Egham, United Kingdom
Acceptance Rates
PODC '18 Paper Acceptance Rate 41 of 163 submissions, 25%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 153Total Downloads
- Downloads (Last 12 months)18
- Downloads (Last 6 weeks)2
Reflects downloads up to 31 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in