Abstract
Abortable mutual exclusion is a variant of mutual exclusion, where processes are allowed to abort their invocations while waiting to enter the critical section. In this paper, we present an FCFS abortable mutual exclusion algorithm with bounded time and space, in which each invocation performs O(k 2) RMAs if at most k processes abort. We define an object type, S-HAD, from which it is easy to construct local-spin abortable mutual exclusion algorithms. Our main contribution is a wait-free implementation of an S-HAD object. We also develop a new, wait-free memory reclamation method, which generalizes reference counting, to achieve bounded space. The resulting algorithm uses O(N 2) shared variables, each with O(logN) bits, where N is the number of processes.
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
Anderson, J.H., Kim, Y.-J., Herman, T.: Shared-Memory Mutual Exclusion: Major Research Trends Since 1986. Distributed Computing (2002)
Attiya, H., Hendler, D., Woelfel, P.: Tight RMR Lower Bounds for Mutual Exclusion and Other Problems. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 217–226 (2008)
Danek, R., Lee, H.: Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 512–513. Springer, Heidelberg (2008)
Detlefs, D.L., Martin, P.A., Moir, M., Steele Jr., G.L.: Lock-Free Reference Counting. In: The 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 190–199 (2001)
Dijkstra, E.W.: Solution of a Problem in Concurrent Programming Control. Communications of the ACM 8(9), 569 (1965)
Goldberg, B.: Generational Reference Counting: A Reduced-communication Distributed Storage Reclamation Scheme. In: Proceedings of the ACM SIGPLAN 1989 Conference on Programming Language Design and Implementation (1989)
Herlihy, M., Luchangco, V., Martin, P., Moir, M.: Brief Announcement: Dynamic-sized lock-free data structures. In: Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (2002)
Herlihy, M., Luchangco, V., Moir, M.: Space and Time Adaptive Non-blocking Algorithms. Electronic Notes in Theoretical Computer Science 78, 260–280 (2003)
Jayanti, P.: Adaptive and Efficient Abortable Mutual Exclusion. In: Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing (July 2003)
Lamport, L.: A New Solution of Dijkstra’s Concurrent Programming Problem. Communications of the ACM 17(8), 453–455 (1974)
Michael, M.M.: Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Transactions on Parallel and Distributed Systems 15(6) (2004)
Scott, M.L.: Non-blocking Timeout in Scalable Queue-based Spin Locks. In: The 21st Annual Symposium on Principles of Distributed Computing (July 2002)
Scott, M.L., Scherer III, W.N.: Scalable Queue-based Spin Locks with Timeout. In: The 8th ACM Symposium on Principles and Practice of Parallel Programming (June 2001)
Valois, J.D.: Lock-Free Linked Lists Using Compare-and-Swap. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pp. 214–222 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, H. (2010). Fast Local-Spin Abortable Mutual Exclusion with Bounded Space. In: Lu, C., Masuzawa, T., Mosbah, M. (eds) Principles of Distributed Systems. OPODIS 2010. Lecture Notes in Computer Science, vol 6490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17653-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-17653-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17652-4
Online ISBN: 978-3-642-17653-1
eBook Packages: Computer ScienceComputer Science (R0)