[[abstract]]Coterie is a widely accepted concept for solving the mutual exclusion problem. Nondominated coteries are an important class of coteries which have better performance than dominated coteries. The performance of a coterie is usually measured by availability. Higher availability of a coterie exhibits greater ability to tolerate node or communication link failures. In this paper, we demonstrate a way to recognize nondominated coteries using availability. By evaluating the availability of a coterie instead of using a formal proof, the coterie can be recognized as a nondominated coterie or not. Moreover,with regard to wr-coterie, a concept for solving the replica control problem, we also present a similar result for recognizing nondom...
Let C and D be two distinct coteries under the vertex set V of a graph G = (V, E) that models a dist...
[[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...
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In o...
We model a distributed system by a graph G=(V, E), where V represents the set of processes and E the...
AbstractÐWe model a distributed system by a graph q Y i, where represents the set of processes and i...
k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual ex...
[[abstract]]The resource allocation problem is a fundamental problem in distributed systems. In this...
One of the solution in solving k mutual exclusion problem is the concept of kcoterie. A k-coterie un...
The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, ...
A coterie is a set of subsets (called quorums) of the processes in a distributed system such that an...
In this paper, we explore new failure models for multi-site systems, which are systems characterized...
We consider coteries (i.e. intersecting, Sperner systems) on arbitrary networks with given node reli...
[[abstract]]Quorum-based mutual exclusion algorithms are resilient to node and communication line fa...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
Let C and D be two distinct coteries under the vertex set V of a graph G = (V, E) that models a dist...
[[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...
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In o...
We model a distributed system by a graph G=(V, E), where V represents the set of processes and E the...
AbstractÐWe model a distributed system by a graph q Y i, where represents the set of processes and i...
k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual ex...
[[abstract]]The resource allocation problem is a fundamental problem in distributed systems. In this...
One of the solution in solving k mutual exclusion problem is the concept of kcoterie. A k-coterie un...
The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, ...
A coterie is a set of subsets (called quorums) of the processes in a distributed system such that an...
In this paper, we explore new failure models for multi-site systems, which are systems characterized...
We consider coteries (i.e. intersecting, Sperner systems) on arbitrary networks with given node reli...
[[abstract]]Quorum-based mutual exclusion algorithms are resilient to node and communication line fa...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
Let C and D be two distinct coteries under the vertex set V of a graph G = (V, E) that models a dist...
[[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...