Mutual exclusion is a well-known problem that arises when multiple processes compete, in
an uncoordinated way, for the acquisition of shared resources over a distributed system. In …

A k-coterie is a family of sets (called quorums) in which any (k+ 1) quorums contain at least a
pair of quorums intersecting each other. K-coteries can be used to develop distributed k …

h-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where
there are k units of shared resources and each process requests h (1⩽ h⩽ k) units at the …

The selection of a 'good'mutual exclusion algorithm, for the design of distributed systems, is
of great importance. A number of mutual exclusion algorithms, with different techniques and …

Generalized distributed mutual exclusion algorithms allow processes to concurrently access
a set of shared resources. However, they must ensure an exclusive access to each resource …

h-out of-k mutual exclusion is a generalization of 1-mutual exclusion problem, where there
are k limits of shared resources and each process requests h (1/spl les/h/spl les/k) units at …

Token-passing algorithms are a well-known way of solving dis-tributed mutual exclusion
problems in computer networks. A simple abstraction of the concept of tokens allows the use …

Hypercube have been commercially available in the past few years to their high degree of
connectivity, symmetry, and low degree of diameter. In this paper, we analyse the …

Token-passing algorithms are a common way of solving distributed mutual ezclusion
problems in computer networks. We list common properties of mutual exclusion problems …

In the domain of Operating System, critical problem and its related concepts play an
important role. Process Management is the most vital part for executing various programs …