Effectiveness of delaying timestamp computation

DOI10.1145/3087801.3087818MaRDI QIDQ5368975zbMATH OpenOpenAlexFDO

Authors Sandeep S. Kulkarni, Nitin H. Vaidya

Publication date 11 October 2017

Published in Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

causalityvector clocksinline timestamps

Mathematics Subject Classification ID

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

Recommendations

• Interval approximations of message causality in distributed executions
• Vector time and causality among abstract events in distributed computations
• Timestamping messages and events in a distributed system using synchronous communication
• On the minimal information to encode timestamps in distributed computations.
• A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION

Cited in

(3)

• Timestamping messages and events in a distributed system using synchronous communication
• scientific article; zbMATH DE number 1825103 (Why is no real title available?)
• A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION

This page was built for publication: Effectiveness of delaying timestamp computation

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