Simple and efficient bounded concurrent timestamping and the traceable use abstraction

DOI10.1145/324133.324161MaRDI QIDQ3158553zbMATH OpenOpenAlexFDO

Authors Cynthia Dwork, Orli Waarts

Publication date 25 January 2005

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

Full work available at URL https://doi.org/10.1145/324133.324161

Mathematics Subject Classification ID

Distributed systems (68M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1979529
• Bounded Concurrent Time-Stamping
• Bounded time-stamps
• Bounded concurrent timestamp systems using vector clocks
• Time-Lapse Snapshots

Cited in

(17)

• Bounded time-stamps
• Self-stabilizing timestamps
• A model for learning the news in social networks
• Lower and upper bounds for single-scanner snapshot implementations
• Time-stamps for Mazurkiewicz traces.
• A scalable, correct time-stamped stack
• The F-Snapshot Problem
• Bounded concurrent timestamp systems using vector clocks
• The space complexity of unbounded timestamps
• Bounded Concurrent Time-Stamping
• scientific article; zbMATH DE number 1979529 (Why is no real title available?)
• Time stamps for fixed-point approximation
• How a rainbow coloring function can simulate wait-free handshaking
• Atomic snapshots using lattice agreement
• Keeping track of the latest gossip in a distributed system
• Efficient Bounded Timestamping from Standard Synchronization Primitives
• Efficient bounded timestamping from standard synchronization primitives

This page was built for publication: Simple and efficient bounded concurrent timestamping and the traceable use abstraction

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