Efficient bounded timestamping from standard synchronization primitives

DOI10.1007/S00446-025-00478-8MaRDI QIDQ6909803zbMATH OpenFDO

Authors Philipp Woelfel

Publication date 29 October 2025

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00446-025-00478-8

zbMATH Keywords

concurrencydistributed algorithmsshared memorytimestamping

Mathematics Subject Classification ID

Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Cites work

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

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 Q6909803)