Bounded Concurrent Time-Stamping

DOI10.1137/S0097539790192647zbMath0874.68138OpenAlexW2002992113MaRDI QIDQ4337631

Danny Dolev, Nir Shavit

Publication date: 26 May 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539790192647

zbMATH Keywords

parallel computingdistributed computingconcurrencyatomic registerstime-stampingserialization

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (05C99) Distributed algorithms (68W15)

Related Items (14)

Self-stabilizing timestamps ⋮ Dynamic load balancing with group communication ⋮ The space complexity of unbounded timestamps ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Efficient Bounded Timestamping from Standard Synchronization Primitives ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ Randomized two-process wait-free test-and-set ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Time and space optimal implementations of atomic multi-writer register ⋮ Towards a practical snapshot algorithm ⋮ Self-stabilizing \(\ell\)-exclusion ⋮ Finite-state concurrent programs can be expressed in pairwise normal form ⋮ The DHCP Failover Protocol: A Formal Perspective ⋮ The F-Snapshot Problem

This page was built for publication: Bounded Concurrent Time-Stamping