Solvability in asynchronous environments II: Finite interactive tasks

SIAM Journal on Computing

Volumn 29, Issue 2, 1999, Pages 351-377

  Chor, Benny ^a   Nelson, Lee Bath ^b  

^a MASSEY UNIVERSITY   (New Zealand)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; DATA COMMUNICATION SYSTEMS; DECISION THEORY; FAULT TOLERANT COMPUTER SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; RANDOM PROCESSES; RESPONSE TIME (COMPUTER SYSTEMS);

ASYNCHRONOUS DISTRIBUTED SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033301135     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795294979     Document Type: Article

References (30)

1. J. ASPNES, Time-and Space-Efficient Randomized Consensus, J. Algorithms, 14 (1993), pp. 414-431.
2. J. ASPNES AND M. HERLIHY, Fast randomized consensus using shared memory, J. Algorithms, 11 (1990), pp. 441-461.
3. 2 n) Operations per Processor, SIAM J. Comp., 25 (1996), pp. 1024-1044.
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. A. BAR-NOY AND D. DOLEV, A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment, Math. Systems Theory, 26 (1993), pp. 21-39.
7. M. BEN-OR, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, in Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, 1983, pp. 27-30.
8. E. BOROWSKY AND E. GAFNI, Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations, in Proceedings of the 25th Symposium on the Theory of Computing, 1993, pp. 91-100.
9. 2 log n) Operations, TR-671, Technion, Haifa, Israel, 1991.
10. T. D. CHANDRA AND S. TOUEG, Unreliable failure detectors for reliable distributed systems, J. ACM, 43 (1996), pp. 225-267.
11. B. CHOR, A. ISRAELI, AND M. LI, Wait-Free Consensus Using Asynchronous Hardware, SIAM J. Comput., 23 (1994), pp. 701-712; conference version in Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 86-97.
12. B. CHOR, A. ISRAELI, AND M. LI, Wait-Free Consensus Using Asynchronous Hardware, SIAM J. Comput., 23 (1994), pp. 701-712; conference version in Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 86-97.
13. B. CHOR, M. MERRITT, AND D. SHMOYS, Simple constant time consensus protocols in realistic failure models, J. ACM, 36 (1989), pp. 591-614.
14. B. CHOR AND L. MOSCOVICI, Solvability in Asynchronous Environments, in Proceedings of the 30th Symposium on Foundations of Computer Science, 1989, pp. 422-427.
15. B. CHOR AND L. NELSON, Resiliency of Interactive Distributed Tasks, in Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, 1991, pp. 37-49.
16. D. DOLEV, DWORK C., AND L. STOCKMEYER, On the minimal synchronism needed for distributed consensus, J. ACM, 34 (1987), pp. 77-97.
17. M. FISCHER, N. LYNCH, AND M. PATERSON, Impossibility of distributed consensus with one faulty process, J. ACM, 32 (1985), pp. 374-382.
18. M. HERLIHY, Wait-free synchronization, ACM Trans. Programming Languages Systems, 13 (1991), pp. 124-149.
19. M. HERLIHY AND N. SHAVIT. The Asynchronous Computability Theorem for t-Resilient Tasks, in Proceedings of the 25th Symposium on the Theory of Computing, 1993, pp. 111-120.
20. L. LAMPORT, On interprocess communication, Distrib. Comput., 1 (1986), pp. 77-101.
21. D. LEHMANN AND M. RABIN. On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem, in Proceedings of the 8th Principles of Programming Languages, 1981, pp. 133-138.
22. M. C. LOUI AND H. H. ABU-AMARA, Memory requirements for agreement among unreliable asynchronous processes, in Advances in Computing Research, JAI press, Greenwich, CT, 1987, pp. 163-183.
23. S. MORAN AND Y. WOLFSTAHL, Extended impossibility results for asynchronous complete networks, Inform. Process. Lett., 26 (1987), pp. 145-151.
24. S. PLOTKIN, Sticky Bits and the Universality of Consensus, in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 159-176.
25. M. RABIN, Randomized Byzantine Generals, in Proceedings of the 24th Symposium on Foundations of Computer Science, 1983, pp. 403-409.
26. M. RABIN, The choice coordination problem, Acta Inform., 17 (1984), pp. 121-134.
27. M. SAKS, N. SHAVIT, AND H. WOLL, Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice, in Proceedings of the 2nd ACM Symposium on Discrete Algorithms, 1991, pp. 351-362.
28. M. SAKS AND F. ZAHAROGLOU, Wait-Free k-set Agreement is Impossible: The Topology of Public Knowledge, in Proceedings of 25th Symposium on the Theory of Computing, 1993, pp. 111-120.
29. G. TAUBENFELD, S. KATZ, AND S. MORAN, Initial failures in distributed computations, Internat. J. Parallel Programming, 18 (1989), pp. 255-276.
30. G. TAUBENFELD AND S. MORAN, Possibility and impossibility results in a shared memory environment, Acta Inform., 33 (1996), pp. 1-20.