Advertisement

Splitters: Objects for Online Partitioning

  • Jaap-Henk Hoepman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3144)

Abstract

A splitter is a concurrent asynchronous non-blocking object that can partition a collection of contending tokens into smaller groups with certain properties. Splitters are natural objects used to solve a wide range of fundamental distributed computing problems, like renaming and resource allocation. This paper proposes a general definition of splitters, develops their theory, and investigates their implementation in shared memory systems.

Keywords

splitters shared objects asynchronous communication divide & conquer 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AAF+99]
    Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Longlived renaming made adaptive. In: 18th PODC, Atlanta, GA, USA, pp. 91–103. ACM Press, New York (1999)Google Scholar
  2. [AGTV92]
    Afek, Y., Gafni, E., Tromp, J., Vitányi, P.M.B.: Wait-free test-and-set. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 85–94. Springer, Heidelberg (1992)Google Scholar
  3. [AM94]
    Anderson, J.H., Moir, M.: Using k-exclusion to implement resilient, scalable shared objects. In: 13th PODC, Los Angeles, CA, USA, pp. 141–150. ACM Press, New York (1994)Google Scholar
  4. [AHS94]
    Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM 41(5), 1020–1048 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  5. [AF00]
    Attiya, H., Fouren, A.: Polynomial and adaptive long-lived (2k−1)- renaming. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 149–163. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  6. [BGHM95]
    Buhrman, H., Garay, J.A., Hoepman, J.-H., Moir, M.: Longlived renaming made fast. In: 14th PODC, Ottawa, Ont., Canada, pp. 194–203. ACM Press, New York (1995)Google Scholar
  7. [Her91]
    Herlihy, M.P.: Wait-free synchronization. ACM Trans. Prog. Lang. & Syst. 13(1), 124–149 (1991)CrossRefGoogle Scholar
  8. [HS93]
    Herlihy, M.P., Shavit, N.: The asynchronous computability theorem for t-resilient tasks. In: 25th STOC, San Diego, CA, USA, pp. 111–120. ACM Press, New York (1993)Google Scholar
  9. [Hoe99]
    Hoepman, J.-H.: Long-lived test-and-set using bounded space. Tech. rep., University of Twente (1999), www.cs.kun.nl/~jhh/publications/test-andset.ps
  10. [Lam87]
    Lamport, L.: A fast mutual exclusion algorithm. ACM Trans. Comput. 5(1), 1–11 (1987)CrossRefGoogle Scholar
  11. [LAA87]
    Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. In: Preparata, F.P. (ed.) Advances in Computing Research, vol. 4, pp. 163–183. JAI Press, Greenwich (1987)Google Scholar
  12. [MA95]
    Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1–39 (1995)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jaap-Henk Hoepman
    • 1
  1. 1.Department of Computer ScienceUniversity of NijmegenNijmegenthe Netherlands

Personalised recommendations