Distributed mutual exclusion algorithms for grid applications: A hierarchical approach |
| |
| Affiliation: | 1. Department of Computer Science, Kebri Dehar University, Kebri Dehar, Ethiopia;2. Department of Electronics and Communication Engineering, Panimalar Engineering College, Poonamallee, Chennai 600123, India;3. Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia;4. Department of Computer Science, Faculty of Computer Science and Information Technology, Al-Baha University, Al-Baha, Saudi Arabia;5. Department of Computer Science, College of Computers and Information Systems, Umm Al-Qura University, Makkah, Saudi Arabia;1. Graduate School of Engineering, Tohoku University, 468-1 Aramaki Aza Aoba, Aoba-ku, Sendai 980-0845, Miyagi, Japan;2. International Research Institute of Disaster Science, Tohoku University, 468-1 Aramaki Aza Aoba, Aoba-ku, Sendai, 980-0845 Miyagi, Japan |
| |
| Abstract: | The majority of current distributed mutual exclusion algorithms are not suited for parallel or distributed applications on a Grid as they do not consider the heterogeneity of latency on Grids. We propose two distributed mutual exclusion algorithms, based on Naimi–Trehel's token-based algorithm, which take into account latency gaps, especially those between local and remote clusters of machines. Our first algorithm exploits cluster locality by giving higher priority to critical section requests issued from nodes of the same cluster when compared to those from remote nodes. Our second algorithm adds a router layer to the first algorithm, bringing it closer to Grid network topology. Viewing each cluster as a single node, the Naimi–Trehel algorithm is applied to this router layer. Redirection of inter-cluster messages to cluster's nodes is then minimized. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
