k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual exclusion algorithm adopting k-coteries could provide the fault-tolerant capability. The comple-mentalness and the availability are two important metrics to measure the fault-tolerant capability of a k-coterie. Since those two metrics are defined under two different failure assumptions, for a given k-coterie, two independent works to measure those two metrics are necessary. In this paper, we derive the characteristics of the complemental k-coterie on its availability. With the characteristic, verifying the complementalness of a k-coterie and evaluating its availability could be combined together to reduce the redundant works on measuring the fa...
[[abstract]]In the distributed system, network resources shared by many nodes results in the mutual ...
[[abstract]]Quorum-based mutual exclusion algorithms are resilient to node and communication line fa...
A coterie is a set of subsets (called quorums) of the processes in a distributed system such that an...
Network partition, which makes it impossible for some pairs of precesses to communicate with each ot...
[[abstract]]Coterie is a widely accepted concept for solving the mutual exclusion problem. Nondomina...
AbstractÐWe model a distributed system by a graph q Y i, where represents the set of processes and i...
One of the solution in solving k mutual exclusion problem is the concept of kcoterie. A k-coterie un...
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In o...
International audienceWe present in this paper a fault tolerant permission-based k-mutual exclusion ...
The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, ...
We model a distributed system by a graph G=(V, E), where V represents the set of processes and E the...
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per ...
This paper proposes a fault tolerant permission-based k-mutual exclusion algorithm which does not re...
[[abstract]]In this paper, we propose a simple scheme to construct k-coteries for the distributed k-...
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entri...
[[abstract]]In the distributed system, network resources shared by many nodes results in the mutual ...
[[abstract]]Quorum-based mutual exclusion algorithms are resilient to node and communication line fa...
A coterie is a set of subsets (called quorums) of the processes in a distributed system such that an...
Network partition, which makes it impossible for some pairs of precesses to communicate with each ot...
[[abstract]]Coterie is a widely accepted concept for solving the mutual exclusion problem. Nondomina...
AbstractÐWe model a distributed system by a graph q Y i, where represents the set of processes and i...
One of the solution in solving k mutual exclusion problem is the concept of kcoterie. A k-coterie un...
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In o...
International audienceWe present in this paper a fault tolerant permission-based k-mutual exclusion ...
The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, ...
We model a distributed system by a graph G=(V, E), where V represents the set of processes and E the...
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per ...
This paper proposes a fault tolerant permission-based k-mutual exclusion algorithm which does not re...
[[abstract]]In this paper, we propose a simple scheme to construct k-coteries for the distributed k-...
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entri...
[[abstract]]In the distributed system, network resources shared by many nodes results in the mutual ...
[[abstract]]Quorum-based mutual exclusion algorithms are resilient to node and communication line fa...
A coterie is a set of subsets (called quorums) of the processes in a distributed system such that an...