R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. on Database Systems, 4:180--209, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Implementing an Eventually-Serializable Data Service as a.. - Cheiner, Shvartsman (1999) (1 citation) (Correct)
....replicas when serializing client operations. Several notions of consistency have been de ned. The strongest notion is atomicity, requiring that replicas emulate a single centralized object. Methods to achieve atomicity include write all read one [3] primary copy [1, 18, 17] majority consensus [19], and quorum consensus [11] Achieving atomicity often incurs a high cost, while some applications, such as directory services [20, 21] are willing to tolerate some transient inconsistencies. This gives rise to di erent notions of consistency. Sequential consistency [14] guaranteed by systems ....
R. Thomas. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Transactions on Database Systems, 4(2):180-209, June 1979.
A Replication Strategy for Distributed Real-Time.. - Peddi, DiPippo (2001) (1 citation) (Correct)
....blocking times (described fully in [7] are added to the analysis described above for DM to provide the proper analysis. 2.3. Replication Control Algorithms Many real time replication control algorithms have been proposed based on concurrency control mechanisms like majority consensus approach [8] and distributed two phase locking [9] distributed two phase locking, distributed optimistic concurrency control (OCC) 10] distributed optimistic two phase locking (02PL) 11] MIRROR (Managing Isolation in Replicated Real Time Object Repositories) 12] is a concurrency control algorithm ....
R. Thomas, A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Transactions on Database Systems, 4(2): 180-209 (1979).
Small Byzantine Quorum Systems - Martin, Alvisi, Dahlin (2001) (2 citations) (Correct)
....because it must eventually reach a responsive set of servers, and (3) the original Malkhi and Reiter protocols terminate. protocol consumes at most L buffers. Finite Buffering) This follows from the locking of step FIRST. 5. Related Work There is a significant body of work on quorum systems [11, 13, 18, 29] but Byzantine failures were first considered by Malkhi and Reiter [19] They have extended this work in other directions, for example by distinguishing between crash and Byzantine failures [21] In the same work, Malkhi and Reiter show how to use smaller quorums (as opposed to smaller quorum ....
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. Database Systems, 4(2):180--209, 1979.
FAB: enterprise storage systems on a shoestring - Svend Frlund Arif (2003) (9 citations) (Correct)
....when certain combinations of client and device failures occur. In contrast, our algorithm can tolerate the simultaneous crash of all bricks, and it can make progress whenever a majority recover and are able to communicate. Numerous replication protocols use majority voting. The protocol by Thomas [12] is similar to ours in that it uses timestamps to order write requests against a majority of Avyr#97 r. o oor. A67 # # # ## # ## # # # # # # # ### # ## # # ## # Figure 1: A typical FAB structure. Client computers connect to the FAB bricks using standard protocols. Clients can issue ....
....to optimize the system s performance and memory consumption. In FAB, an I O request to logical blocks is handled by the coordinator module of any brick (from a clients view, every brick can act as a disk array controller) FAB runs a variation of a timestamp based majority voting protocol [12]. The full details of the protocol and a correctness proof are presented in [5] Figure 2 shows an example. The task of the coordinator is straightforward in theory: when writing, it generates a new timestamp and writes the value and timestamp to the majority of replicas; when reading, it reads ....
[Article contains additional citation context not shown here]
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. on Database Sys. (TODS), 4(2):180--209, June 1979.
A Replica Consistency Algorithm For Globdata - Martins (2003) (Correct)
....request had already been sent. We would then have two possible scenarios: 1. If t b would latter commit, then its writes would overwrite t a s writes, and therefore t a would not need to request those locks, or process the corresponding updates. This reasoning is known as the Thomas Write Rule [28]. 2. If t b would latter abort, then the database would have to be restored to a state without t b , for example by applying t a s redo logs to the database. While scenario 1 would pose no problems to the COPLA architecture, scenario 2 would imply the existence of a mechanism that would allow a ....
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.
Eventually-Serializable Data Services - Fekete, Gupta, Luchangco, Lynch.. (1996) (10 citations) (Correct)
....the operations are applied at each replica. The strongest and simplest notion of consistency is atomicity, which requires the replicas to collectively emulate a single centralized object. Methods to achieve atomictry include write all read one [4] primary copy [1, 21, 18] majority consensus [22], and quorum consensus [8, 9] Because achieving atomJetty often has a high performance cost, some applications, such as directory services, are willing to tolerate some transient inconsistencies. This gives rise to different notions of consistency. Sequential consistency [13] guaranteed by ....
R. Thomas. A majority consensus approach to concurrency control for multiple copy databases. A CM Transactions on Database Systems, 4(2):180-209, June 1979. 309
Implementing Atomic Memory in Dynamic Networks, Using.. - Gilbert, Lynch.. (Correct)
....of the new algorithm, a correctness proof, and a conditional performance analysis. Preliminary empirical studies performed using LAN implementations of RAMBO and the new algorithm illustrate the advantages of the new algorithm. Background. Starting with the work of Gifford [6] and Thomas [18], intersecting collections of sets found use in several algorithms providing consistent data in distributed settings. Depending on the algorithm and its setting, such collections of sets, called quorums when any two have non empty intersection, represent either sets of processors or their ....
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
Small Byzantine Quorum Systems - Lorenzo (2001) (2 citations) (Correct)
....because it must eventually reach a responsive set of servers, and (3) the original Malkhi and Reiter protocols terminate. protocol consumes at most buffers. Finite Buffering) This follows from the locking of step FIRST. 5. Related Work There is a significant body of work on quorum systems [11, 13, 18, 29] but Byzantine failures were first considered by Malkhi and Reiter [19] They have extended this work in other directions, for example by distinguishing between crash and Byzantine failures [21] In the same work, Malkhi and Reiter show how to use smaller quorums (as opposed to smaller quorum ....
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. Database Systems, 4(2):180--209, 1979.
Verification of Cache Coherence Protocols by Aggregation of.. - Park, Dill (1998) (4 citations) (Correct)
.... be [34] Indeed, the techniques described belowhave been used to verify safety properties of significant examples: the cache coherence protocol for the FLASH multiprocessor which is currently being designed at Stanford [15] 20] a majority consensus algorithm for multiple copy databases [41], 18] and a distributed list protocol [9] The method proves that an implementation state graph is consistent with a specification state graph that captures the abstract behavior of the protocol, in which each transaction appears to be atomic. The method involves constructing an abstraction ....
R. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.
Eventually-Serializable Data Services - Fekete, Gupta, Luchangco, Lynch.. (1998) (10 citations) (Correct)
....the operations are applied at each replica. The strongest and simplest notion of consistency is atomicity, which requires the replicas to collectively emulate a single centralized object. Methods to achieve atomicity include write all read one [4] primary copy [1, 26, 23] majority consensus [27], and quorum consensus [11, 12] Because achieving atomicity often has a high performance cost, some applications, such as directory services, are willing to tolerate some transient inconsistencies. This gives rise to different notions of consistency. Sequential consistency [16] guaranteed by ....
R. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979. 42
Design and Implementation of DB-MAN: Does Database - Migration Work Well (Correct)
....of our future work, we are planning to implement the concurrency control function con sidering DB migration, e.g. support for read write operations during DB migration. We are also planning to extend the DB MAN system to deal with database replicas[Krishnakumar et al. 1992, Stonebraker, 1979, Thomas, 1979] in order to im prove the system performance when concurrent accesses frequently occur. 6 Acknowledgment This research was supported in part by Special Coordination Funds for promoting Science and Technology of the Ministry of Education, Culture, Sports, Science and Technology of Japan, by ....
Thomas, R.H. (1979). A majority consensus approach to concurrency control for multiple copy databases. ACM Transaction on Database Systems, 4(2) :180-209.
The Database State Machine Approach - Pedone, Guerraoui, Schiper (5 citations) (Correct)
....locally at s j , t b has its write locks on the data items it updated. If t b commits, its writes will overwrite t a s (i.e. the ones that overlap) and, in this case, t a need neither request these write locks nor process the updates over the database. This is similar to Thomas Write Rule [11]. However, if t b is later aborted (i.e. it does not pass the certi cation test) the database should be restored to a state without t b , for example, by applying t a s redo log entries to the database. c) There is a transaction t b that has passed the certi cation test and has granted its ....
R. H. Thomas, \A majority consensus approach to concurrency control for multiple copy databases," ACM Transactions on Database Systems, vol. 4, pp. 180-209, June 1979. 24
A Distributed Data-balanced Dictionary Based on the B-link Tree - Johnson, Colbrook (1992) (7 citations) (Correct)
....for distributed memory architectures. The search tree uses the B link tree [1] as a base, and distributes ownership of the nodes among the processors that maintain the tree. We also replicate the non leaf nodes, to improve parallelism. If we apply a read one, write all consistency maintenance rule [2], then reading a node becomes cheaper and writing to a node becomes more expensive as we increase the degree of replication. We observe that a node close to the root is often read, but rarely written to, but a node close to a leaf is rarely read, but is (relatively) often written to. Therefore, ....
....modifications to nodes occur atomically. We can achieve the atomic updates by requiring that modifying suboperations lock every copy of the modified node before performing the update and block all reads and updates on the node, by using one of the well known algorithms for managing replicated data [2, 30]. However, we can maintain our replicated nodes with far less synchronization and overhead. First, observe that it is not necessary to distribute the contents of the node on every modification, it is only necessary to distribute the modification itself. Second, the trec is never left in an ....
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180-209, 1979.
Disconnected Actions: An Asynchronous Extension to a Nested.. - Ben-Zvi (1990) (Correct)
....is presented in detail below. Section 1.2 overviews some basic work in the field of nested atomic actions. The chapter concludes with an overview of the rest of the thesis. 1. 1 Replicated File System an example Assume a replicated file system that employs a simple voting scheme (like those in [Thomas 1979, Gifford 1979] There are N sites, each containing a replica of the file and a version number. A file is updated by assembling a write quorum of W sites, and read by a read quorum of R sites. In order to ensure one copy serializability , the quorums should satisfy two constraints: W R N ....
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.
Optimistic Replication for Internet Data Services - Saito, Levy (2000) (11 citations) (Correct)
....Directory [13] and Usenet [20] Any replica (or any node for a newly created object) can issue an update any time. A coordinator, usually the issuer of the update, propagates the update by pushing the new object state to others in background. Con icting updates are resolved by Thomas write rule [21], that is, by attaching timestamps to them and accepting only the newest update. Our algorithm is unique in its uniform handling of replica set updates and contents updates in fact, an update is actually a tuple consisting of the new object contents and the new replica set. For an update that ....
Robert Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. on Database Systems, 4(2):180-209, June 1979.
The Load, Capacity and Availability of Quorum Systems - Naor, Wool (1998) (3 citations) (Correct)
....probability measures how resilient the system is, and we would like F p to be as small as possible. Our goal is to investigate these criteria and find quorum systems that perform well according to all three of them. 1.2. Related Work. The first distributed control protocols using quorum systems [42, 14] use voting to define the quorums. Each processor has a number of votes, and a quorum is any set of processors with a combined number of votes exceeding half of the system s total number of votes. The simple majority system is the most obvious voting system. The availability of voting systems is ....
R. H. Thomas, A majority consensus approach to concurrency control for multiple copy databases, ACM Trans. Database Sys., 4 (1979), pp. 180--209.
Nested Transactions: An Approach to Reliable Distributed Computing - Eliot, Moss (1981) (38 citations) (Correct)
....has not yet been conclusively verified or re.ted. In addition to differences in the level at which replication is introduced, the schemes mentioned above present a variety of concurrency control mechan for accessing the various copies. SDD 1 uses timestamps, as does a scheme suggested by Thomas [Thomas79] Thomas uses majority consensus voting by the copies of the objects. SDD 1 adopted some of Th mas ideas, but uses a unique and complicated concurrency control scheme involving pre analysis of transaction classes and four different protocols for different cases. Gifford uses locking instead of ....
....Goodman [BG80] Some of the schemes involve voting: in trying to acquire a replicated resource, one asks each copy if it is willing to go along with the request. If the transaction receives a quorum of agreeing votes, then it has the resource. The first voting algorithm was published by Thomas [Thomas79] Gifford [Gifford79] presents an interesting generalization of voting: weighted votes. We will not suggest what kind of replication scheme to use on top of our system. However, most replication schemes will permit work to proceed even when a few copies are unavailable. Such situations could be ....
R. H. Thomas, '"A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases", ACM Trans. on Database Systems, Vol. 4, No. 2, June 1979, pp. 180-209.
Beyond Availability: Towards a Deeper Understanding of - Machine Failure.. (2004) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. on Database Systems, 4:180--209, 1979.
Quorum Placement in Networks to Minimize Access Delays - Gupta, Maggs, Oprea, Reiter (2005) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
Quorum Placement in Networks: Minimizing Network.. - Golovin, Gupta, Maggs.. (2006) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
Flexible Update Management in Peer-to-Peer Database Systems - David Del Vecchio (Correct)
No context found.
R.H. Thomas. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Transactions on Database Systems, 4 (2), June 1979, pp. 180-209.
Are Quorums an Alternative - For Data Replication (2003) (Correct)
No context found.
THOMAS, R. H. 1979. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Datab. Syst. 4, 9 (June), 180--209.
e-SAFE: An Extensible, Secure and Fault Tolerant Storage System - Arnab Paul Sandip (2005) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. In Database Systems, volume 4, pages 180--209, 1979.
Video Management in Peer-to-Peer Systems - Ying Cai Zhan (2005) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst., 4(2):180--209, June 1979.
Approximate Replication - Olston (2003) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
Concurrency Admission Control Management in ACCORD - Sue Nagy Azer (1997) (Correct)
No context found.
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
Improving the Bevahior of Optimistic Lazy Replication. - Luis Irun-Briz Francesc (2003) (Correct)
No context found.
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.
An Improved Optimistic and Fault-Tolerant Replication Protocol - Luis Irun-Briz Francesc (2003) (1 citation) (Correct)
No context found.
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.
Optimistic Lazy Replication: Impossibility and solution. - Luis Irun-Briz Francesc (Correct)
No context found.
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.
Implementable Models for Replicated And Fault-Tolerant.. - Briz (2003) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control. ACM Transactions on Database Systems, 4:180--209, 1979.
Multi-Dimensional Quorum Sets for - Read-Few Write-Many Replica (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.
Towards Fault-Tolerant and Secure On-Line Services - Zhou (2001) (3 citations) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180 209, June 1979. 153
Design of a Secure and Fault Tolerant Environment for.. - Arnab Paul Sameer (2004) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. In Database Systems, volume 4, pages 180--209, 1979.
GeoQuorums: Implementing Atomic Memory - In Mobile Ad (Correct)
No context found.
Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems 4 (1979) 180-209
Locality Based Protocol for MultiWriter Replication systems - Gao (2003) (Correct)
No context found.
R. Thomas. A Majority Consensus Approach to Concurrency Control for Multiple Copy Database. In ACM Transactions on Database Systems, pages 180--209, June 1979.
GeoQuorums: Implementing Atomic Memory in Ad Hoc.. - Dolev, Gilbert.. (2003) (3 citations) (Correct)
No context found.
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems, 4(2):180--209, 1979.
GeoQuorums: Implementing Atomic Memory in Mobile.. - Dolev, Gilbert.. (2003) (5 citations) (Correct)
No context found.
Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems 4 (1979) 180--209
Approximate Replication - Olston (2003) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
RAMBONODEs for the Metropolitan Ad Hoc Network - Beal, Gilbert (2004) (Correct)
No context found.
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems, 4(2):180--209, 1979. i A Execution Data Excerpt from an experimental trace, showing 43 read and write operations.
Clique: A transparent, Peer-to-Peer collaborative file.. - Richard, Nioclais.. (2002) (Correct)
No context found.
R. Thomas, "A majority consensus approach to concurrency control for multiple copy databases", ACM Trans. On Database Sy stems (TODS), 1979.
RAMBONODES for the Metropolitan Ad Hoc Network - Jacob Beal Seth (2003) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems, 4(2):180--209, 1979.
Distributed Bayesian Algorithms for Fault-Tolerant Event.. - Krishnamachari, Iyengar (2004) (Correct)
No context found.
R.H. Thomas, "A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases," ACM Trans. Database Systems, vol. 4, pp. 180-209, 1979.
Availability Evaluation of Quorum-Based Mutual Exclusion.. - Tsuchiya, Kikuno (Correct)
No context found.
Thomas, R. H. (1979) A majority consensus approach to concurrency control. ACM Trans. Database Syst., 4, 180--209.
GeoQuorums: Implementing Atomic Memory in Mobile Ad.. - Dolev, Gilbert.. (2004) (5 citations) (Correct)
No context found.
Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems, 4(2):180--209, 1979.
Dynamic Byzantine Quorum Systems - Lorenzo Alvisi Dahlia (2000) (9 citations) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
Towards a Decentralized Implementation of Transaction Management - Haller, Schuldt (2003) (Correct)
No context found.
R. Thomas. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Transactions on Database Systems (TODS), 4(2):180--209, June 1979.
Deno: A Decentralized, Peer-to-Peer.. - Cetintemel.. (2003) (Correct)
No context found.
R.H. Thomas, "A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases," ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, 1979.
A Tamper-Resistant Framework for Unambiguous Detection.. - Chinchani, Upadhyaya.. (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. on Database Systems, 4(2):180--209, June 1979.
Approximate Replication - Olston (2003) (Correct)
No context found.
R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979.
Dynamic Voting for Consistent Primary Components - Lotem (1996) (26 citations) (Correct)
No context found.
R. Thomas. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. on Database Systems, 4(2):180--209, June 1979. 48
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