Journal Article10.1109/71.774912
The timed asynchronous distributed system model
Flaviu Cristian,Christof Fetzer +1 more
303
TL;DR: In this article, the authors propose a formal definition for the timed asynchronous distributed system model and present extensive measurements of actual message and process scheduling delays and hardware clock drifts, which confirm that this model adequately describes current distributed systems such as a network of workstations.
read more
Abstract: We propose a formal definition for the timed asynchronous distributed system model. We present extensive measurements of actual message and process scheduling delays and hardware clock drifts. These measurements confirm that this model adequately describes current distributed systems such as a network of workstations. We also give an explanation of why practically needed services, such as consensus or leader election, which are not implementable in the time-free model, are implementable in the timed asynchronous system model.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Clock synchronization for wireless sensor networks: a survey
Bharath Sundararaman,Ugo Buy,Ajay D. Kshemkalyani +2 more
- 01 May 2005
TL;DR: In this paper, a survey and evaluation of clock synchronization protocols based on a palette of factors such as precision, accuracy, cost, and complexity is presented, which can help developers either in choosing an existing synchronization protocol or in defining a new protocol that is best suited to the specific needs of a sensor network application.
Total order broadcast and multicast algorithms: Taxonomy and survey
TL;DR: Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance.
Separating agreement from execution for byzantine fault tolerant services
Jian Yin,Jean-Philippe Martin,Arun Venkataramani,Lorenzo Alvisi,Mike Dahlin +4 more
- 19 Oct 2003
TL;DR: A new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests is described, which reduces replication costs and allows a general privacy firewall architecture to protect confidentiality through replication.
Practical routing in delay-tolerant networks
Evan P. C. Jones,Lily Li,Paul A. S. Ward +2 more
- 22 Aug 2005
TL;DR: A metric that estimates the average waiting time for each potential next hop is designed, which provides performance similar to that of schemes that have global knowledge of the network topology, yet without requiring that knowledge.
Byzantine disk paxos: optimal resilience with byzantine shared memory
TL;DR: Lower bounds are shown on the number of invocation rounds required for optimal resilience reliable register constructions, or more generally, constructions that use less than 4t + 1 fault-prone registers, and on the t-tolerant regular registers constructed in this model.
References
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
4.7K
Internet time synchronization: the network time protocol
TL;DR: The NTP synchronization system is described, along with performance data which show that timekeeping accuracy throughout most portions of the Internet can be ordinarily maintained to within a few milliseconds, even in cases of failure or disruption of clocks, time servers, or networks.
Consensus in the presence of partial synchrony
TL;DR: Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models that allow partially synchronous processors to reach some approximately common notion of time.
Leases: an efficient fault-tolerant mechanism for distributed file cache consistency
Cary Gordon Gray,David R. Cheriton +1 more
- 01 Nov 1989
TL;DR: An analytic model and an evaluation for file access in the V system show that leases of short duration provide good performance and the impact of leases on performance grows more significant in systems of larger scale and higher processor performance.
Probabilistic clock synchronization
TL;DR: A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays and can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms.