Advertisement

Can Memory Be Used Adaptively by Uniform Algorithms?

  • Burkhard Englert
  • Darin Goldstein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3974)

Abstract

We introduce a novel term, memory-adaptive, that intuitively captures what it means for a distributed protocol to most efficiently make use of its shared memory. We also prove three results that relate to our memory-adaptive model. In our store/release protocols processors are required to store a value in shared MWMR memory so that it cannot be overwritten until it has been released by the processor. We show that there do not exist uniformly wait-free store/release protocols using only the basic operations read and write that are memory-adaptive to point contention. We further show that there exists a uniformly wait-free store/release protocol using only the basic operations read and write that is memory-adaptive to total contention. We finally show that there exists a uniformly wait-free store/release protocol using only the basic operations read, write, and write-plus that is memory-adaptive to interval contention and time-adaptive to total contention.

Keywords

Shared Memory Basic Operation Mutual Exclusion Shared Register Step Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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 (May 1999)Google Scholar
  2. 2.
    Afek, Y., Boxer, P., Touitou, D.: Bounds on the shared memory requirements for long-lived and adaptive objects. In: Proc. of the 19th Ann. ACM Symp. on Principles of Distributed Computing (PODC 2000), pp. 81–89 (July 2000)Google Scholar
  3. 3.
    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 (May 1995)Google Scholar
  4. 4.
    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 (October 1999)Google Scholar
  5. 5.
    Afek, Y., Merritt, M.: Fast, wait-free (2k − 1)-renaming. In: Proc. of the 18th Ann. ACM Symp. on Principles of Distributed Computing, pp. 105–112 (May 1999)Google Scholar
  6. 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 (August 1997)Google Scholar
  7. 7.
    Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proc. of the 40th Ann. Symp. on Foundations of Computer Science, pp. 262–272 (October 1999)Google Scholar
  8. 8.
    Afek, Y., Stupp, G., Touitou, D.: Long Lived Adaptive Splitter and Applications. Distributed Computing 15(2), 67–86 (2002)CrossRefMATHGoogle Scholar
  9. 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. 10.
    Aguilera, M., Englert, B., Gafni, E.: Uniform Solvability with a finite number of MWMR registers. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 16–29. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 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)CrossRefGoogle Scholar
  12. 12.
    Anderson, J., Yang, J.-H.: Time/contention trade-offs for multiprocessor synchronization. Information and Computation 124(1), 68–84 (1996)MathSciNetCrossRefMATHGoogle Scholar
  13. 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 (May 2002)Google Scholar
  14. 14.
    Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 91–100 (2000)Google Scholar
  15. 15.
    Attiya, H., Dagan, E.: Universal operations: Unary versus binary. In: Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, pp. 223–232 (May 1996)Google Scholar
  16. 16.
    Attiya, H., Fich, F., Kaplan, Y.: Lower bounds for adaptive collect and related objects. In: Proc. 23 Annual ACM Symp. on Principles of Distributed Computing, pp. 60–70 (July 2004)Google Scholar
  17. 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 (June 1998)Google Scholar
  18. 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. 19.
    Attiya, H., Fouren, A.: Algorithms adaptive to point contention. J. ACM 50(4), 444–468 (2003)CrossRefMATHGoogle Scholar
  20. 20.
    Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87–96 (2002)CrossRefGoogle Scholar
  21. 21.
    Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R.: Efficient Adaptive Collect using Randomization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 159–173. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  22. 22.
    Attiya, H., Zach, I.: Fully adaptive algorithms for atomic and immediate snapshots (2003), www.cs.technion.ac.il/hagit/pubs/AZ03.pdf
  23. 23.
    Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Information and Computation 107(2), 171–184 (1993)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Choy, M., Singh, A.K.: Adaptive solutions to the mutual exclusion problem. Distributed Computing 8(1), 1–17 (1994)CrossRefGoogle Scholar
  25. 25.
    Inoue, M., Umetani, S., Masuzawa, T., Fujiwara, H.: Adaptive long-lived O(k 2) renaming with O(k 2) steps. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 123–135. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  26. 26.
    Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1–11 (1987)CrossRefGoogle Scholar
  27. 27.
    Merritt, M., Taubenfeld, G.: Speeding Lamport’s fast mutual exclusion algorithm. Information Processing Letters 45, 137–142 (1993)CrossRefMATHGoogle Scholar
  28. 28.
    Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming 25(1), 1–39 (1995)MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    Peterson, G.L.: Time efficient adaptive mutual exclusion algorithms (unpublished manuscript, 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Burkhard Englert
    • 1
  • Darin Goldstein
    • 1
  1. 1.Dept. of Comp. Engr. & Comp. ScienceCalifornia State University Long BeachLong BeachUSA

Personalised recommendations