A simple, memory-efficient bounded concurrent timestamping algorithm

DOI10.1007/3-540-36136-7_48MaRDI QIDQ4427876zbMATH OpenFDO

Authors Vivek Shikaripura, Ajay D. Kshemkalyani

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180550.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Bounded Concurrent Time-Stamping
• The space complexity of unbounded timestamps
• Bounded concurrent timestamp systems using vector clocks
• Time-Lapse Snapshots

Cited in

(10)

• Bounded time-stamps
• scientific article; zbMATH DE number 1825103 (Why is no real title available?)
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Bounded concurrent timestamp systems using vector clocks
• The Space Complexity of Unbounded Timestamps
• A New Timestamping Scheme Based on Skip Lists
• Bounded Concurrent Time-Stamping
• Advances in Cryptology – CRYPTO 2004
• Efficient Bounded Timestamping from Standard Synchronization Primitives
• Efficient bounded timestamping from standard synchronization primitives

This page was built for publication: A simple, memory-efficient bounded concurrent timestamping algorithm

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