S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230--280, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Need for Realistic Failure Models in Protocol Design - Keidar, Marzullo (2002) (1 citation) (Correct)
....complexity of the model and to avoid state explosion, stochastic analyses often model several protocol steps as one atomic action. If such simpli cations are not done with care, they can lead to incorrect analyses. For example, several analyses of the availability dynamic voting algorithms (e.g. [5, 11]) modeled a step where all processes agree to move into a new con guration as one atomic action. In practice, such agreement involves communication, and further failures can occur while such communication is taking place. Such failures can lead to blocking, which was not taken into account in ....
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. Database Syst., 15(2):230-280, 1990.
A Dynamic Primary View Group Communication Service - De Prisco, Fekete, Lynch.. (2002) (Correct)
....in order to permit enough information ow between successive primary views to achieve coherence. For example, each primary view might have to contain at least a majority of the processes in the previous primary view. Several dynamic voting schemes have been developed to de ne primaries adaptively [12, 15, 21, 26, 33]. In particular, Lotem, Keidar, and Dolev [26] have described an implementation of a group membership service that yields only primary views, according to a dynamic notion of primary. An interesting feature of their work is that it points out various subtleties of implementing such a membership ....
....noti cation for a particular message m that tells the recipient that message m has been received by all the members of the current view. New views are announced to all members of the new view and they are guaranteed to be primary views. Primary views are de ned according to a dynamic notion [21]: a new primary needs to contain a majority of the members of the previous primary. The dvs service allows the clients to register a new view after completing the pre processing for that view. The speci cation is given in Figure 1. In this speci cation, M c M denotes the set of messages ....
S. Jajodia and D. Mutchler, \Dynamic voting algorithms for maintaining the consistency of a replicated database", ACM Trans. Database Systems, n.15(2), pp. 230-280, 1990.
On the Performance of Wide-Area Synchronous Database.. - Amir, Danilov.. (2002) (Correct)
....Spread group communication toolkit. The database clients see the system as in figure 5.A. and are not aware of the replication although they access the database through our replication server. Similarly, any instance Examples of quorum systems include monarchy, majority, dynamic linear voting [15] 9 of the database manager sees the local replication server as a client. The replication server consists of several independent modules that together provide the database integration and consistency services (Figure 5.B) They include: A Replication Engine that includes all of the ....
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230--280, 1990.
A Dynamic Primary View Group Communication Service - De Prisco, Fekete, Lynch.. (2002) (Correct)
....order to permit enough information flow between successive primary views to achieve coherence. For example, each primary view might have to contain at least a majority of the processes in the previous primary view. Several dynamic voting schemes have been developed to define primaries adaptively [12, 15, 21, 26, 33]. In particular, Lotem, Keidar, and Dolev [26] have described an implementation of a group membership service that yields only primary views, according to a dynamic notion of primary. An interesting feature of their work is that it points out various subtleties of implementing such a membership ....
....notification for a particular message m that tells the recipient that message m has been received by all the members of the current view. New views are announced to all members of the new view and they are guaranteed to be primary views. Primary views are defined according to a dynamic notion [21]: a new primary needs to contain a majority of the members of the previous primary. The DVS service allows the clients to register a new view after completing the pre processing for that view. The specification is given in Figure 1. In this specification, c denotes the set of messages that ....
S. Jajodia and D. Mutchler, "Dynamic voting algorithms for maintaining the consistency of a replicated database", ACM Trans. Database Systems, n.15(2), pp. 230-280, 1990.
Scalable and Dynamic Quorum Systems - Naor, Wieder (2003) (6 citations) (Correct)
....Dynamic Paths Quorum System In this section we suggest a quorum system that operates in the dynamic model, where processors may join and leave. Previous constructions of dynamic quorums focused on designing algorithms that allowed a group of processors to form a new quorum in a consistent way ([8], 9] 21] The quorums themselves are usually assumed to be weighted voting. We focus on the combinatorial properties of dynamic quorums. Our goal is to design dynamic quorums that enjoy low load, high availability, low probe complexity and that scale gracefully in respect to these parameters. ....
Sushil Jajodia and David Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230--280, June 1990.
Implementing Atomic Memory in Dynamic Networks, Using.. - Gilbert, Lynch.. (Correct)
....objects in message passing systems. Such algorithms assume a static processor universe and rely on static quorum systems. In long lived systems where processors may dynamically join and leave the system, it is important to reconfigure a quorum system to adapt it to the new set of processors [8, 4, 7, 17]. Prior approaches required that the new quorum system include processors from the old quorum system. This is stated as a static constraint on the quorum system that needs to be satisfied during or even before the reconfiguration. In our work on reconfigurable atomic memory [15, 5, 12] we replace ....
S. Jajodia and David Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230--280, 1990.
Consistent Distributed Commit: A Constant Overhead Solution - Awerbuch, Lu, Tutu (2002) (Correct)
....the fail stop model, the nodes that become disconnected from the primary component are considered failed and do not re merge with the primary. As mentioned, the primary component is determined using a quorum system. Quorum systems and their properties have been largely studied in the literature [AW96, JM90, Woo98]. Examples of quorum systems include majority, monarchy, tree based and dynamic linear voting. The algorithm remains basically the same, but the reconciliation phase will also collect the data necessary to determine the primary component. This information could be collected by the tree ....
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230280, 1990.
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 ....
S. Jajodia and D. Mutchler. Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database. ACM TODS, 15(2):230--280, 1990.
On the Path from Total Order to Database Replication - Amir, Tutu (2004) (Correct)
No context found.
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230--280, 1990.
Are Quorums an Alternative - For Data Replication (2003) (Correct)
No context found.
JAJODIA,S.AND MUTCHLER, D. 1990. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. Datab. Syst. 15, 2 (June), 230--280.
On the Path from Total Order to Database Replication - Amir, Tutu (2004) (Correct)
No context found.
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230--280, 1990.
Implementable Models for Replicated And Fault-Tolerant.. - Briz (2003) (Correct)
No context found.
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. on Database Sys., 15(2):230--280, June 1990.
GlobData: A Platform for Supporting Multiple.. - Munoz, Irun.. (2003) (Correct)
No context found.
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. on Database Sys., 15(2):230--280, June 1990.
GlobData: Consistency Protocols for Replicated Databases - Munoz-Escoi.. (2001) (Correct)
No context found.
Sushil Jajodia and David Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. on Database Sys., 15(2):230--280, June 1990.
Flexible Management of Consistency and.. - Munoz-Escoi.. (2002) (Correct)
No context found.
Jajodia, S., Mutchler, D.: Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. on Database Sys. 15 (1990) 230-280
GeoQuorums: Implementing Atomic Memory in Ad Hoc.. - Dolev, Gilbert.. (2003) (3 citations) (Correct)
No context found.
S. Jajodia and David Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. Transactions on Database Systems, 15(2):230--280, 1990.
RAMBONODEs for the Metropolitan Ad Hoc Network - Beal, Gilbert (2004) (Correct)
No context found.
S. Jajodia and David Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. Trans. on Database Systems, 15(2):230--280, 1990.
Scalable and Dynamic Quorum Systems - Naor, Wieder (2003) (6 citations) (Correct)
No context found.
Sushil Jajodia and David Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230--280, June 1990.
RAMBONODES for the Metropolitan Ad Hoc Network - Jacob Beal Seth (2003) (Correct)
No context found.
S. Jajodia, D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. Trans. on Database Systems, 15(2):230--280, 1990.
On the Performance of Consistent Wide-Area Database.. - Amir, Danilov.. (2003) (1 citation) (Correct)
No context found.
S. Jajodia and D. Mutchler, "Dynamic voting algorithms for maintaining the consistency of a replicated database," ACM Transactions on Database Systems, vol. 15, no. 2, pp. 230--280, 1990.
A Dynamic Primary Configuration Group Communication.. - De Prisco, Fekete.. (1999) (4 citations) (Correct)
No context found.
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. Database Systems, 15(2):230-280, 1990.
Deno: A Decentralized, Peer-to-Peer.. - Cetintemel.. (2003) (Correct)
No context found.
S. Jajodia and D. Mutchler, "Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database," ACM Trans. Database Systems, vol. 15, no. 2, pp. 230-280, 1990.
Analyzing User-Perceived Dependability and Performance.. - Chen, Wang, Chu (2003) (Correct)
No context found.
S. Jajodia and D. Mutchler, "Dynamic voting algorithms for maintaining the consistency of replicated database," ACM Trans. Database Systems, vol. 15, no. 2, pp. 230--280, 1990.
Graceful Quorum Reconfiguration in a Robust Emulation of.. - Englert, Shvartsman (2000) (4 citations) (Correct)
No context found.
S. Jajodia and D. Mutchler, "Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database", in ACM Trans. Database Systems, 15(2):230-280, 1990.
Dynamic Voting for Consistent Primary Components - Lotem (1996) (26 citations) (Correct)
No context found.
S. Jajodia and D. Mutchler. Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database. ACM Trans. Database Systems, 15(2):230--280, 1990.
First 50 documents Next 50
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