Abstract
Group mutual exclusion is an interesting generalization of the mutual exclusion problem. This problem was introduced by Joung, and some algorithms for the problem have been proposed by incorporating mutual exclusion algorithms. Group mutual exclusion occurs naturally in a situation where a resource can be shared by processes of the same group, but not by processes of different groups. It is also called the congenial talking philosophers problem. In this paper we propose three algorithms based on ticket orders for the group mutual exclusion problem in the asynchronous shared memory model. The first algorithm is a simple modification of the Bakery algorithm. It satisfies group mutual exclusion, but does not satisfy lockout freedom. The second and the third algorithms are further modifications from the first one in order to satisfy lockout freedom and to improve the concurrency performance. They use single-writer shared variables, together with two multi-writer shared variables that are never concurrently written. The third algorithm has another desirable property, called smooth admission. By this property, during the period that the resource is occupied by the leader, a process wishing to join the same group as the leader’s group can be granted use of the resource in constant time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
U. Abraham, “Bakery algorithms”, Technical Report, Dept. of Mathematics, Ben Gurion University, Beer-Sheva, Israel, 2001.
J. H. Anderson, “Lamport on mutual exclusion: 27 years of planting seeds”, Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, pp.3–12, 2001.
H. Attiya and J. Welch, “Distributed Computing: Fundamentals, Simulations and Advanced Topics”, McGraw-Hill, New York, 1998.
E. W. Dijkstra, “Solution of a problem in concurrent programming control”, Communications of the ACM, vol.8, p.569, 1965.
M. J. Fischer, N. A. Lynch, J. E. Burns, and A. Borodi, “Resource allocation with immunity to limited process failure”, 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico: 234–254, 1979.
V. Hadzilacos, “A note on group mutual exclusion”, Proceedings of 12th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, pp.100–106, 2001.
P. Jayanti, K. Tan, G. Friedland, and A. Katz, “Bounded Lamport’s bakery algorithm”, Proceedings of SOFSEM’2001, Lecture Notes in Computer Science, vol.2234, Springer-Verlag, Berlin, pp.261–270, 2001.
Yuh-Jzer Joung, “Asynchronous group mutual exclusion”, Distributed Computing, vol.13, pp.189–206, 2000.
Yuh-Jzer Joung, “The congenial talking philosophers problem in computer networks”, Distributed Computing, vol.15, pp.155–175, 2002.
P. Keane and M. Moir, “A simple local-spin group mutual exclusion algorithm”, IEEE Transactions on Parallel and Distributed Systems, vol.12, 2001.
L. Lamport, “A new solution of Dijkstra’s concurrent programming problem”, Communications of the ACM, vol.17, pp.453–455, 1974.
L. Lamport, “The mutual exclusion problem. Part II: Statement and solutions”, J. of the ACM, vol. 33, pp.327–348, 1986.
N. A. Lynch, “Distributed Algorithms”, Morgan Kaufmann, San Francisco, California, 1996.
M. Omori, K. Obokata, K. Motegi and Y. Igarashi, “Analysis of some lockout avoidance algorithms for the κ-exclusion problem”, Interdisciplinary Information Sciences, vol.8, pp.187–192, 2002.
G. L. Peterson, “Myths about the mutual exclusion problem”, Information Processing Letters, vol.12, pp.115–116, 1981.
G. L. Peterson and M. J. Fischer, “Economical solutions for the critical section problem in a distributed system”, Proceedings of the 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado, pp.91–97, 1977.
M. Takamura and Y. Igarashi, “Simple mutual exclusion algorithms based on bounded tickets on the asynchronous shared memory model”, IEICE Transactions on Information and Systems, vol.E86-D, pp.246–254, 2003.
K. Vidyasankar, “A highly concurrent group mutual l-exclusion algorithm”, Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, Monterey, California, p.130, 2002.
K. Vidyasankar, “A simple group mutual l-exclusion algorithm”, Information Processing Letters, vol.85, pp.79–85, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takamura, M., Igarashi, Y. (2003). Group Mutual Exclusion Algorithms Based on Ticket Orders. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40534-4
Online ISBN: 978-3-540-45071-9
eBook Packages: Springer Book Archive