Bounded concurrent timestamp systems using vector clocks

DOI10.1145/505241.505246zbMath1323.68408arXivcs/0108002OpenAlexW2161867035MaRDI QIDQ3196636

S. Haldar, Paul M. B. Vitányi

Publication date: 30 October 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0108002

zbMATH Keywords

labelingscantraceabilitywait-freedomvector clockconcurrent reading while writingnonatomic operation executionread and writeshared variable-safetimestamp system

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (8)

Byzantine disk paxos: optimal resilience with Byzantine shared memory ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Wait-free regular storage from Byzantine components ⋮ On the interconnection of message passing systems ⋮ The space complexity of unbounded timestamps ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Efficient Bounded Timestamping from Standard Synchronization Primitives ⋮ Randomized two-process wait-free test-and-set

This page was built for publication: Bounded concurrent timestamp systems using vector clocks