We present an abstraction to replace the t of n assumption used in designing fault-tolerant algorithms. This abstraction models dependent process failures yet it is as simple to use as the t of n assumption. To illustrate this abstraction, we consider the Consensus problem for synchronous and asynchronous systems with both crash and arbitrary process failures. We give process replication requirements for our model and describe algorithms for system configurations satisfying these requirements. By considering failure correlations, we enable the solution of Consensus for system configurations with arbitrary failures in which it is not possible when forced to use protocols designed under the t of n assumption. Additionally, we are able to solve Consensus with fewer rounds in synchronous systems with crash failures.
The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, email@example.com.
[ Search ]