Uniform solvability with a finite number of MWMR registers: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2848, Issue , 2003, Pages 16-29

  Aguilera, Marcos K ^a   Englert, Burkhard ^b   Gafni, Eli ^c  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EXTENDED ABSTRACTS; FINITE NUMBER; MUTUAL EXCLUSIONS; RESEARCH QUESTIONS; STEP COMPLEXITY; WEAK TEST;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 35248835650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_2     Document Type: Article

References (34)

1. Y. Afek, P. Boxer and D. Touitou. Bounds on the shared memory requirements for long-lived and adaptive objects. In Proc. of 20th Annual ACM Symp. on Principles of Distributed Computing, pp. 81-89, 2000.
2. Y. Afek, H. Attiya, A. Fouren, G. Stupp and D. Touitou. Long-Lived Renaming made adaptive. Proc. of 18th Annual ACM Symp. on Principles of Distributed Computing: pp. 91-103, 1999.
3. Y. Afek, H. Attiya, G. Stupp and D. Touitou. Adaptive long-lived renaming using bounded memory. Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pp. 262-272, 1999.
4. Y. Afek, D. Dauber and D. Touitou. Wait-free made fast. Proc. of the 27th Ann. ACM Symp. on Theory of Computing: pp. 538-547, 1995.
5. Y. Afek and M. Merritt. Fast, wait-free (2k - 1)-renaming. In Proc. of the 18th Ann. ACM Symp. on Principles of Distributed Computing, pp. 105-112, 1999.
6. Y. Afek, M. Merritt, G. Taubenfeld and D. Touitou. Disentangling multi-object operations. In Proc. of 16th Annual ACM Symp. on Principles of Distributed Computing, pp. 111-120, 1997.
7. Y. Afek, G. Stupp and D. Touitou. Long lived adaptive collect with applications. Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pp. 262-272, 1999.
8. Y. Afek, G. Stupp and D. Touitou. Long lived adaptive splitter and applications. Unpublished manuscript, 1999.
9. Y. Afek, G. Stupp and D. Touitou. Long lived and adaptive atomic snapshot and immediate snapshot. Proc. of the 19th Ann. ACM Symp. on Principles of Distributed Computing, pp. 71-80, 2000.
10. M.K. Aguilera, B. Englert and E. Gafni. On using network attached disks as shared memory. To appear in Proc. of the 22nd Ann. ACM Symp. on Principles of Distributed Computing, 2003.
11. J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. Proceeding of the 14th International Conference, DISC 2000, pp. 29-43, 2000.
12. D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82-93, 1980.
13. J. Aspnes, G. Shah and J. Shah. Wait free consensus with infinite arrivals. Proc. of the 34th Annual ACM Symposium on the Theory of Computing, pp. 524-533, 2002.
14. J. Aspnes and O. Waarts. Modular competitiveness for distributed algorithms. In Proc. 28th ACM Symp. Theory of Comp., pp. 237-246, 1996.
15. H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 91-100, 2000.
16. H. Attiya and E. Dagan. Universal operations: Unary versus binary. In Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, pp. 223-232, 1996.
17. H. Attiya and A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. In Proc. 17th Annual ACM Symp. on Principles of Distributed Computing, pp. 277-286, 1998.
18. H. Attiya and A. Fouren. Adaptive long-lived renaming with read and write operations. Technical Report 0956, Faculty of Computer Science, Technion, Haifa, 1999. http://www.cs.technion.ac.il/hagit/pubs/tr0956.ps.gz.
19. H. Attiya and A. Fouren. Algorithms adaptive to point contention. JACM, 2001, submitted for publication.
20. H. Attiya, A. Fouren and E. Gafni. An adaptive collect algorithm with applications. Distributed Computing, 15(2), pp. 87-96, 2002.
21. J. Burns and N. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation 107(2):pp. 171-184, 1993.
22. M. Choy and A.K. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1), pp. 1-17, 1994.
23. P. Fatourou, F. Fich and E. Ruppert. Space-optimal multi-writer snapshot objects are slow. Proc. 21st Annual ACM Symp. on Principles of Distributed Computing, pp. 13-20, 2002.
24. P. Fatourou, F. Fich and E. Ruppert. A tight lower bound for space-optimal implementations of multi-writer snapshots. Proc. 35th Annual ACM Symp. on Theory of Computing, pp. 259-268, 2003.
25. F. Fich, M. Herlihy and N. Shavit. On the space complexity of randomized synchronization. JACM 45(5), pp. 843-862, 1998.
26. E. Gafni. A simple algorithmic characterization of uniform solvability. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 228-237, 2002.
27. M. Herlihy and N. Shavit. The topological structure of asynchronous computability. JACM 46(6), pp. 858-923, 1999.
28. 2) steps. Proceedings of the 15th International Conference on Distributed Computing, pp. 123-135, 2001.
29. A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Information and Computation, 88(1): pp. 60-87, 1990.
30. Y.-J. Joung. Asynchronous group mutual exclusion (extended abstract). In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp.51-60, 1998.
31. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1): pp. 1-11, 1987.
32. M. Merritt and G. Taubenfeld. Speeding Lamport's fast mutual exclusion algorithm. Information Processing Letters, 45: pp. 137-142, 1993.
33. M. Moir and J. H. Anderson. Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming, 25(1): pp. 1-39, 1995.
34. G.L. Poterson. Time efficient adaptive mutual exclusion algorithms. Unpublished manuscript, 2001.