D.Malkhi,M.K.Reiter,A.Wool,andR.N.Wright. Probabilistic quorum systems. Inform. and Comput., 170(2):184--206, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Novel Architectures for P2P Applications: the.. - Naor, Wieder (2002) (23 citations) (Correct)
....jobs from a heavily loaded processor to a less loaded neighbor. The e# ciency of the algorithm depends only on the expansion of the network. If the network is an expander then the algorithm balances the load in O(log n) rounds. Probabilistic quorums were suggested by Malkhi et al. in [17]. A quorum set is chosen by randomly sampling # n processors. A random walk on an expander could serve as a procedure for sampling # n processors in a dynamic setting. 6. EMULATING GENERAL GRAPHS In this section we show how our technique can be used to dynamically construct a graph which embeds ....
D. Malkhi, M. K. Reiter, and R. N. Wright. Probabilistic quorum systems. In Symposium on Principles of Distributed Computing (PODC), pages 267--273, 1997.
PAN: Providing Reliable Storage in Mobile Ad Hoc Networks.. - Luo, Hubaux, Eugster (2003) (1 citation) (Correct)
....Unfortunately, original quorum systems, also termed strict quorum systems, do not apply well to highly dynamic environments [3] This is because the very construction of these quorums is not a trivial task, as their outcome is strongly subject to membership changes. Probabilistic quorum systems [14], thanks to their less strict design rules, seem to be more appropriate for highly dynamic environments. By introducing probabilities for the intersection of individual quorums, the construction rules for these quorums are relaxed, and more freedom is left for trading protocol overhead for ....
....Our gossip based protocol, as demonstrated before, behaves in a predictable way, while requiring no separate membership tracking. As a consequence of gossip based access protocol, the design of quorum systems becomes more straightforward. According to the theory of probabilistic quorum systems [14], the # is designed to meet the requirement of a certain intersection property # in a replication system with n servers. However, as any unreliable access protocol is concerned, the di#erence between # and # does exist. Also, it is # that is essential to the estimation of reliability. Our ....
[Article contains additional citation context not shown here]
D. Malkhi, M.K. Reiter, and A. Wool, "Probabilistic quorum systems," Information and Computation, vol. 170, no. 2, pp. 184--206, 2001.
Novel Architectures for P2P Applications: the.. - Naor, Wieder (2003) (23 citations) (Correct)
....jobs from a heavily loaded processor to a less loaded neighbor. The e ciency of the algorithm depends only on the expansion of the network. If the network is an expander then the algorithm balances the load in O(log n) rounds. Probabilistic quorums were suggested by Malkhi et al. in [17]. A quorum set is chosen by randomly sampling n processors. A random walk on an expander could serve as a procedure for sampling n processors in a dynamic setting. 6. EMULATING GENERAL GRAPHS In this section we show how our technique can be used to dynamically construct a graph which embeds ....
D. Malkhi, M. K. Reiter, and R. N. Wright. Probabilistic quorum systems. In Symposium on Principles of Distributed Computing (PODC), pages 267-273, 1997.
Specification, Implementation and Application of Randomized.. - Lee, Welch (2000) (Correct)
....is lessened, since any values returned will satisfy the deterministic specification. Examples of this situation include [20, 19, 10] discussed below. Randomized implementations have been proposed for several shared data structures in various architectures, as we now discuss. Malkhi et al. [18, 17] have proposed a probabilistic quorum algorithm to implement a readwrite variable on top of a message passing system. Each read is translated into messages to a subset ( quorum ) of the processes to obtain the latest value, and each write is translated into messages to a quorum of the processes to ....
....obtain the latest value written. The smaller the quorums, the more message efficient the algorithm is, but the larger the probability that a read will observe an out of date value. Probabilistic quorums seem like a useful distributed building block, thanks to their good performance (analyzed in [18]) However, to make them usable by programmers, a more complete semantics of the register which they implement must be given, together with techniques for programming effectively with them. Shavit and Zemach have implemented novel synchronization mechanisms called combining funnels [20] and ....
[Article contains additional citation context not shown here]
D. Malkhi, M. Reiter, and R. Wright. Probabilistic Quorum Systems. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 267--273, Aug. 1997.
An Adaptive Quality Of Service Aware Middleware For Replicated .. - Krishnamurthy (2002) (2 citations) (Correct)
....commit the updates in increasing order of the CSN. The problem with this approach is that using a single primary to decide the order may not scale well when there is a large number of replicas. A third approach, used by Deno [39] is based on an optimistic version of the quorum consensus protocol [19, 30, 34, 49]. Deno assigns each replica a weight in such a way that the weight of the replicas adds up to 1. Each update is associated with a vote that increases by an amount that is equal to a replica s weight, when the update is received by the replica. When multiple updates circulate simultaneously, the ....
D. Malkhi, M. Reiter, and R. Wright. Probabilistic Quorum Systems. In Proc. of the 16th ACM Symposium on Principles of Distributed Computing, August 1997.
Quorum Placement in Networks to Minimize Access Delays - Gupta, Maggs, Oprea, Reiter (2005) Self-citation (Reiter) (Correct)
No context found.
D.Malkhi,M.K.Reiter,A.Wool,andR.N.Wright. Probabilistic quorum systems. Inform. and Comput., 170(2):184--206, 2001.
Quorum Placement in Networks: Minimizing Network.. - Golovin, Gupta, Maggs.. (2006) Self-citation (Reiter) (Correct)
No context found.
D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. Probabilistic quorum systems. Inf. Com., 170(2):184--206, 2001.
Byzantine Quorum System - Malkhi, Reiter (1998) (98 citations) Self-citation (Malkhi Reiter) (Correct)
No context found.
Malkhi D, Reiter M, Wright R: Probabilistic quorum systems. In: Proceedings of the 16th ACM Symposium on Principles of Distrib Comput, pp 267--273, August 1997
Probabilistic Quorums for Dynamic Systems - Abraham, Malkhi (2003) (6 citations) Self-citation (Malkhi) (Correct)
No context found.
D. Malkhi, M. Reiter, A. Wool and R. Wright. Probabilistic quorum systems. The Information and Computation Journal 170(2):184--206, November 2001.
On Diffusing Updates in a Byzantine Environment - Malkhi, Mansour, Reiter (1999) (5 citations) Self-citation (Malkhi Reiter) (Correct)
No context found.
D. Malkhi, M. Reiter, and R. Wright. Probabilistic quorum systems. In Proceedings of the 16th ACM Symposium on Principles Distributed Computing, pages 267--273, August 1997.
Probabilistic Quorums for Dynamic Systems - Abraham, Malkhi (2003) (6 citations) Self-citation (Malkhi) (Correct)
No context found.
D. Malkhi, M. Reiter, A. Wool and R. Wright. Probabilistic quorum systems. The Information and Computation Journal 170(2):184--206, November 2001.
Probabilistic Quorums for Dynamic Systems - Dahlia Malk Hi (2003) Self-citation (Malkhi) (Correct)
No context found.
D. Malkhi, M. Reiter, A. Wool and R. Wright. Probabilistic quorum systems. The Information and Computation Journal 170(2):184206, November 2001.
From Process-Centric to Data Centric Replication - Malkhi (2002) Self-citation (Malkhi) (Correct)
No context found.
D. Malkhi, M. Reiter, A. Wool and R. Wright. Probabilistic Quorum Systems. The Information and Computation Journal 170(2), November 2001.
Diffusion without False Rumors: On Propagating Updates in .. - Malkhi, Mansour, Reiter (2003) (3 citations) Self-citation (Malkhi Reiter) (Correct)
No context found.
D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. Probabilistic quorum systems. Information and Computation 170(2), November 2001.
Search with Probabilistic Guarantees in.. - Ferreira.. (2005) (Correct)
No context found.
D. Malkhi, M. Reiter, and R. Wright. Probabilistic Quorum Systems. In Proceedings of ACM PODC'97, pages 267-- 273, Santa Barbara, CA, August 1997.
Randomized Protocols for Duplicate Elimination in.. - Ferreira.. (2005) (Correct)
No context found.
D. Malkhi, M. Reiter, and R. Wright. Probabilistic Quorum Systems. In Proceedings of PODC '97, pages 267--273, Santa Barbara, CA, August 1997.
Fault-Tolerant Storage in a Dynamic Environment - Nadav, Naor (2004) (Correct)
No context found.
D. Malkhi, M. Reiter and R. Wright, Probabilistic quorum systems. PODC 97.
Pilot: Probabilistic Lightweight Group Communication.. - Luo, Eugster, Hubaux (2004) (2 citations) (Correct)
No context found.
D. Malkhi, M.K. Reiter, and A. Wool, "Probabilistic Quorum Systems," Information and Computation, vol. 170, no. 2, pp. 184-206, 2001.
Efficient Randomized Search Algorithms in.. - Ferreira.. (Correct)
No context found.
D. Malkhi, M. Reiter, and R. Wright, "Probabilistic quorum systems," in Proceedings of the 16th Annual ACM Symposium on the Principles of Distributed Computing (PODC 97), Santa Barbara, CA, August 1997, pp. 267--273.
PILOT: ProbabIlistic Lightweight grOup communication.. - Luo, Eugster, Hubaux (2003) (2 citations) (Correct)
No context found.
D. Malkhi, M.K. Reiter, and A. Wool, "Probabilistic quorum systems," Information and Computation, vol. 170, no. 2, pp. 184--206, 2001.
Probabilistic Quorums for Dynamic Systems (Extended Abstract) - Abraham, Malkhi (2003) (Correct)
No context found.
D. Malkhi, M. Reiter, A. Wool and R. Wright. Probabilistic quorum systems. The Information and Computation Journal 170(2):184206, November 2001.
A Distributed Algorithm for Resource Allocation - With Probabilistic Quorum (2002) (Correct)
No context found.
D. Malkhi, M. Reiter, and R. Wright. Probabilistic quorum systems. In Proceedings of the 16th Annual ACM symposium on Principles of Distributed Computing, 1997.
A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks - Du, al. (2003) (30 citations) (Correct)
No context found.
D. Malkhi, M. Reiter, A. Wool, and R. N. Wright. Probabilistic quorum systems. Information and Computation, (2):184--206, November 2001.
A Dynamic Primary Configuration Group Communication.. - De Prisco, Fekete.. (1999) (4 citations) (Correct)
No context found.
D. Malkhi, M.K. Reiter, and R. Wright. Probabilistic quorum systems. In Proceedings of the 16 ACM Symposium on Principle of Distributed Computing (PODC), pages 267-273, 1997.
Initial Roadmap on Middleware For Composable and Dynamically.. - Midas (2003) (Correct)
No context found.
D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. Probabilistic quorum systems. Information and Computation, 2001.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC