Efficient Bounded Timestamping from Standard Synchronization Primitives

DOI10.1145/3583668.3594601MaRDI QIDQ6202232zbMATH OpenOpenAlexFDO

Authors Philipp Woelfel

Publication date 26 March 2024

Published in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

concurrencydistributed algorithmsshared memorytimestamping

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites work

• A new solution of Dijkstra's concurrent programming problem
• Anonymous and fault-tolerant shared-memory computing
• Atomic snapshots of shared memory
• Bounded Concurrent Time-Stamping
• Bounded concurrent timestamp systems using vector clocks
• Composite registers
• Efficient and practical constructions of LL/SC variables
• scientific article; zbMATH DE number 1979529 (Why is no real title available?)
• Making objects writable
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• The space complexity of unbounded timestamps
• Time, clocks, and the ordering of events in a distributed system
• Time-Lapse Snapshots

This page was built for publication: Efficient Bounded Timestamping from Standard Synchronization Primitives

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