Name
Title | ||
|---|---|---|
An asynchronous, decentralised commitment protocol for semantic optimistic replication |
Abstract | ||
|---|---|---|
Abstract: We study eventual consistency in an asynchronous,system with optimistic data replication. A site executes actions submitted by the local client, and remote actions as they are received. This state is only tentative, because semantic constraints such as conflicts, dependence, or atomicity may cause it to roll back some of its state and compute,a new state. The system should be eventually consistent, i.e., (i) each local schedule be correct and sta bilise eventually, and (ii) the schedules at each site eventually converge. We propose a decentralised, asynchronous commitment protocol that ensures this. Each site proposes a set of schedules to all oth er sites. A proposal can be decomposed into one or more semantically-meaningful units, called candidates. A candidate wins when it receives a majority or a plurality of the votes in its electio n, leaving room for missing votes. The protocol is fully asynchronous: each site executes its tentati ve schedule independently, and determines locally when,a candidate has won an election. The protocol is safe in the presence of non-byzantine |
Year | Venue | Keywords |
|---|---|---|
2006 | Clinical Orthopaedics and Related Research | replication,asynchronous system,data replication |
Field | DocType | Volume |
Optimistic replication,Atomicity,Asynchronous communication,Graph,Replication (computing),Computer science,Schedule,Client state,Database,Distributed computing | Journal | abs/cs/061 |
Citations | PageRank | References |
1 | 0.37 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Sutra | 1 | 152 | 14.73 |
| João Barreto | 2 | 1 | 0.37 |
| Marc Shapiro | 3 | 62 | 4.80 |