Pacific Rim International Symposium on Dependable Computing, IEEE (2007)
Melbourne, Victoria, Australia
Dec. 17, 2007 to Dec. 19, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2007.20
Failure detector class k has been defined in  as an extension to failure detector , and an algorithm has been given in  to solve k-set agreement using k in asynchronous message-passing systems. In this paper, we extend these previous work in two directions. First, we define two new classes of failure detectors k and k, which are new ways of extending , and show that they are equivalent to k. Class k is more flexible than k in that it does not require the outputs to stabilize eventually, while class k does not refer to other processes in its outputs. Second, we present a new algorithm that solves k-set agreement using k when a majority of processes do not crash. The algorithm is a faithful extension of the Paxos algorithm , and thus it inherits the efficiency, flexibility, and robustness of the Paxos algorithm. In particular, it has better message complexity than the algorithm in . Both the new failure detectors and the new algorithm enrich our understanding of the k-set agreement problem.
X. Liu, W. Chen, J. Zhang and Y. Chen, "Failure Detectors and Extended Paxos for k-Set Agreement," Pacific Rim International Symposium on Dependable Computing, IEEE(PRDC), Melbourne, Victoria, Australia, 2007, pp. 69-76.