Abstract
A simple and cheap algorithm is presented to allow prioritized mutual exclusion. There are several groups. All the members of a same group have the same level priority. Our algorithm is a token-based algorithm. Each group of participants (site) is represented by a tree structure. Inside a group, the requests are recorded in a global queue which circulates simultaneously and together with the token. The participant holding the token is the root of the tree linked to the router of the group. When a router transmits the token to another group, it preserves the role of the router in its group. The relation between routers is also represented by an rooted tree, the root is the router of the group holding the token. Besides a static logical structure similar to that used in Raymond’s algorithm, our algorithm manages a global requester queue. If the requesting site and the owner of the token are in the same group, there is a reorganization of the group tree. If they are not in the same group, the tree of the requesting site and the tree of routers are reorganized. Algorithm in one group and extension to some groups are presented.
Chapter PDF
Similar content being viewed by others
References
A. Goscinski. “Two algorithms for mutual exclusion in real-time distributed computer systems”, The Journal of Parallel and Distributed Computing, 9: pp.77–82, (1990).
K. Harathi and T. Johnson, “A priority synchronization algorithm for multiprocessors”, Technical Report tr93.005. Available at ftp://cis.ufl.edu:cis/tech-reports, (1993).
A. Housni, M. Tréhel, “Specification of the prioritized algorithm for N groups”, intern paper, Laboratore d’Informatique de l’université de Franche Comté, France, February (2001).
T. Johnson, R. E. Newman-Wolfe “A comparison of fast and low overhead distributed priority locks”, Journal of Parallel and Distributed Computing 32 (1): pp.74–89 (1996).
B. M. K. Qazzaz “A new prioritized mutual exclusion algorithm for distributed systems”, Doctoral Thesis, Dept of Comp. SCI., Southern Illinois University, Carbondale, (1994).
M. Maekawa, “A √N Algorithm for Mutual Exclusion in Decentralized Systems” ACM Transactions on Computer Systems, Vol3, pp. 145–159 (1985).
F. Mueller “Prioritized token-based mutual exclusion for distributed systems”, 12th IPPS/SPDP, Orlando, Florida USA, (1998).
K. Raymond, “A tree-based algorithm for distributed mutual exclusion” ACM Transactions on Computer Systems Volume 7, Issue 1, pp.61–77 (1989).
M. Tréhel, M. Naimi, “A distributed algorithm for mutual exclusion based on data structures and fault-tolerance”, 6th annual IEEE conference on computers and communications, Phoenix, Arizona, February (1987).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trehel, M., Housni, A. (2001). The Prioritized and Distributed Synchronization in Distributed Groups. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_38
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive