Effectiveness of delaying timestamp computation

DOI10.1145/3087801.3087818zbMATH Open1380.68055OpenAlexW2738663687MaRDI QIDQ5368975FDOQ5368975

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

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

zbMATH Keywords

causalityvector clocksinline timestamps

Mathematics Subject Classification ID

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

Cited In (3)

• Timestamping messages and events in a distributed system using synchronous communication
• Title not available (Why is that?)
• 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)