Simple and efficient bounded concurrent timestamping and the traceable use abstraction
From MaRDI portal
Publication:3158553
DOI10.1145/324133.324161zbMath1065.68501OpenAlexW2025193953MaRDI QIDQ3158553
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (11)
Self-stabilizing timestamps ⋮ The space complexity of unbounded timestamps ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ How a rainbow coloring function can simulate wait-free handshaking ⋮ Efficient Bounded Timestamping from Standard Synchronization Primitives ⋮ Atomic snapshots using lattice agreement ⋮ Keeping track of the latest gossip in a distributed system ⋮ A model for learning the news in social networks ⋮ Bounded time-stamps ⋮ The F-Snapshot Problem
This page was built for publication: Simple and efficient bounded concurrent timestamping and the traceable use abstraction
