Brief announcement: Optimal record and replay under causal consistency

Russell L. Jones, Muhammad S. Khan, Nitin H. Vaidya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationPODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages277-279
Number of pages3
ISBN (Print)9781450357951
DOIs
StatePublished - Jul 23 2018
Event37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 - Egham, United Kingdom
Duration: Jul 23 2018Jul 27 2018

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018
Country/TerritoryUnited Kingdom
CityEgham
Period7/23/187/27/18

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Brief announcement: Optimal record and replay under causal consistency'. Together they form a unique fingerprint.

Cite this