On the minimal information to encode timestamps in distributed computations.

DOI10.1016/S0020-0190(02)00241-7MaRDI QIDQ1853128zbMATH OpenOpenAlexFDO

Authors Roberto Baldoni, Giovanna Melideo

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(02)00241-7

zbMATH Keywords

Causal pastsCausality relationDistributed computingTimestampsVector clocks

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION
• Interval approximations of message causality in distributed executions
• Vector time and causality among abstract events in distributed computations
• The space complexity of unbounded timestamps
• The Space Complexity of Unbounded Timestamps

Cites work

• An efficient implementation of vector clocks
• Concerning the size of logical clocks in distributed systems
• Detecting causal relationships in distributed computations: In search of the holy grail
• Time, clocks, and the ordering of events in a distributed system

Cited in

(5)

• Special points on products of modular curves
• Optimal propagation-based protocols implementing causal memories
• scientific article; zbMATH DE number 1696536 (Why is no real title available?)
• A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION
• Effectiveness of delaying timestamp computation

This page was built for publication: On the minimal information to encode timestamps in distributed computations.

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