Abstract
In this paper, we present a ◊S x -based solution to solve the k-Set agreement problem for \( f < \frac{{n + k - 1}} {2} \) where f is the maximum number of crashes that can occur and n is the total number of processes. Just as the k-Set agreement problem is a generalization of the consensus problem (at most k different values can be decided), the class of ◊S x failure detectors is a generalization of ◊S x failure detectors, where x, the scope of the accuracy property, is the number of processes that do not have to suspect a correct process. We propose a simple protocol based on the following idea: k - 1 “privileged” processes directly decide their initial value, while the others (n - k + 1 processes) run a 1-Set agreement protocol (i.e., a consensus protocol) to decide on one value. This simple idea enables to tolerate up to (n + k - 1)/2 crash failures, and may lead the k-set agreement problem to be solved in only one broadcast. The protocol is decomposed into three modules. Each process executes either 1, 2 or 3 modules. To reduce the scope of accuracy, more processes have to execute the three modules. But, in that case, more messages have to be exchanged. Finally, the proposed solution considers the degree of repetition of the proposed values and takes advantage of a possible high degree of redundancy of one of them.
This work was supported by the French Ministry of Research - Project GénoGRID of the program ACI ” Globalization of computer resources and data”
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anceaume E., Hurfin M. and Ph. Raipin Parvedy, An Efficient Solution to the k-Set Agreement Problem. Technical Report Irisa 1440, 2001.
Borowsky E. and Gafni E., Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. Proc. 25th ACM Symposium on Theory of Computation, pp. 91–100, 1993.
Chaudhuri S., Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems. Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC’90), pp. 311–324, 1990.
Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225–267, March 1996.
Chandra T., Hadzilacos V. and Toueg S., The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685–722, July 1996.
Dolev D., Dwork C. and Stockmeyer L., On the Minimal Synchronism Needed for Distributed Consensus. Journal of the ACM, 34(1):77–97, January 1987.
Dwork C., Lynch N. and Stockmeyer L., Consensus in the Presence of Partial Synchrony. Journal of the ACM, 35(2):288–323, April 1988.
Fischer M. J., Lynch N. and Paterson M. S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374–382, April 1985.
Hurfin M., Mostéfaoui A. and Raynal M., A Versatile Family of Consensus Protocols Based on Chandra-Touegś Unreliable Failure Detectors. IEEE Transactions on Computers, to appear in 2002.
Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, acm Press (S. Mullender Ed.), New-York, pp. 97–145, 1993.
Hurfin M. and Raynal M., A Simple and Fast Asynchronous Consensus Protocol based on a Weak Failure Detector In Distributed Computing, 12(4):209–223, 1999.
Herlihy M and Shavit N., The Asynchronous Computability Theorem for t- Resilient Tasks. Proc. 25th ACM Symposium on Theory of Computation, pp. 111–120, 1993.
L. Lamport and M. Fisher. ”Byzantine generals and transaction commit protocols”, Technical Report 62, SRI International, April 1982.
Mostéfaoui A. and Raynal M., Solving Consensus Using Chandra-Touegś Unreliable Failure Detectors: a General Quorum-Based Approach. Proc. 13th Int. Symposium on Distributed Computing (DISC’99) (formerly, WDAG), Springer-Verlag LNCS 1693, pp. 49–63, (P. Jayanti Ed.), Bratislava (Slovaquia), September 1999.
Mostéfaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. 19th ACM Symposium on Principles of Distributed Computing, pp. 143–152, Portland (OR), 2000.
Mostéfaoui A., Rajsbaum S and Raynal M., A Versatile and Modular Consensus Protocol. Technical Report Irisa 1427, 18 pages, 2001.
Schiper A., Early Consensus in an Asynchronous System with a Weak Failure Detector. Distributed Computing, 10(3):149–157, 1997.
Yang J., Neiger G. and Gafni E., Structured Derivations of Consensus Algorithms for Failure Detectors. Proc. 17th ACM Symposium on Principles of Distributed Computing, Puerto Vallarta (Mexico), pp. 297–308, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anceaume, E., Hurfin, M., Parvedy, P.R. (2002). An Efficient Solution to the k-Set Agreement Problem. In: Bondavalli, A., Thevenod-Fosse, P. (eds) Dependable Computing EDCC-4. EDCC 2002. Lecture Notes in Computer Science, vol 2485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36080-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-36080-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00012-9
Online ISBN: 978-3-540-36080-3
eBook Packages: Springer Book Archive