Efficient Bounded Timestamping from Standard Synchronization Primitives

DOI10.1145/3583668.3594601OpenAlexW4380874976MaRDI QIDQ6202232FDOQ6202232

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

distributed algorithmsconcurrencyshared memorytimestamping

Mathematics Subject Classification ID

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

Cites Work

• Time, clocks, and the ordering of events in a distributed system
• Composite registers
• Time-Lapse Snapshots
• Atomic snapshots of shared memory
• A new solution of Dijkstra's concurrent programming problem
• Anonymous and fault-tolerant shared-memory computing
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Bounded concurrent timestamp systems using vector clocks
• The space complexity of unbounded timestamps
• Bounded Concurrent Time-Stamping
• The space complexity of long-lived and one-shot timestamp implementations
• Efficient and practical constructions of LL/SC variables
• Making objects writable
• Title not available (Why is that?)

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)