Learn More
We present a new fault-tolerant intersection function ¥ , which satisfies the Lipschitz condition for the uniform metric and is optimal among all functions with this property. ¥ thus settles Lamport's question about such a function raised in [5]. Our comprehensive analysis reveals that ¥ has exactly the same worst-case performance as the optimal Marzullo(More)
This paper 1 introduces a simple fault-tolerant tick generation algorithm based on Srikanth & Toueg's consistent broadcast primitive that can be directly implemented in VLSI using asynchronous digital logic. The need for adaption originates from two peculiarities of hardware implementations: (i) Fine-grained parallel asynchronous computations, which(More)
We provide a suite of impossibility results and lower bounds for the required number of processes and rounds for synchronous consensus under transient link failures. Our results show that consensus can be solved even in presence of O(n 2) moving omission and/or arbitrary link failures per round, provided that both the number of affected outgoing and(More)
1. THE FINITE AVERAGE MODEL It has long been known that the consensus problem cannot be solved deterministically in completely asynchronous distributed systems, i.e., systems (1) without assumptions on communication delays and relative speed of processes and (2) without access to real-time clocks. We introduce a new asynchronous system model (we call it the(More)
This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of (Gray, 1978). Instead of using randomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that(More)