On the minimal information to encode timestamps in distributed computations.

DOI10.1016/S0020-0190(02)00241-7zbMath1051.68037OpenAlexW2086834702MaRDI QIDQ1853128

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

Distributed computingCausal pastsCausality relationTimestampsVector clocks

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (2)

Optimal propagation-based protocols implementing causal memories ⋮ Special points on products of modular curves

Cites Work

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

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