Wait-free k-set agreement is impossible: The topology of public knowledge (Extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 101-110

  Saks, Michael ^a   Zaharoglou, Fotios ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FIXED POINT ARITHMETIC; MEMORY ARCHITECTURE; TOPOLOGY; ALGORITHMS; COMPUTER NETWORKS; DATA STRUCTURES; DECISION THEORY; NETWORK PROTOCOLS; PROGRAM PROCESSORS; THEOREM PROVING;

ASYNCHRONOUS SHARED MEMORY; BROUWER FIXED POINT THEOREM; CONSENSUS PROBLEMS; DECISION VALUE; EXTENDED ABSTRACTS; K-SET AGREEMENT PROBLEMS; PUBLIC KNOWLEDGE; TOPOLOGICAL STRUCTURE;

PROBLEM SOLVING; MULTIPROCESSING SYSTEMS;

PUBLIC KNOWLEDGE TOPOLOGY; WAIT FREE K SET AGREEMENT; WAIT FREE PROTOCOL;

EID: 0027188179     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167122     Document Type: Conference Paper

References (22)

1. [A56] P. S. Aleksandrov. Combinatorial Topology. Graylock Press, Rochester, N.Y. 1956.
2. [ALS92] H. Attiya, N. Lynch, and N. Shavit. Are Wait- Free Algorithms Fast? Proceedings of the 31st Annual Symposium on Foundations of Computer Science, October 1990, pp. 55-64.
3. [BG92] E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.
4. [BMZ88] O. Biran, S. Moran and S. Zaks. A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. ACM Symposium on Principles of Distributed Computing, 1988, pp. 263-275.
5. [Ch90] S. Chaudhuri. Agreement is Harder Than Consensus: Set Consensus Problems in Totally Asynchronous Systems ACM Symposium on Principles of Distributed Computing, 1990, pp. 311-324. Also, "More choices allow more faults: set consensus problems in totally asynchronous systems", to appear in Information and Computation, March, 1993.
6. [CZ89] R. Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the PRAM model. ACM Symposium on Parallel Algorithms and Architectures, pp. 169-178, 1989.
7. [DS89] D. Dolev and N. Shavit. Bounded Concurrent Time-Stamp Systems are Constructible! Proc. of the 21th Annual ACM Symposium on Theory of Computing, 1989, pp. 454-465. Also Techni-cal Report, IBM, March 1990.
8. [FLP83] M. Fisher, N. Lynch and M. Paterson. Impossibility of Distributed commit with one Faulty Process. Journal of ACM 32(2), April 1985.
9. [FI86] M. Fisher and N. Immerman. Foundations of knowledge for distributed systems. Theoretical Aspects of Reasoning about Knowledge: Proceedings of the 1986 Conference, pp. 171-185, Morgan Kaufmann, March 1986.
10. [HM90] Y. J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549-587, July 1990.
11. [He91] M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1) January 1991, pp. 124-149.
12. [HS92] M. Herlihy, N. Shavit. The asynchronous com- putability theorem for t-resilient tasks. Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.
13. [IL87] A. Israeli and Ming Li. Bounded Time-Stamps. Proceedings of the 28st Annual Symposium on Foundations of Computer Science, October 1987 pp. 371-382.
14. [La86] L. Lamport. On Interprocess Communication. Part I: Basic Formalism, Part II: Algorithms. Distributed Computing 1, 1986, pp. 77-101.
15. [LA87] M.C. Loui and H.H. Abu-Amara. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Advances in Computing Research, vol. 4, JAI Press, Inc. 1987, pp. 163-183.
16. [MSP90] C. Martel, R. Subramonian and A. Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. Proceeding of the 31∗' symposium on Foundations of Computer Sci-ence, pp. 590-599, 1990.
17. [MT91] M. Merritt and G. Taubenfeld. Knowledge in Shared Memory Systems. Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, pp. 189-200, August 1991.
18. [MW87] S. Moran and Y. Wolfetahl. Extended Impossibility Results for Asynchronous Complete Networks. Information Processing Letters 26 (1987), pp. 145-151.
19. [Mu75] J. R. Munkres. Topology: A first course Prentice Hall 1975.
20. [PB87] G. L. Peterson and J. E. Burns. Concurrent reading while writing II: The multiwriter case. Proceedings of the 28st Annual Symposium on Foundations of Computer Science, October 1987.
21. [RRW91] G. M. Reed, A. W. Roscoe, and R. F. Wachter, Eds. Topology and Category Theory in Computer Science. Oxford Science Publications 1991.
22. [Vi89] S. Vickers. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science 5, Cambridge University Press.