Concerning the size of logical clocks in distributed systems
From MaRDI portal
Publication:1182109
DOI10.1016/0020-0190(91)90055-MzbMath0735.68003MaRDI QIDQ1182109
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
Related Items
Interval approximations of message causality in distributed executions, The power of logical clock abstractions, The space complexity of unbounded timestamps, An efficient implementation of vector clocks, Detecting causal relationships in distributed computations: In search of the holy grail, On the minimal information to encode timestamps in distributed computations., Efficient dependency tracking for relevant events in concurrent systems, Precision, recall, and sensitivity of monitoring partially synchronous distributed programs, Optimal propagation-based protocols implementing causal memories, Understanding Distributed Program Behavior Using a Multicast Communication Scheme
Cites Work