Results

**1 - 4**of**4**### A Hybrid Algorithm to Solve Group Mutual Exclusion Problem in Message passing Distributed Systems

"... In the present paper, we propose a hierarchical algorithm to solve the group mutual exclusion (GME) problem in clusterbased systems. We consider a two-level hierarchy in which the nodes are divided in to clusters and a node in each cluster is designated as coordinator which is essentially the cluste ..."

Abstract
- Add to MetaCart

(Show Context)
In the present paper, we propose a hierarchical algorithm to solve the group mutual exclusion (GME) problem in clusterbased systems. We consider a two-level hierarchy in which the nodes are divided in to clusters and a node in each cluster is designated as coordinator which is essentially the cluster head. The number of global messages per critical section entry in our algorithm depends upon the number of clusters in the system unlike most of the existing GME algorithms where it depends upon the total number of nodes in the system. Performance of the algorithm directly depends on the coherent behavior of nodes inside clusters. The results have been substantiated with extensive simulation. A fault tolerant extension of the algorithm has also been proposed in the present exposition.

### An Improved Quorum-Based Algorithm for Extended GME Problem in Distributed Systems

"... The extended GME (group mutual exclusion) problem is a natural extension of the GME problem. In extended GME problem, processes are allowed to request more than one resource at a time, in order that the processes that can proceed by having access to any one of the requested resource can be allowed t ..."

Abstract
- Add to MetaCart

(Show Context)
The extended GME (group mutual exclusion) problem is a natural extension of the GME problem. In extended GME problem, processes are allowed to request more than one resource at a time, in order that the processes that can proceed by having access to any one of the requested resource can be allowed to do so. Manabe-Park suggested a quorum based solution for the extended GME problem. However, the worst case message complexity of the Manabe-Park algorithm is 9q, where q is the quorum size. Further, the synchronization delay of Manabe-Park algorithm is 4T, where T is the maximum message propagation delay. In the present paper, we propose a quorum based solution for the extended GME problem. The worst case message complexity of our algorithm is 7q and synchronization delay is 3T. Moreover, in the best case, the synchronization delay and message complexity come down to 2T and 3q respectively.

### A QoS Aware Self Adaptive General Scheme to Solve GME Problem

"... The Group mutual exclusion problem (GME) is a resource allocation problem which allows concurrency along with mutual exclusion. The concept of GME can be applied to various fields having varying quality of service (QoS) requirements. The present paper presents a self adaptive general scheme to solve ..."

Abstract
- Add to MetaCart

The Group mutual exclusion problem (GME) is a resource allocation problem which allows concurrency along with mutual exclusion. The concept of GME can be applied to various fields having varying quality of service (QoS) requirements. The present paper presents a self adaptive general scheme to solve GME problem using token-based approach. The striking feature of the scheme is that it considers QoS requirements, checks the QoS requirements time to time and adapts its parameters if there are deviations from the expected behavior. The dynamic analysis of the scheme has also been presented in the present exposition.

### A Leader based k-Local Mutual Exclusion Algorithm using Token for MANETs

"... The k-local mutual exclusion is a generalization of local mutual exclusion problem introduced by Attiya et al.. In k-local mutual exclusion, it is assumed that the k identical copies of a resource are shared among the geographically close nodes. The paper proposes a solution to the k-local mutual ex ..."

Abstract
- Add to MetaCart

(Show Context)
The k-local mutual exclusion is a generalization of local mutual exclusion problem introduced by Attiya et al.. In k-local mutual exclusion, it is assumed that the k identical copies of a resource are shared among the geographically close nodes. The paper proposes a solution to the k-local mutual exclusion problem in MANETs. The algorithm uses a leader-based approach and the leader is equipped with a token. It is suited to handle mobility that triggers the dynamism in topology of ad hoc networks. The algorithm satisfies safety, starvation freedom and l-deadlock avoidance properties. The best case message complexity of our algorithm is O(1) whereas the worst case message complexity is O(N). To the best of our knowledge, it is the first algorithm to solve k-local mutual exclusion problem in MANETs. The solution to token loss problem is also included in the present exposition.