The power of logical clock abstractions
From MaRDI portal
Publication:5138510
Recommendations
Cites work
- scientific article; zbMATH DE number 3867330 (Why is no real title available?)
- scientific article; zbMATH DE number 2080227 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- An efficient implementation of vector clocks
- Concerning the size of logical clocks in distributed systems
- Concurrent common knowledge: Defining agreement for asynchronous systems
- Detecting causal relationships in distributed computations: In search of the holy grail
- Disconnection modes for mobile databases
- Exploiting locality in maintaining potential causality
- How processes learn
- Knowledge and common knowledge in a distributed environment
- Modelling knowledge and action in distributed systems
- Plausible clocks: constant size logical clocks for distributed systems
- The inhibition spectrum and the achievement of causal consistency
- Time, clocks, and the ordering of events in a distributed system
Cited in
(11)- Resettable vector clocks
- Vector time and causality among abstract events in distributed computations
- Resettable vector clocks
- scientific article; zbMATH DE number 1863301 (Why is no real title available?)
- Logical time in distributed software systems
- scientific article; zbMATH DE number 2080227 (Why is no real title available?)
- scientific article; zbMATH DE number 1863304 (Why is no real title available?)
- Detecting causality in the presence of Byzantine processes: the case of synchronous systems
- scientific article; zbMATH DE number 1726627 (Why is no real title available?)
- scientific article; zbMATH DE number 1973023 (Why is no real title available?)
- Analysis of bounds on hybrid vector clocks
This page was built for publication: The power of logical clock abstractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138510)