Plausible clocks: constant size logical clocks for distributed systems

zbMATH Open1448.68169MaRDI QIDQ5137888FDOQ5137888

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

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

zbMATH Keywords

distributed algorithmslogical clockscausality detection

Mathematics Subject Classification ID

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

Cited In (10)

• A distributed algorithm to prevent mutual drift between n logical clocks
• Distributed Computing
• Title not available (Why is that?)
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• The power of logical clock abstractions
• \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication
• Title not available (Why is that?)
• Detecting causality in the presence of Byzantine processes: the case of synchronous systems
• Ubiquity of scalar timing with a Poisson clock
• Efficient dependency tracking for relevant events in concurrent systems

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)