An upper and lower bound for clock synchronization
From MaRDI portal
Recommendations
Cited in
(39)- Towards a real-time distributed computing model
- On the possibility and impossibility of achieving clock synchronization
- Optimal precision in the presence of uncertainty
- A clock synchronization problem with random delays
- Clock synchronization and the power of broadcasting
- Bounds and approximation for clocked interprocessor communication
- Linearizable read/write objects
- Closed form bounds for clock synchronization under simple uncertainty assumptions
- Improved time bounds for linearizable implementations of abstract data types
- Trade-off results for connection management
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
- Reconciling fault-tolerant distributed algorithms and real-time computing
- Gradient clock synchronization
- Verification of clock synchronization algorithms: experiments on a combination of deductive tools
- Real-Time Synchronization of Interprocess Communications
- Clock synchronization and estimation in highly dynamic networks: an information theoretic approach
- Tight bounds for clock synchronization
- Bounds on the time to reach agreement in the presence of timing uncertainty
- Determination of clock synchronization errors in distributed networks
- scientific article; zbMATH DE number 2087367 (Why is no real title available?)
- Time is not a healer (preliminary version)
- Time, clocks, and the ordering of events in a distributed system
- Guaranteeing global synchronization in networks with stochastic interactions
- Hundreds of impossibility results for distributed computing
- Tight bounds for clock synchronization
- Fundamental Limits on Synchronizing Clocks Over Networks
- On using time without clocks via zigzag causality
- Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds
- A framework for the analysis of non-deterministic clock synchronisation algorithms
- Stabilizing phase-clocks
- Fast and space-efficient queues via relaxation
- State machine replication among strangers, fast and self-sufficient
- Gradient clock synchronization in dynamic networks
- Realizability of event diagrams and existence of logical clocks
- Probabilistic clock synchronization
This page was built for publication: An upper and lower bound for clock synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719807)
