On the performance of a retransmission-based synchronizer
From MaRDI portal
(Redirected from Publication:392190)
Recommendations
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
- The effect of forgetting on the performance of a synchronizer
- The use of a synchronizer yields the maximum computation rate in distributed networks
- Publication:4206383
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
Cites work
- Analytic expansions of max-plus Lyapunov exponents.
- Asymptotic behavior of random discrete event systems
- Asynchronous consensus and broadcast protocols
- Automatically increasing the fault-tolerance of distributed algorithms
- Complexity of network synchronization
- Evaluating the running time of a communication round over the Internet
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- Markov chains and stochastic stability
- Max-Plus Linear Stochastic Systems and Perturbation Analysis
- The Byzantine Generals Problem
- The Heard-Of model: computing in distributed systems with benign faults
- Upper and lower bounds for stochastic marked graphs
Cited in
(5)- The effect of forgetting on the performance of a synchronizer
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
- On the Multihop Performance of Synchronization Mechanisms in High Propagation Delay Networks
- Approximation of synchronous data transmission systems with a small time cycle
- The perfectly synchronized round-based model of distributed computing
This page was built for publication: On the performance of a retransmission-based synchronizer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392190)