A Token based Distributed Group Mutual Exclusion Algorithm with Quorums for MANET
Pratvina Talele1, Milind Penurkar2, Saranga Bhutada3, Harsha Talele4
1Ms. Pratvina Talele, IT Department, MIT College of Engineering, Pune University, Pune, India.
2Mr. Milind Penurkar, IT Department, MIT College of Engineering, Pune University, Pune, India.
3Mrs. Saranga Bhutada, IT Department, MIT College of Engineering, Pune University, Pune, India.
4Ms. Harsha Talele, IT Department, SSBT’s College of Engineering, North Maharashtra University, Jalgaon, India.
Manuscript received on March 11, 2013. | Revised Manuscript Received on March 12, 2013. | Manuscript published on March 25, 2013. | PP: 43-48 | Volume-1 Issue-5, March 2013. | Retrieval Number: E0218031513/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type (or a group) with each critical section. In this problem, processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusive manner. A distributed algorithm is used for the group mutual exclusion problem in asynchronous message passing distributed systems for MANET. This algorithm is based on tokens, and a process that obtains a token can enter a critical section. To reduce message complexity, it uses a coterie as a communication structure, when a process sends a request messages. Informally, a coterie is a set of quorums, each of which is a subset of the process set, and any two quorums share at least one process. Performance of the proposed algorithm is presented. In particular, the proposed algorithm can achieve high concurrency, whch is a performance measure for the number of processes that can be in a critical section simultaneously.
Keywords: Distributed systems, critical section, mutual exclusion.