Advertisement

Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform

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

Abstract

Distributed protocols that run in dynamic environments such as the Internet are often not able to use an upper bound on the number of potentially participating processes. In these settings adaptive and uniform algorithms are desirable where the step complexity of all operations is a function of the number of concurrently participating processes (adaptive) and the algorithm does not need to know an upper bound on the number of participating processes (uniform). Adaptive algorithms, however, are generally not adaptive with respect to their memory consumption – if no upper bound on the number of participating processes is known in advance – they require unbounded MWMR registers and an unbounded number of such registers (even if only finitely many distinct processes appear), making them impractical for real systems. In this paper we ask whether this must be the case: Can adaptive algorithms where no upper bound on the number of participating processes is known in advance be uniformly implemented with finite memory (if only finitely many distinct processes keep reappearing)? We will show that in the dynamic setting it is impossible to implement long-lived adaptive splitters, collect and renaming with infinitely many bounded MWMR registers, making such adaptive algorithms impractical in dynamic settings. On the positive side we provide algorithms that implement a long-lived uniform adaptive splitter if unbounded registers are available and that implement a non-uniform adaptive splitter with finitely many bounded registers if an upper bound on the number of participating processes is known in advance.

Keywords

Shared Memory Adaptive Algorithm Busy Period Mutual Exclusion Distinct Process 
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 ACM Symp. on Principles of Distributed Computing (PODC), pp. 91–103 (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 ACM Symp. on Principles of Distributed Computing (PODC), pp. 81–89 (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 (1995)Google Scholar
  4. 4.
    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 (1999)Google Scholar
  5. 5.
    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
  6. 6.
    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
  7. 7.
    Afek, Y., Stupp, G., Touitou, D.: Long Lived Adaptive Splitter and Applications. Distributed Computing 15(2), 67–86 (2002)CrossRefGoogle Scholar
  8. 8.
    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–30. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Anderson, J., Yang, J.-H.: Time/contention trade-offs for multiprocessor synchronization. Information and Computation 124(1), 68–84 (1996)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Attiya, H., Dagan, E.: Universal operations: Unary versus binary. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, pp. 223–232 (1996)Google Scholar
  11. 11.
    Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming. In: Proc. 17th ACM Symp. on Principles of Distr. Comp., pp. 277–286 (1998)Google Scholar
  12. 12.
    Attiya, H., Fouren, A.: Algorithms adaptive to point contention. J. ACM 50(4), 444–468 (2003)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87–96 (2002)CrossRefGoogle Scholar
  14. 14.
    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
  15. 15.
    Attiya, H., Zach, I.: Fully adaptive algorithms for atomic and immediate snapshots (2003), www.cs.technion.ac.il/hagit/pubs/AZ03.pdf
  16. 16.
    Englert, B., Gafni, E.: Fast Collect in the Absence of Contention. In: Proc. 22nd IEEE Intern. Conference on Distr. Comp. Systems (ICDCS), pp. 537–543 (2002)Google Scholar
  17. 17.
    Englert, B., Goldstein, D.: Can Memory be used adaptively by Uniform Algorithms? In: Proc. 9th Intern. Conf. on Principles of Distr. Systems (OPODIS) (2005)Google Scholar
  18. 18.
    Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1–11 (1987)CrossRefGoogle Scholar
  19. 19.
    Merritt, M., Taubenfeld, G.: Speeding Lamport’s fast mutual exclusion algorithm. Information Processing Letters 45, 137–142 (1993)MATHCrossRefGoogle Scholar
  20. 20.
    Moir, M., Anderson, J.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1–39 (1995)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

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

Personalised recommendations