Concerning the size of logical clocks in distributed systems

DOI10.1016/0020-0190(91)90055-MzbMath0735.68003OpenAlexW2071933194MaRDI QIDQ1182109

Bernadette Charron-Bost

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90055-m

zbMATH Keywords

clockcausalitydistributed computinglogical time

Mathematics Subject Classification ID

Partial orders, general (06A06) Network design and communication in computer systems (68M10)

Related Items (10)

Detecting causal relationships in distributed computations: In search of the holy grail ⋮ Optimal propagation-based protocols implementing causal memories ⋮ The space complexity of unbounded timestamps ⋮ Interval approximations of message causality in distributed executions ⋮ Efficient dependency tracking for relevant events in concurrent systems ⋮ The power of logical clock abstractions ⋮ Precision, recall, and sensitivity of monitoring partially synchronous distributed programs ⋮ An efficient implementation of vector clocks ⋮ Understanding Distributed Program Behavior Using a Multicast Communication Scheme ⋮ On the minimal information to encode timestamps in distributed computations.

Cites Work

• A decomposition theorem for partially ordered sets
• Time, clocks, and the ordering of events in a distributed system
• Unnamed Item

This page was built for publication: Concerning the size of logical clocks in distributed systems