Abstract
Loop agreement is a type of distributed decision tasks including many well-known tasks such as set agreement, simplex agreement, and approximation agreement. Because of its elegant combinatorial structure and its important role in the decidability problem of distributed decision tasks, loop agreement has been thoroughly investigated. A classification of loop agreement tasks has been proposed, based on their relative computational power: tasks are in the same class if and only if they can implement each other. However, the classification does not cover such important tasks as consensus, because any loop agreement task allows up to three distinct output values in an execution. So, this paper considers classifying a variation of loop agreement, called degenerate loop agreement, which includes consensus. A degenerate loop agreement task is defined in terms of its decision space and two distinguished vertices in the space. It is shown that there are exactly two equivalence classes of degenerate loop agreement tasks: one represented by the trivial task, and the other by consensus. The classification is totally determined by connectivity of the decision space of a task; if the distinguished points are connected in the space, the task is equivalent to the trivial task, otherwise to consensus.
Chapter PDF
Similar content being viewed by others
References
Attie, P., Guerraoui, R., Kouznetsov, P., Lynch, N., Rajsbaum, S.: The impossibility of boosting distributed service resilience. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, pp. 39–48. IEEE Computer Society, Washington DC, USA (2005)
Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Achievable cases in an asynchronous environment. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pp. 337–346. IEEE Computer Society (1987)
Borowsky, E., Gafni, E.: Generalized flp impossibility result for t-resilient asynchronous computations. In: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing STOC ’93, pp. 91–100. ACM Press, New York, NY, USA (1993)
Chaudhuri, S.: Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: Proceedings of the ninth annual ACM symposium on Principles of distributed computing PODC ’90, pp. 311–324. ACM Press, New York, NY, USA (1990)
Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM) 32(2), 374–382 (1985)
Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)
Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks (extended abstract). In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, pp. 589–98. ACM Press, New York, NY, USA (1997)
Herlihy, M., Rajsbaum, S.: A classification of wait-free loop agreement tasks. Theoretical Computer Science 291(1), 55–77 (2003)
Hoest, G., Shavit, N.: Towards a topological characterization of asynchronous complexity. In: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing PODC ’97, pp. 199–208. ACM Press, New York, NY, USA (1997)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)
Munkres, J.: Elements of Algebraic Topology. Perseus Press (1993)
Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. In: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing STOC ’93, pp. 91–100. ACM Press, New York, NY, USA (1993)
Spanier, E.: Algebraic Topology. Springer (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Liu, X., Pu, J., Pan, J. (2008). A Classification of Degenerate Loop Agreement. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. IFIP International Federation for Information Processing, vol 273. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-09680-3_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09679-7
Online ISBN: 978-0-387-09680-3
eBook Packages: Computer ScienceComputer Science (R0)