Bounded time-stamps

DOI10.1007/BF02242708MaRDI QIDQ1261108zbMATH OpenFDO

Authors Amos Israeli, Ming Li

Publication date 16 September 1993

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02242708

zbMATH Keywords

bounded protocolsprecedence relationtime-stamps

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Review text

We develop a theory of bounded time-stamps. Time-stamp schemes are defined and the complexity of their implementation is analyzed. This indicates a direction for developing a general tool for converting time- stamp based protocols to bounded protocols.

Recommendations

• Bounded Concurrent Time-Stamping
• The Space Complexity of Unbounded Timestamps
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Advances in Cryptology – CRYPTO 2004
• scientific article; zbMATH DE number 1979529

Cites work

• A Constructive Solution to a Tournament Problem
• A new solution of Dijkstra's concurrent programming problem
• A new solution to the critical section problem
• Cooperative Distributed Algorithms for Dynamic Cycle Prevention
• Distributed network protocols
• On a Problem in Graph Theory
• On a Problem of Schütte and Erdös
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• The mutual exclusion problem
• The mutual exclusion problem
• Time-Lapse Snapshots

Cited in

(19)

• Highly-fair bakery algorithm using symmetric tokens
• Bounded time-stamping in message-passing systems
• Self-stabilizing timestamps
• Efficient algorithms for checking the atomicity of a run of read and write operations
• Space lower bounds for the signal detection problem
• Practically stabilizing SWMR atomic memory in message-passing systems
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
• Time and space optimal implementations of atomic multi-writer register
• The F-Snapshot Problem
• scientific article; zbMATH DE number 1825103 (Why is no real title available?)
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• The space complexity of unbounded timestamps
• Time stamps for fixed-point approximation
• Atomic snapshots using lattice agreement
• Randomized two-process wait-free test-and-set
• Towards a practical snapshot algorithm
• Self-stabilizing \(\ell\)-exclusion
• Efficient and robust sharing of memory in message-passing systems (extended abstract)
• Nonatomic dual bakery algorithm with bounded tokens

This page was built for publication: Bounded time-stamps

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