A new distributed algorithm for mutual exclusion has been proposed for creating mutual
exclusion in a computer network. The nodes communicate only by messages and do not …

Concurrency and starvation control had always been a problem in distributed system. In the
voting-based technique, a process receiving the greater part of votes will only be permitted …

In voting based approach a process getting the majority of votes will only be allowed to enter
into the critical section (CS). But, this method has a disadvantage as if no process remains in …

In this paper we present a new distributed group mutual exclusion (DGME) based on
clients/servers model, and uses a dynamic data structures. Several processes (clients) can …

Let/spl rho/be the percentage of zeros among the quantized transform coefficients. We
discover that, in any typical video coding system, there is always a strictly linear relationship …

In order to solve the concurrency and starvation control problems of distributed systems, the
voting-and priority-based optimal and feasible solution is presented in this research work. In …

L'exclusion mutuelle de groupe est une généralisation de l'exclusion mutuelle. Ce problème
a été présenté par Joung et quelques algorithmes pour le problème ont été proposés en …

In normal multiprogramming environment, several processes may compete for getting
resources. Here, if a process requests for a resource and if the resource is not available at a …

In normal multiprogramming environment, several processes may compete for a finite
number of resources. Here a process requests for a resource and if the resources are not …

Group mutual exclusion is an interesting generalization of the mutual exclusion problem.
This problem was introduced by Joung, and some algorithms for the problem have been …