Toward a topological characterization of asynchronous complexity

SIAM Journal on Computing

Volumn 36, Issue 2, 2006, Pages 457-497

  Hoest, Gunnar ^a   Shavit, Nir ^b,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c SUN MICROSYSTEMS   (United States)

Author keywords

Approximate agreement; Asynchronous systems; Immediate snapshots; Shared memory; Simplicial complexes; Subdivisions; Topology

Indexed keywords

APPROXIMATE AGREEMENT; ASYNCHRONOUS SYSTEMS; IMMEDIATE SNAPSHOTS; SHARED MEMORY; SIMPLICIAL COMPLEXES; SUBDIVISIONS;

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DECISION THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 34247273587     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701397412     Document Type: Review

References (34)

1. Y. AFEK, H. ATTIYA,. D. DOLEV, E. GAFNI, M. MERRITT, AND N. SHAVIT, Atomic, snapshots of shared memory, J. ACM, 40 (1993), pp. 873-890.
2. J. ASPNES AND M. P. HERLIHY, Wait-Free Data, Structures in the Asynchronous Pram Model, manuscript, Brown University, Providence, RI, 1996.
3. H. ATTIYA AND S. RAJSBAUM, A Combinatorial Topology Framework for Wait-Free Computability, preprint, The Technion, Haifa, Israel, 1995.
4. H. ATTIYA, A. BAR-NOY, AND D. DOLEV, Sharing memory robustly in message-passing systems, J. ACM, 42 (1995), pp. 124-142.
5. H. ATTIYA, A. BAR-NOY, D. DOLEV, D. PELEG, AND R. REISCHUK, Renaming in an asynchronous environment, J. ACM, 37 (1990), pp. 524-548.
6. H. ATTIYA, N. LYNCH, AND N. SHAVIT, Are wait-free algorithms fast?, J. ACM, 41 (1994), pp. 725-763.
7. O. BIRAN, S. MORAN, AND S. ZAKS, A combinatorial characterization of the distributed 1-solvable tasks, J. Algorithms, 11 (1990), pp. 420-440.
8. E. BOROWSKY, Capturing the Power of Resiliency and Set Consensus in Distributed Systems, Technical report, University of California Los Angeles, Los Angeles, CA, 1995.
9. E. BOROWSKY, E. GAFNI, N. LYNCH, AND S. RAJSBAUM, The BG distributed simulation algorithm, Distrib. Comput., 14 (2001), pp. 127-146.
10. E. BOROWSKY AND E. GAFNI, Generalized FLP impossibility result for t-resilient asynchronous computation, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 91-100.
11. E. BOROWSKY AND E. GAFNI, Immediate atomic snapshots and fast renaming, in Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1993, pp. 41-51.
12. E. BOROWSKY AND E. GAFNI, A simple algorithmically reasoned characterization of wait-free computation (extended abstract), in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1997, pp. 189-198.
13. S. CHAUDHURI, Agreement is harder than consensus: Set consensus problems in totally asynchronous systems, in Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1990, pp. 311-234.
14. S. CHAUDHURI, M. HERLIHY, N. A. LYNCH, AND M. R. TUTTLE, Tight bounds for k-set agreement, J. ACM, 47 (2000), pp. 912-943.
15. D. DOLEV, N. A. LYNCH, S. S. PINTER, E. W. STARK, AND W. E. WEIHL, Reaching approximate agreement in the presence of faults, J. ACM, 33 (1986), pp. 499-516.
16. A.D. FEKETE, Asymptotically optimal algorithms for approximate agreement, in Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1986, pp. 73-87.
17. M. FISCHER, N. A. LYNCH, AND M. S. PATERSON, Impossibility of distributed consensus with one faulty process, J. ACM, 32 (1985), pp. 374-382.
18. E. GAFNI AND E. KOUTSOUPIAS, Three-processor tasks are undecidable. SIAM J. Comput., 28 (1999), pp. 970-983.
19. J. HAVLICEK, Computable obstructions to wait-free computability, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), IEEE Computer Society, Los Alamitos, CA, 1997, pp. 80-89.
20. M. HERLIHY AND S. RAJSBAUM, Set consensus using arbitrary objects (preliminary version), in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1994, pp. 324-333.
21. M. HERLIHY AND S. RAJSBAUM, The decidability of distributed decision tasks (extended abstract), in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, 1997, pp. 589-598.
22. M. HERLIHY AND S. RAJSBAUM, Algebraic spans, Math. Structures Comput. Sci., 10 (2000), pp. 549-573.
23. M. HERLIHY, S. RAJSBAUM, AND M. R. TUTTLE, Unifying synchronous and asynchronous message-passing models, in Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1998, pp. 133-142.
24. M. HERLIHY AND N. SHAVIT, The asynchronous computability theorem for t-resilient tasks, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 111-120.
25. M. HERLIHY AND N. SHAVIT, A simple constructive computability theorem for wait-free computation, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 243-252.
26. M. HERLIHY AND N. SHAVIT, The topological structure of asynchronous computability, J. ACM, 46 (1999), pp. 858-923.
27. M. P. HERLIHY, Wait-free synchronization, ACM Trans. Programming Languages and Systems, 13 (1991), pp. 123-149.
28. N. A. LYNCH AND M. R. TUTTLE, An introduction to input/output automata, CWI Quarterly, 2 (1989), pp. 219-246.
29. N. A. LYNCH, Distributed Algorithms, Morgan-Kaufman, San Francisco, CA, 1996.
30. J. R. MUNKRES, Elements of Algebraic Topology, Addison-Wesley, Reading, MA, 1984.
31. G. NEIGER, Set-linearizability, in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1994, p. 396.
32. M. SAKS AND F. ZAHAROGLOU, Wait-free k-set agreement is impossible: The topology of public knowledge, SIAM J. Comput., 29 (2000), pp. 1449-1483.
33. E. SCHENK, Computability and Complexity Results for Agreement Problems in Shared Memory Distributed Systems, Technical report, University of Toronto, Toronto, Canada, 1996.
34. E. H. SPANIER, Algebraic Topology, Springer-Verlag, New York, 1966.