Resettable vector clocks

DOI10.1145/343477.343628zbMath1314.68055OpenAlexW1993990529MaRDI QIDQ5176788

Sandeep S. Kulkarni, Murat Demirbas, Anish Arora

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343477.343628

zbMATH Keywords

stabilizationfault-tolerancevector clocksbounded-spacecomponent substitutabilityreset events

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (4)

Preserving stabilization while \textit{practically} bounding state space using incorruptible partially synchronized clocks ⋮ Efficient dependency tracking for relevant events in concurrent systems ⋮ Concise version vectors in WinFS ⋮ When consensus meets self-stabilization

This page was built for publication: Resettable vector clocks