Plausible clocks: constant size logical clocks for distributed systems

MaRDI QIDQ5137888zbMATH OpenFDO

Authors Francisco J. Torres-Rojas, Mustaque Ahamad

Publication date 3 December 2020

Full work available at URL https://link.springer.com/article/10.1007/s004460050065

zbMATH Keywords

distributed algorithmslogical clockscausality detection

Mathematics Subject Classification ID

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

Recommendations

• Distributed Computing
• Concerning the size of logical clocks in distributed systems
• Efficient vector time with dynamic process creation and termination
• scientific article; zbMATH DE number 1863301
• scientific article; zbMATH DE number 1973023

Cited in

(12)

• scientific article; zbMATH DE number 1863301 (Why is no real title available?)
• Efficient dependency tracking for relevant events in concurrent systems
• \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication
• The power of logical clock abstractions
• Ubiquity of scalar timing with a Poisson clock
• Efficient dependency tracking for relevant events in shared-memory systems
• Detecting causality in the presence of Byzantine processes: the case of synchronous systems
• Distributed Computing
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• scientific article; zbMATH DE number 1863304 (Why is no real title available?)
• Plausible clocks: constant size logical clocks for distributed systems
• A distributed algorithm to prevent mutual drift between n logical clocks

This page was built for publication: Plausible clocks: constant size logical clocks for distributed systems

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