A two-layer hierarchical permission based mutual exclusion algorithm

Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster based algorithms are scalable by nature. Several of them are quorum based solutions. All of these solutions exploit the idea of coordinator/leader of cluster. Thus, fault tolerance of these algorithms is low. If any coordinator fails, election of new one is required. Here we propose a two-layer hierarchical cluster based solution where no coordinator is used. We simulate our proposed algorithm and show that it outperforms related ME algorithms.

[1]  Flaviu Cristian,et al.  The Timed Asynchronous Distributed System Model , 1999, IEEE Trans. Parallel Distributed Syst..

[2]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[3]  Takeshi Fuchi.  An improved √N algorithm for mutual exclusion in decentralized systems , 1993, Systems and Computers in Japan.

[4]  Ashok K. Agrawala,et al.  An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.

[5]  Scott D. Stoller.  Leader Election in Asynchronous Distributed Systems , 2000, IEEE Trans. Computers.

[6]  P. C. Saxena,et al.  A survey of permission-based distributed mutual exclusion algorithms , 2003, Comput. Stand. Interfaces.

[7]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[8]  Michel Tréhel,et al.  Distributed mutual exclusion token-permission based by prioritized groups , 2001, Proceedings ACS/IEEE International Conference on Computer Systems and Applications.

[9]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[10]  Richard D. Schlichting,et al.  Fail-stop processors: an approach to designing fault-tolerant computing systems , 1983, TOCS.

[11]  H ThomasRobert.  A Majority consensus approach to concurrency control for multiple copy databases , 1979 .

[12]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[13]  Mineo Takai,et al.  Parssec: A Parallel Simulation Environment for Complex Systems , 1998, Computer.

[14]  Kayhan Erciyes.  Distributed Mutual Exclusion Algorithms on a Ring of Clusters , 2004, ICCSA.

[15]  Mortuza Ali,et al.  A Two-Layer Hybrid Algorithm for Achieving Mutual Exclusion in Distributed Systems , 2004 .

[16]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[17]  Mohamed Naimi,et al.  A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal , 1996, J. Parallel Distributed Comput..

[18]  Shojiro Nishio,et al.  A Resilient Mutual Exclusion Algorithm for Computer Networks , 1990, IEEE Trans. Parallel Distributed Syst..

[19]  Mohammad Ashiqur Rahman,et al.  A Quorum Based Distributed Mutual Exclusion Algorithm for Multi-Level Clustered Network Architecture , 2007, WALCOM.

[20]  Jayadev Misra,et al.  Detecting termination of distributed computations using markers , 1983, PODC '83.

[21]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

[22]  Michel Raynal.  A simple taxonomy for distributed mutual exclusion algorithms , 1991, OPSR.

[23]  Pierre Sens,et al.  Distributed mutual exclusion algorithms for grid applications: A hierarchical approach , 2006, J. Parallel Distributed Comput..

[24]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.