Bounded Concurrent Time-Stamping

DOI10.1137/S0097539790192647MaRDI QIDQ4337631zbMATH OpenOpenAlexFDO

Authors 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

atomic registersconcurrencydistributed computingparallel computingserializationtime-stamping

Mathematics Subject Classification ID

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

Recommendations

• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Bounded concurrent timestamp systems using vector clocks
• scientific article; zbMATH DE number 1979529
• The space complexity of unbounded timestamps
• Time-Adaptive Algorithms for Synchronization

Cited in

(28)

• Bounded time-stamps
• Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
• Self-stabilizing timestamps
• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
• Practically stabilizing SWMR atomic memory in message-passing systems
• Time and space optimal implementations of atomic multi-writer register
• Time-adaptive algorithms for synchronization
• A scalable, correct time-stamped stack
• The F-Snapshot Problem
• Sequentialization using timestamps
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Bounded concurrent timestamp systems using vector clocks
• The space complexity of unbounded timestamps
• The Space Complexity of Unbounded Timestamps
• The DHCP Failover Protocol: A Formal Perspective
• An algorithm for exact bounds on the time separation of events in concurrent systems
• scientific article; zbMATH DE number 1979529 (Why is no real title available?)
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• Randomized two-process wait-free test-and-set
• Locking Timestamps versus Locking Objects
• Advances in Cryptology – CRYPTO 2004
• Towards a practical snapshot algorithm
• Self-stabilizing \(\ell\)-exclusion
• Finite-state concurrent programs can be expressed in pairwise normal form
• Efficient Bounded Timestamping from Standard Synchronization Primitives
• Revisionist simulations: a new approach to proving space lower bounds
• Efficient bounded timestamping from standard synchronization primitives
• Dynamic load balancing with group communication

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337631)