Abstract
We present in this article a theoretical study and performance results about the impact of the Grid architecture on token-based mutual exclusion algorithms. To this end, both the original token-based Naimi-Tréhel’s algorithm and a hierarchical approach, suitable to cope with the intrinsic heterogeneity of communication latencies of Grid environments, are studied and evaluated.
Chapter PDF
Similar content being viewed by others
References
Bertier, M., Arantes, L., Sens, P.: Distributed mutual exclusion algorithms for grid applications: A hierarchical approach. JPDC 66, 128–144 (2006)
Chang, I., Singhal, M., Liu, M.: A hybrid approach to mutual exclusion for distributed system. In: IEEE Int. Computer Software and Applications Conf., pp. 289–294 (1990)
Erciyes, K.: Distributed mutual exclusion algorithms on a ring of clusters. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 518–527. Springer, Heidelberg (2004)
Housni, A., Tréhel, M.: Distributed mutual exclusion by groups based on token and permission. In: Int. Conf. on Computational Science and Its Applications, pp. 26–29 (June 2001)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. C. ACM 21(7), 558–564 (1978)
Maekawa, M.: A \(\sqrt{N}\) algorithm for mutual exclusion in decentralized systems. ACM-Transactions on Computer Systems 3(2), 145–159 (1985)
Mueller, F.: Prioritized token-based mutual exclusion for distributed systems. In: Int. Parallel Processing Symp., pp. 791–795 (March 1998)
Naimi, M., Trehel, M., Arnold, A.: A log (N) distributed mutual exclusion algorithm based on path reversal. JPDC 34(1), 1–13 (1996)
Omara, F., Nabil, M.: A new hybrid algorithm for the mutual exclusion problem in the distributed systems. Int. Journal of Intelligent Computing and Information Sciences 2(2), 94–105 (2002)
Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems 7(1), 61–77 (1989)
Ricart, G., Agrawala, A.: An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM 24 (1981)
Rizzo, L.: Dummynet: a simple approach to the evaluation of network protocols. ACM Computer Communication Review 27(1), 31–41 (1997)
Singhal, M.: A dynamic information structure for mutual exclusion algorithm for distributed systems. Trans. on Parallel and Distributed Systems 3(1), 121–125 (1992)
Sopena, J., Legond-Aubry, F., Arantes, L., Sens, P.: A composition approach to mutual exclusion algorithms for grid applications. In: Int. Conf. on Parallel Processing, pp. 65–75 (2007)
Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems 3(4), 344–349 (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sopena, J., Arantes, L., Legond-Aubry, F., Sens, P. (2008). The Impact of Clustering on Token-Based Mutual Exclusion Algorithms. In: Luque, E., Margalef, T., Benítez, D. (eds) Euro-Par 2008 – Parallel Processing. Euro-Par 2008. Lecture Notes in Computer Science, vol 5168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85451-7_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-85451-7_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85450-0
Online ISBN: 978-3-540-85451-7
eBook Packages: Computer ScienceComputer Science (R0)