Revisiting hierarchical quorum systems

Preguiça, Nuno; Martins, J. Legatheaux

doi:10.1109/icdsc.2001.918956

Cited by 3 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of elements of each row increases from 1 to r. Each quorum is composed by a complete row i plus one element from each row such that j > i. Preguiça and Martins (2001) [21] proposed a hierarchical system for building quorums based on this triangle approach. Each quorum is formed by the division of the triangles into sub-triangles and the union of the quorums of each unit.…”

Section: Related Workmentioning

confidence: 99%

An Autonomic Majority Quorum System

Rodrigues

Arantes

Duarte

2016

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)

View full text Add to dashboard Cite

A quorum system is a collection of process sets (quorums) which intersect among themselves. Quorums are used by many distributed applications such as mutual exclusion, data replication, and for the dissemination of information. This work presents an autonomic solution to build a majority quorum system that is self-adaptive by dymically reconfiguring itself if processes fail. Processes can fail by crashing and crashes are permanent. The proposed solution is defined over a VCube -a virtual hypercube-like topology [1], and uses failure information from the VCube's monitoring system. Each quorum is built so that any quorum has a majority of the faulty-free processes of the system. Upon the detection of a failure, the quorum system reconfigures automatically, tolerating up to n − 1 crashed processes. Experimental results confirm the efficiency of the proposed algorithm compared with other solutions of the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

An Autonomic Majority Quorum System

Rodrigues

Arantes

Duarte

2016

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)

View full text Add to dashboard Cite

show abstract

“…If processes can construct a quorum on the fly whenever it is necessary, instead of maintaining the coterie, then it definitely contributes to the reduction of space complexity. Grid coteries are proposed to this end based on logical grid structures of processes [4], [10], [11], [12], [13], [16], [17]. Grid coteries discussed in [4], which we will call C-Grid coteries in this paper, virtually align the processes in a two-dimensional array.…”

Section: (Entering Critical Section) Upon Receivingmentioning

confidence: 99%

“…T-Grid coterie [17]: The processes in one full row and a process from each row below the full row form a quorum.…”

Section: (Entering Critical Section) Upon Receivingmentioning

confidence: 99%

Transversal merge operation: a nondominated coterie construction method for distributed mutual exclusion

Harada

Yamashita

2005

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

A coterie is a set of subsets (called quorums) of the processes in a distributed system such that any two quorums intersect with each other and is mainly used to solve the mutual exclusion problem in a quorum-based algorithm. The choice of a coterie sensitively affects the performance of the algorithm and it is known that nondominated (ND) coteries achieve good performance in terms of criteria such as availability and load. On the other hand, grid coteries have some other attractive features: 1) A quorum size is small, which implies a low message complexity, and 2) a quorum is constructible on the fly, which benefits a low space complexity. However, they are not ND coteries unfortunately. To construct ND coteries having the favorite features of grid coteries, we introduce the transversal merge operation that transforms a dominated coterie into an ND coterie and apply it to grid coteries. We call the constructed ND coteries ND grid coteries. These ND grid coteries have availability higher than the original ones, inheriting the above desirable features from them. To demonstrate this fact, we then investigate their quorum size, load, and availability, and propose a dynamic quorum construction algorithm for an ND grid coterie.

show abstract