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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM 41(5), 1020–1048 (1994)
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)
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)
Herlihy, M.P.: Wait-free synchronization. ACM Trans. Prog. Lang. & Syst. 13(1), 124–149 (1991)
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)
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
Lamport, L.: A fast mutual exclusion algorithm. ACM Trans. Comput. 5(1), 1–11 (1987)
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)
Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1–39 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoepman, JH. (2004). Splitters: Objects for Online Partitioning. In: Papatriantafilou, M., Hunel, P. (eds) Principles of Distributed Systems. OPODIS 2003. Lecture Notes in Computer Science, vol 3144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27860-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-27860-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22667-3
Online ISBN: 978-3-540-27860-3
eBook Packages: Springer Book Archive