Skip to main content
SpringerLink
Log in

Uniform Solvability with a Finite Number of MWMR Registers

(Extended Abstract)

  • Conference paper
Distributed Computing (DISC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2848))

Included in the following conference series:

Abstract

This paper introduces a new interesting research question concerning tasks. The weak-test-and-set task has a uniform solution that requires only two Multi-Writer Multi-Reader (MWMR) registers. Recently it was shown that if we take the long-lived version and require a step complexity that is adaptive to interval contention then, like mutual exclusion, no solution with finitely many MWMR registers is possible. Here we show that there are simple tasks which provably cannot be solved uniformly with finitely many MWMR registers. This opens up the research question of when a task is uniformly solvable using only finitely many MWMR registers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Boxer, P., Touitou, D.: 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)

    Google Scholar 

  2. Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-Lived Renaming made adaptive. In: Proc. of 18th Annual ACM Symp. on Principles of Distributed Computing, pp. 91–103 (1999)

    Google Scholar 

  3. Afek, Y., Attiya, H., Stupp, G., Touitou, D.: Adaptive long-lived renaming using bounded memory. In: Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pp. 262–272 (1999)

    Google Scholar 

  4. Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proc. of the 27th Ann. ACM Symp. on Theory of Computing, pp. 538–547 (1995)

    Google Scholar 

  5. Afek, Y., Merritt, M.: Fast, wait-free (2fc – 1)-renaming. In: Proc. of the 18th Ann. ACM Symp. on Principles of Distributed Computing, pp. 105–112 (1999)

    Google Scholar 

  6. Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object operations. In: Proc. of 16th Annual ACM Symp. on Principles of Distributed Computing, pp. 111–120 (1997)

    Google Scholar 

  7. Afek, Y., Stupp, G., Touitou, D.: Long lived adaptive collect with applications. In: Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pp. 262–272 (1999)

    Google Scholar 

  8. Afek, Y., Stupp, G., Touitou, D.: Long lived adaptive splitter and applications (1999) (unpublished manuscript )

    Google Scholar 

  9. Afek, Y., Stupp, G., Touitou, D.: Long lived and adaptive atomic snapshot and immediate snapshot. In: Proc. of the 19th Ann. ACM Symp. on Principles of Distributed Computing, pp. 71–80 (2000)

    Google Scholar 

  10. Aguilera, M.K., Englert, B., Gafni, E.: On using network attached disks as shared memory. In: Proc.of the 22nd Ann. ACM Symp. on Principles of Distributed Computing (2003) (to appear)

    Google Scholar 

  11. Anderson, J., Kim, Y.-J.: Adaptive mutual exclusion with local spinning. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 29–43. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Angluin, D.: Local and global properties in networks of processors. In: Proceedings ofthe 12th ACM Symposium on Theory ofComputing, pp. 82–93 (1980)

    Google Scholar 

  13. Aspnes, J., Shah, G., Shah, J.: Wait free consensus with infinite arrivals. In: Proc. of the 34th Annual ACM Symposium on the Theory of Computing, pp. 524–533 (2002)

    Google Scholar 

  14. Aspnes, J., Waarts, O.: Modular competitiveness for distributed algorithms. In: Proc. 28th ACM Symp. Theory of Comp., pp. 237–246 (1996)

    Google Scholar 

  15. Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 91–100 (2000)

    Google Scholar 

  16. Attiya, H., Dagan, E.: Universal operations: Unary versus binary. In: Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, pp. 223–232 (1996)

    Google Scholar 

  17. Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming. In: Proc. 17th Annual ACM Symp. on Principles of Distributed Computing, pp. 277–286 (1998)

    Google Scholar 

  18. Attiya, H., Fouren, A.: 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. Attiya, H., Fouren, A.: Algorithms adaptive to point contention. JACM (2001) (submitted for publication)

    Google Scholar 

  20. Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87–96 (2002)

    Article  Google Scholar 

  21. Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Information and Computation 107(2), 171–184 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  22. Choy, M., Singh, A.K.: Adaptive solutions to the mutual exclusion problem. Distributed Computing 8(1), 1–17 (1994)

    Article  Google Scholar 

  23. Fatourou, P., Fich, F., Ruppert, E.: Space-optimal multi-writer snapshot objects are slow. In: Proc. 21st Annual ACM Symp. on Principles of Distributed Computing, pp. 13–20 (2002)

    Google Scholar 

  24. Fatourou, P., Fich, F., Ruppert, E.: A tight lower bound for space-optimal implementations of multi-writer snapshots. In: Proc. 35th Annual ACM Symp. on Theory of Computing, pp. 259–268 (2003)

    Google Scholar 

  25. Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. JACM 45(5), 843–862 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  26. Gafni, E.: A simple algorithmic characterization of uniform solvability. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 228–237 (2002)

    Google Scholar 

  27. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. JACM 46(6), 858–923 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  28. Inoue, M., Umetani, S., Masuzawa, T., Fujiwara, H.: Adaptive long-lived O(k 2 ) renaming with O(k2) steps. In: Proceedings of the 15th International Conference on Distributed Computing, pp. 123–135 (2001)

    Google Scholar 

  29. Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Information and Computation 88(1), 60–87 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  30. Joung, Y.-J.: Asynchronous group mutual exclusion (extended abstract). In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 51–60 (1998)

    Google Scholar 

  31. Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1–11 (1987)

    Article  Google Scholar 

  32. Merritt, M., Taubenfeld, G.: Speeding Lamport’s fast mutual exclusion algorithm. Information Processing Letters 45, 137–142 (1993)

    Article  MATH  Google Scholar 

  33. Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming 25(1), 1–39 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  34. Peterson, G.L.: Time efficient adaptive mutual exclusion algorithms (2001) (unpublished manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HP Labs Systems Research Center, 1501 Page Mill Road, Mail Stop 1250, Palo Alto, CA, 94304, USA

    Marcos K. Aguilera

  2. Dept. of Mathematics, University of California Los Angeles, Los Angeles, CA, 90095-1555, USA

    Burkhard Englert

  3. Dept. of Computer Science, University of California Los Angeles, Los Angeles, CA, 90095-1596, USA

    Eli Gafni

Authors
  1. Marcos K. Aguilera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Burkhard Englert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eli Gafni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Toronto,  

    Faith Ellen Fich

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aguilera, M.K., Englert, B., Gafni, E. (2003). Uniform Solvability with a Finite Number of MWMR Registers. In: Fich, F.E. (eds) Distributed Computing. DISC 2003. Lecture Notes in Computer Science, vol 2848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39989-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39989-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20184-7

  • Online ISBN: 978-3-540-39989-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation