The topological structure of asynchronous computability

Journal of the ACM

Volumn 46, Issue 6, 1999, Pages 858-923

  Herlihy, Maurice ^a   Shavit, Nir ^b  

^a BROWN UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algebraic topology; Asynchronous distributed computation; Decision tasks; Distributed computing; Homology; Simplicial complex; Wait free algorithms

Indexed keywords

ASYNCHRONOUS DISTRIBUTED COMPUTATION; COMBINATORIAL TOPOLOGY; DISTRIBUTED COMPUTING;

ALGEBRA; COMBINATORIAL MATHEMATICS; DATA STORAGE EQUIPMENT; DECISION MAKING; FUNCTIONS; NETWORK PROTOCOLS; PROBLEM SOLVING;

TOPOLOGY;

EID: 0001059575     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/331524.331529     Document Type: Article

References (39)

1. AFEK, Y., ATTIYA, H., DOLEV, D., GAFNI, E., MERRITT, M., AND SHAVIT, N. 1990. Atomic snapshots of shared memory. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (Quebec City, Que., Canada, Aug. 22-24). ACM, New York, pp. 1-14.
2. AFEK, Y., AND STUPP, G. 1993. Synchronization power depends on the register size (preliminary version). In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, Calif. 195-205.
3. ANDERSON, J. 1990. Composite registers. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing (Quebec City, Que., Canada, Aug. 22-24). ACM, New York, pp. 15-30.
4. ATTIYA, H., BAR-NOY, A., DOLEV, D., PELEG, D., AND REISCHUK, R. 1990. Renaming in an asynchronous environment. J. ACM, July.
5. ATTIYA, H., LYNCH, N., AND SHAVIT, N. 1990. Are wait-free algorithms fast? In Proceedings of the 31st Annual Symposium on the Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif. 55-64.
6. ATTIYA, H., AND RAJSBAUM, S. 1995. A combinatorial topology framework for wait-free computa- bility. Preprint.
7. ATTIYA, H., AND WELCH, J. 1998. Distributed Computing: fundamentals, simulations and advanced topics. McGraw-Hill, London, England. ISBN 0-07-7093526.
8. BAR-NOY, A., AND DOLEV, D. 1989. Shared-memory vs. message-passing in an asynchronous distributed environment. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (Edmonton, Alb., Canada, Aug. 14-16). ACM, New York, pp. 307-318.
9. BIRAN, O., MORAN, S., AND ZAKS, S. 1988. A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (Toronto, Ont., Canada, Aug. 15-17). ACM, New York, pp. 263-275.
10. BOROWSKY, E. 1995. Capturing the power of resiliency and set consensus in distributed systems. Tech. rep., University of California Los Angeles, Los Angeles, Calif.
11. BOROWSKY, E., AND GAFNI, E. 1993. Generalized FLP impossibility result for /-resilient asynchronous computations. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 91-100.
12. BOROWSKY, E., AND GAFNI, E. 1993. Immediate atomic snapshots and fast renaming. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (Ithaca, N.Y., Aug. 15-18). ACM, New York, pp. 41-52.
13. CHAUDHURI, S. 1990. 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 (Quebec City, Que., Canada, Aug. 22-24). ACM, New York, pp. 311-324.
14. CHAUDHURI, S., HERLIHY, M. P., LYNCH, N., AND TUTTLE, M. R. 1993. A tight lower bound for A'-set agreement. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (Oct.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 206-215.
15. CHOR, B., ISRAELI, A., AND Li, M. 1987. On processor coordination using asynchronous hardware. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, pp. 86-97.
16. CHOR, B., AND MOSCOVICI, L. 1989. Solvability in asynchronous environments. In IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, Calif., pp. 422-427.
17. DOLEV, D., DWORK, C., AND STOCKMEYER, L. 1987. On the minimal synchronism needed for distributed consensus.J. ACM34, 1 (Jan.), 77-97.
18. FEKETE, A. 1986. Asymptotically optimal algorithms for approximate agreement. In Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing (Calgary, Alb., Canada, Aug. 11-13). ACM, New York, pp. 73-87.
19. FISCHER, M., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed commit with one faulty process. J. ACM 32, 2 (Apr.).
20. GAFNI, E., AND KOUTSOUPIAS, E. 1996. Three-processor tasks are undecidable. http://daphne.cs.ucla.edu/eli/undec.ps.
21. GLASER, L. C. 1970. Geometrical Combinatorial Topology, Vol. 1. Van Nostrand Reinhold, New York.
22. HERLIHY, M. P. 1991. Wait-free synchronization. ACM Trans. Prag. Lang. Syst. 13, 1 (Jan.), 123-149.
23. HERLIHY, M. P., AND RAJSBAUM, S. 1994. Set consensus using arbitrary objects. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 324-333.
24. HERLIHY, M., AND RAJSBAUM, S. 1995. Algebraic spans. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (Ottawa, Ont., Canada, Aug. 20-23). ACM, New York, pp. 90-99.
25. HERLIHY, M. P., AND RAJSBAUM, S. 1997. The decidability of distributed decision tasks. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 589-598.
26. HERLIHY, M., AND RAJSBAUM, S. 1998. A wait-free classification of loop agreement tasks. In Proceedings of the 12th International Symposium on Distributed Computing (Sept.). Springer-Verlag, New York, pp. 175-185.
27. HERLIHY, M. P., RAJSBAUM, S., AND TUTTLE, M. R. 1998. Unifying synchronous and asynchronous message-passing models. In Proceedings of the 12th International Symposium on Distributed Computing (Sept.).
28. HERLIHY, M. P., AND SHAVIT, N. 1993. The asynchronous computability theorem for f-resilient tasks. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 111-120.
29. HERLIHY, M. P., AND SHAVIT, N. 1994. A simple constructive computability theorem for wait-free computation. In Proceedings of the 26th Annual ACM Symposium on the Tlieoiy of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 243-252.
30. HERLIHY, M. P., AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Prag. Lang. Syst. 12, 3 (July), 463-492.
31. HOEST, G. 1997. Towards a Topological Characterization of Asynchronous Complexity. Ph.D. dissertation. Mass. Institute of Technology, Cambridge, Mass.
32. HOEST, G., AND SHAVIT, N. 1997. Towards a topological characterization of asynchronous complexity. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (Santa Barbara, Calif., Aug. 21-24). ACM, New York, pp. 199-208.
33. LEFSCHETZ, S. 1949. Introduction to Topology. Princeton University Press,
34. Princeton, N.J. Loui, M. C., AND ABU-AMARA, H. H. 1987. Memory Requirements for Agreement Among Unreliable Asynchronous Processes, vol. 4. JAI Press, Greenwich, Conn., pp. 163-183.
35. LYNCH, N. A. 1996. Distributed Algorithms. Morgan-Kaufmann, New York.
36. LYNCH, N. A., AND TUTTLE, M. R. 1988. An introduction to input/output automata. Tech. Rep. MIT/LCS/TM-373. MIT Laboratory for Computer Science, Cambridge, Mass.
37. MUNKRES, J. R. 1984. Elements of Algebraic Topology. Addison-Wesley, Reading, Mass. ISBN 0-201-04586-9.
38. SAKS, M., AND ZAHAROGLOU, F. 1993. Wait-free &-set agreement is impossible: The topology of public knowledge. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 101-110.
39. SPANIER, E. H. 1966. Algebraic Topology. Springer-Verlag, New York.