In this paper, we generalize the lower bound on the number of rounds for Consensus algorithms assuming that processes fail dependently. This lower bound is general in the sense that it is independent of the failure assumptions for processes. In order to instantiate it, one needs to provide a necessary condition on process replication for a given failure model in terms of our abstractions to represent dependent failures. A surprising corollary of our generalization is that the lower bound on the number of rounds, in general, differs between the crash and the arbitrary failure models.
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 ]