Skip to main content
Springer Nature Link
Log in

On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention

Extended Abstract

  • Conference paper
Principles of Distributed Systems (OPODIS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4305))

Included in the following conference series:

  • 598 Accesses

Abstract

A distributed shared memory protocol is called memory-adaptive, if all writes to MWMR registers are ”close to the beginning of shared memory”, that is the indices of all MWMR registers processes write to when executing the protocol are functions of the contention. The notion of memory-adaptiveness captures what it means for a distributed protocol to most efficiently make use of its shared memory. We previously considered a store/release protocol where processes are required to store a value in shared MWMR memory so that it cannot be overwritten until it has been released by the process. We showed 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 showed that there exists a uniformly wait-free store/release protocol using only the basic operations read, write, and read-modify-write that is memory-adaptive to interval contention and time-adaptive to total contention. This left a significant gap which we close in this paper. We show that no uniform store/release protocol can exist that is memory adaptive to interval contention and only uses read/write (no read-modify-write) registers. We furthermore illustrate the validity and practicality of the concept of memory adaptiveness by providing a uniform, memory-adaptive to interval contention store/release protocol for Network Attached Disks.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine Disk Paxos: Optimal resilience with byzantine shared memory. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 226–235 (2004)

    Google Scholar 

  2. Acharya, A., Uysal, M., Saltz, J.: Active Disks: Programming model, algorithms and evaluation. In: Proc. of the 8th International Conference on ASPLOS-VIII, pp. 81–91 (1998)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  5. Afek, Y., Boxer, P., Touitou, D.: Bounds on the shared memory requirements for long-lived and adaptive objects. In: Proc. 19th ACM Symp. on PODC, pp. 81–89 (2000)

    Google Scholar 

  6. 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 

  7. Afek, Y., Merritt, M.: Fast, wait-free (2k − 1)-renaming. In: Proc. of the 18th ACM Symp. on PODC, pp. 105–112 (May 1999)

    Google Scholar 

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

    Google Scholar 

  9. 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 (1999)

    Google Scholar 

  10. Afek, Y., Stupp, G., Touitou, D.: Long Lived Adaptive Splitter and Applications. Distributed Computing 15(2), 67–86 (2002)

    Article  Google Scholar 

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

    Google Scholar 

  12. Aguilera, M., Englert, B., Gafni, E.: Uniform Solvability with a finite number of MWMR registers. In: Proc. 17th International Conference DISC, pp. 16–30 (2003)

    Google Scholar 

  13. Amiri, K., Gibson, G.A., Golding, R.: Highly Concurrent Shared Storage. In: Proceedings of ICDCS, pp. 298–307 (2000)

    Google Scholar 

  14. Anderson, T., Dahlin, M., Neefe, J., Patterson, D., Roselli, D., Wang, R.: Serverless Network File Systems. ACM Trans. on Comp. Systems 14(1), 41–79 (1996)

    Article  Google Scholar 

  15. Anderson, J., Yang, J.-H.: Time/contention trade-offs for multiprocessor synchronization. Information and Computation 124(1), 68–84 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Angluin, D.: Local and global properties in networks of processes. In: Proceedings of the 12th ACM Symposium on Theory of Computing (STOC 1980), pp. 82–93 (1980)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  19. Attiya, H., Fich, F., Kaplan, Y.: Lower bounds for adaptive collect and related objects. In: Proc. 23rd ACM Symp. on Principles of Distr. Comp., pp. 60–70 (2004)

    Google Scholar 

  20. Attiya, H., Fouren, A.: Algorithms adaptive to point contention. J. ACM 50(4), 444–468 (2003)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  22. 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)

    Chapter  Google Scholar 

  23. Burns, R.: Data Managment in a distributed file system for Storage Area Networks. PhD Thesis. Department of Computer Science, UC Santa Cruz (2000)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  25. Chockler, G., Malkhi, D.: Active Disk Paxos with infinitely many processes. In: Proc. of the 21st ACM Symp. on PODC, pp. 78–87 (2002)

    Google Scholar 

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

    Article  Google Scholar 

  27. Englert, B., Goldstein, D.: Can Memory be used adaptively by Uniform Algorithms? In: Proc. 9th International Conference on Principles of Distributed Systems (OPODIS), pp. 25–35 (2005)

    Google Scholar 

  28. Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing 16(2-3), 121–163 (2003)

    Article  Google Scholar 

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

    Google Scholar 

  30. Gafni, E., Lamport, L.: Disk Paxos. Distributed Computing 16(1), 1–20 (2003)

    Article  Google Scholar 

  31. Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy and algorithms for unbounded concurrency. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 161–169 (2001)

    Google Scholar 

  32. Gibson, G.A., Nagle, D.F., Amiri, K., Butler, J., Chang, F.W., Gobioff, H., Hardin, C., Riedel, E., Rochberg, D., Zelenka, J.: A cost-effective high-bandwidth storage architecture. In: ACM SIGOPS Operating Systems Review, pp. 92–103 (1998)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  36. Moir, M., Anderson, J.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1–39 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  37. National Storage Industry Consortium, http://www.nsic.org/nasd

  38. Riedel, E., Faloutsos, C., Gibson, G.A., Nagle, D.: Active Disks for large scale data processing. IEEE Computer (June 2001)

    Google Scholar 

  39. Thekkath, C., Mann, T., Frangipani, E.K.L.: A scalable distributed file system. In: Proceedings of the 16th ACM Symposium on Operating System Principles, New York, pp. 224–237 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Comp. Engr. & Comp. Science, California State University Long Beach, Long Beach, CA, 90840, USA

    Burkhard Englert

Authors
  1. Burkhard Englert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Artificial Intelligence Laboratory, MIT, USA

    Mariam Momenzadeh Alexander A. Shvartsman

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Englert, B. (2006). On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention. In: Shvartsman, M.M.A.A. (eds) Principles of Distributed Systems. OPODIS 2006. Lecture Notes in Computer Science, vol 4305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945529_6

Download citation

  • DOI: https://doi.org/10.1007/11945529_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49990-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics