Name
Abstract | ||
|---|---|---|
Ensuring causal consistency in a Distributed Shared Memory (DSM) means all operations executed at each process will be compliant to a causality order relation. This paper first in- troduces an optimality criterion for a protocol P, based on a complete replication of memory locations at each process and propagation of write updates, that enforces causal consistency. This criterion measures the capability of a protocol to update the local copy as soon as possi- ble while respecting causal consistency. Then we present an optimal protocol built on top of a reliable broadcast communication primitive and we show how previous protocols based on complete replication presented in the literature are not optimal. Interestingly, we prove that the optimal protocol embeds a system of vector clocks which captures the read/write seman- tics of a causal memory. From an operational point of view, an optimal protocol exploiting reliable broadcast strongly reduces its message buer overhead. Simulation studies show |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s00446-005-0128-5 | Distributed computing |
Keywords | Field | DocType |
Causal consistency,Distributed shared memory,Propagation-based protocols,Optimality criterion,Distributed systems | Vector clock,Causal consistency,Causality,Optimality criterion,Computer science,Theoretical computer science,Consistency model,Distributed shared memory,Semantics,Distributed computing,Broadcast communication network | Journal |
Volume | Issue | ISSN |
18 | 6 | 0178-2770 |
Citations | PageRank | References |
12 | 0.64 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Baldoni | 1 | 1606 | 132.37 |
| Alessia Milani | 2 | 187 | 15.54 |
| Sara Tucci Piergiovanni | 3 | 286 | 22.22 |