The Quorum Deployment Problem

Gilbert, Seth; Malewicz, Grzegorz

doi:10.1007/11516798_23

Cited by 7 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That work also presented optimal algorithms under certain network topologies, such as a tree, cycle or cluster network. In [9,10], quorum deployment problem is defined to determine, given a tocol. It is not easy to determine an efficient deployment because of mapping real nodes to a grid.…”

Section: Quorum Deployment Problemmentioning

confidence: 99%

Cell approximation method in quorum systems for minimizing access time

2009

View full text Add to dashboard Cite

As part of a service oriented e-Science and Grid infrastructure, a quorum-consensus method is a valuable tool for managing replicated data and finding meaningful patterns of immense data sets. In general, a workflow is defined as set of atomic tasks that may have dependencies between each other. Tasks also may define a so-called "quorum" which denotes a number of precedence constraints to be fulfilled before execution may proceed. To solve the problem of designing a quorum that fits a scalable and dynamic environment where data are distributed sparsely or too far apart, we propose a cell approximation method to fit into some form (e.g., voting, grid) of logical structure in quorumbased protocols. In our method, adjacent nodes are configured by an Intra cell which can improve their data locality. Furthermore, Intra-cell relationships can be represented by an Inter cell for minimizing access time.

show abstract

Section: Quorum Deployment Problemmentioning

confidence: 99%

Cell approximation method in quorum systems for minimizing access time

2009

View full text Add to dashboard Cite

show abstract

“…Furthermore, there has been work on finding placements of a given quorum system Q on an arbitrary graph G = (V, E): there is work on (i) designing bijections f : U → V and q : V → Q that minimize Avg v∈V γ(v, f (q(v))) [10], or (ii) designing a placement f : U → V to (approximately) respect load constraints on nodes and minimize…”

Section: Related Workmentioning

confidence: 99%

“…For instance, some very recent work of the authors and others has proposed algorithms for finding placements that minimize the routing delays that clients incur when accessing quorums [8,10,11,14,29]. (We discuss this work in more detail in Section 2.)…”

Section: Introductionmentioning

confidence: 99%

Quorum placement in networks

Golovin

Gupta

Maggs

et al. 2006

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements of the universe reside on the nodes of a physical network and the participating nodes access the system by contacting every element in some quorum, potentially causing the added network congestion induced by these quorum accesses to play a limiting factor in the performance of the algorithm.In this paper we initiate the study of algorithms to place universe elements on the nodes of a physical network so as to minimize the network congestion that results from quorum accesses, while also ensuring that no physical node is overloaded by access requests from clients. We consider two models, one in which communication routes can be chosen arbitrarily and one in which they are fixed in advance. We show that in either model, the optimal congestion (with respect to the load constraints) cannot be approximated to any factor (unless P=NP). However, we show that at most doubling the load on nodes allows us to achieve a congestion that is close to this optimal value. We also shed some light on the extent to which element migration can reduce congestion in this context.

show abstract

“…Independently of our work, Gilbert and Malewicz [9] consider a problem they call the "partial quorum deployment problem". As in all the problems we study, their problem also takes as inputs a graph G = (V, E) and a quorum system Q over a universe U .…”

Section: Related Workmentioning

confidence: 99%

Quorum placement in networks to minimize access delays

Gupta

Maggs

Oprea

et al. 2005

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of nodes. Such algorithms are used for applications such as mutual exclusion, data replication, and dissemination of information. However, accessing spread-out quorums causes access delays that we would like to minimize. Furthermore, every member of the quorum incurs processing load to handle quorum accesses by clients.In this paper we study the problem of placing quorums in a physical network so as to minimize the delay that clients incur by accessing quorums, and while respecting each physical node's capacity (in terms of the load of client requests it can handle). We provide approximation algorithms for this problem for two natural measures of delay (the max-delay and total-delay). All our algorithms ensure that each node's load is within a constant factor of its capacity, and minimize delay to within a constant factor of the optimal delay for all capacity-respecting solutions. We also provide better approximations for several well-known quorum systems.

show abstract

The Quorum Deployment Problem

Cited by 7 publications

References 23 publications

Cell approximation method in quorum systems for minimizing access time

Cell approximation method in quorum systems for minimizing access time

Quorum placement in networks

Quorum placement in networks to minimize access delays

Contact Info

Product

Resources

About