Three-processor tasks are undecidable

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 970-983

  Gafni, Eli ^a   Koutsoupias, Elias ^a  

^a University of California   (United States)

Author keywords

Asynchronous distributed computation; Contractibility problem; Task solvability; Wait free computation

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS;

ASYNCHRONOUS DISTRIBUTED COMPUTATION; CONTRACTIBILITY PROBLEM; TASK SOLVABILITY; WAIT FREE COMPUTATION;

COMPUTATION THEORY;

EID: 0032256640     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796305766     Document Type: Article

References (21)

1. O. BIRAN, S. MORAN, AND S. ZAKS, A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, in Proc. 7th ACM Symposium on Principles of Distributed Computing, Toronto, Ont., Canada, ACM, New York, 1988, pp. 263-275.
2. E. BOROWSKY, Capturing the Power of Resiliency and Set Consensus in Distributed Systems, Ph.D. thesis, University of California, Los Angeles, 1995.
3. E. BOROWSKY AND E. GAFNI, Generalized FLP impossibility result for t-resilient asynchronous computations, in Proc. 25th ACM Symposium on the Theory of Computing, San Diego, CA, ACM, New York, 1993, pp. 91-100.
4. M. DEHN, Über die topologie des dreidimensional raumes, Math. Ann., 69 (1910), pp. 137-168 (in German);
5. Papers on Group Theory and Topology, Springer-Verlag, New York, 1987 (in English).
6. T. K. DEY AND S. GUHA, Optimal algorithms for curves on surfaces, in Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 266-274.
7. M. FISCHER, N. LYNCH, AND M. PATERSON, Impossibility of distributed consensus with one faulty process, J. Assoc. Comput. Mach., 32 (1985), pp. 374-382.
8. E. GAFNI AND E. KOUTSOUPIAS, 3-processor tasks are undecidable, in Proc. 14th Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ont., Canada, ACM, New York, 1995, p. 271 (abstract).
9. M. HERLIHY AND S. RAJSBAUM, The decidability of distributed decision tasks, in Proc. 29th ACM Symposium on the Theory of Computing, El Paso, TX, ACM, New York, 1997, pp. 589-598.
10. M. HERLIHY AND N. SHAVIT, The asynchronous computability theorem for t-resilient tasks, in Proc. 25th ACM Symposium on the Theory of Computing, San Diego, CA, ACM, New York, 1993, pp. 111-120.
11. M. HERLIHY AND N. SHAVIT, A simple constructive computability theorem for wait-free computation, in Proc. 26th ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, ACM, New York, 1994, pp. 101-110.
12. M. HERLIHY AND N. SHAVIT, The Topological Structure of Asynchronous Computability, Tech. report CS-96-03, Department of Computer Science, Brown University, Providence, RI, 1996.
13. P. JAYANTI AND S. TOUEG, Some results on the impossibility, universality and decidability of consensus, in Proc. 6th Workshop on Distributed Algorithms, Haifa, Israel, 1992, pp. 68-84.
14. W. S. MASSEY, Algebraic Topology: An Introduction, Harcourt, Brace and World, New York, 1967.
15. J. R. MUNKRES, Elements of Algebraic Topology, Addison-Wesley, Reading, MA, 1984.
16. P. S. NOVIKOV, On the Algorithmic Unsolvability of the Word Problem in Group Theory, Trudy Mat. Inst. im. Steklov. 44, Izdat. Akad. Nauk SSSR, Moscow, 1955, (in Russian).
17. English translation available as On the algorithmic insolvability of the word problem in group theory, AMS Trans., 2 (1958), pp. 1-122.
18. J. J. ROTMAN, An Introduction to the Theory of Groups, 4th ed., Grad. Texts in Math., Springer-Verlag, New York, 1995.
19. M. SAKS AND F. ZAHAROGLOU, Wait-free k-set agreement is impossible: The topology of public knowledge, in Proc. 26th ACM Symposium on the Theory of Computing, San Diego, CA, ACM, New York, 1993, pp. 101-110.
20. H. SEIFERT AND W. THRELFALL, A Textbook in Topology, Academic Press, New York, 1980.
21. J. STILLWELL, Classical Topology and Combinatorial Group Theory, 2nd ed., Grad. Texts in Math., Springer-Verlag, New York, 1993.