A simple algorithmic characterization of uniform solvability

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 228-237

  Gafni, Eli ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; EQUIVALENCE CLASSES; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

IMMEDIATE SNAPSHOTS; UNIFORM SOLVABILITY;

ALGORITHMS;

EID: 0036953709     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. J. Aspnes, G. Shah, and J. Shah, "Wait-free consensus with infinite arrivals," To appear in STOC02, 2002.
2. H. Attiya and A. Fouren, "Adaptive and efficient algorithms for lattice agreement and renaming," SICOMP, to appear. An extended abstract appeared in [11].
3. H. Attiya and A. Fouren, "Algorithms adaptive to point contention," JACM, 2001. submitted for publication.
4. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou, "Long-lived renaming made adaptive," in PODC99, pp. 91-103, 1999.
5. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou, "Adaptive long-lived renaming using bounded memory." www.cs.technion.ac.il/~hagit/pubs/AAFST99disc.ps.gz, Apr. 1999.
6. Y. Afek, G. Stupp, and D. Touitou, "Long-lived and adaptive collect with applications," in FOCS99, pp. 262-272, 1999.
7. Y. Afek, G. Stupp, and D. Touitou, "Long-lived adaptive splitter and applications." Unpublished manuscript, Dec. 1999.
8. Y. Afek, G. Stupp, and D. Touitou, "Long-lived and adaptive atomic snapshot and immediate snapshot," in PODC00, pp. 71-80, 2000.
9. J. Anderson and Y.-J. Kim, "Adaptive mutual exclusion with local spinning," in DISC2000, Oct. 2000.
10. H. Attiya and V. Bortnikov, "Adaptive and efficient mutual exclusion," in PODC00, pp. 91-100, 2000.
11. H. Attiya and A. Fouren, "Adaptive wait-free algorithms for lattice agreement and renaming," in PODC98, pp. 277-286, 1998.
12. H. Attiya and A. Fouren, "Adaptive long-lived renaming with read and write operations," Tech. Rep. 956, Faculty of Computer Science, The Technion, Mar. 1999. www.cs.technion.ac.il/~hagit/pubs/tr0956.ps.gz.
13. H. Attiya, A. Fouren, and E. Gafni, "An adaptive collect algorithm with applications," in Distributed Computing, To appear.
14. V. Bortnikov, "Adaptive mutual exclusion," Master's thesis, Department of Computer Science, The Technion, Dec. 2000.
15. M. Choy and A. K. Singh, "Adaptive solutions to the mutual exclusion problem," DC, vol. 8, no. 1, pp. 1-17, 1994.
16. A. Fouren, Adaptive Wait-Free Algorithms for Asynchronous Shared-Memory Systems. PhD thesis, Department of Computer Science, The Technion, June 2001.
17. 2) steps," in DISC2001, 2001. to appear.
18. E. Gafni, M. Merrit, and G. Taubenfeld, "The concurrency hierarchy, and algorithms for unbounded concurrency," in In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001), August 2001.
19. G. L. Peterson, "Time efficient adaptive mutual exclusion algorithms." Ubpublished manuscript, 2000.
20. M. Moir and J. H. Anderson, "Fast, long-lived renaming," in WDAG94, vol. 857 of LNCS, pp. 141-155, SV, 1994.
21. G. Chockler and D. Malkhi, "Active disk paxos," in To appear in PODC 2002, 2002.
22. M. Herlihy and N. Shavit, "The topological structure of asynchronous computability," Journal of the ACM, vol. 46(6), pp. 858-923, 1999.
23. E. Borowsky and E. Gafni, "A simple algorithmically reason characterization of wait-free computations," in Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, pp. 189-198, 1997.
24. G. Hoest and N. Shavit, "Towards a topological characterization of asynchronous complexity," PODC97, pp. 199-209, 1997.
25. E. Borowsky and E. Gafni, "Immediate Atomic Snapshots and Fast Renaming," in Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp. 41-51, 1993.
26. E. Gafni and E. Koutsoupias, "On uniform protocols," preprint, 1998.
27. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merrit, and N. Shavit, "Atomic Snapshots of Shared Memory," in Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pp. 1-13, 1990.
28. S. Chaudhuri, "More choices allow more faults: Set consensus problems in totally asynchronous systems," Information and Computation, vol. 105, pp. 132-158, jul 1993, supercedes 1990 PODC version.
29. M. Herlihy and N. Shavit, "The Asynchronous Computability Theorem for t-Resilient Tasks," in Proceedings of the 25th ACM Symposium on the Theory of Computing, pp. 111-120, 1993.
30. E. Borowsky and E. Gafni, "Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations," in Proceedings of the 25th ACM Symposium on the Theory of Computing, pp. 91-100, 1993.
31. M. Saks and F. Zaharoglou, "Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge," in Proceedings of the 26th ACM Symposium on the Theory of Computing, pp. 101-110, 1993.
32. M. Fischer, N. Lynch, and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," Journal of the ACM, vol. 32, no. 2, pp. 374-382, 1985.
33. E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum, "The BG distributed simulation algorithm," Distributed Computing, vol. 14, pp. 127-146, 2001.
34. E. Borowsky, "Capturing the Power of Resiliency and Set Consensus in Distributed Systems," tech. rep., University of California, Los Angeles, Oct 15, 1995.