Bounded Concurrent Time-Stamping

DOI10.1137/S0097539790192647zbMATH Open0874.68138OpenAlexW2002992113MaRDI QIDQ4337631FDOQ4337631

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

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

zbMATH Keywords

distributed computingparallel computingconcurrencytime-stampingatomic registersserialization

Mathematics Subject Classification ID

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

Cited In (28)

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

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)