Exploiting locality in maintaining potential causality

DOI10.1145/112600.112620MaRDI QIDQ5255823zbMATH OpenOpenAlexFDO

Authors Sigurd Meldal, Sriram Sankar, James Vera

Publication date 19 June 2015

Published in Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/112600.112620

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cited in

(4)

• An efficient implementation of vector clocks
• Detecting causal relationships in distributed computations: In search of the holy grail
• The power of logical clock abstractions
• Plausible clocks: constant size logical clocks for distributed systems

This page was built for publication: Exploiting locality in maintaining potential causality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255823)