Name
Abstract | ||
|---|---|---|
Distributed shared memory (DSM) is one of the main ab- straction to implement data-centric information exchanges among a set of processes. Ensuring causal consistency means all operations executed at each process will be com- pliant to a cause effect relation. This paper first provides an optimality criterion for a protocolP that enforces causal consistency on a DSM. This criterion addresses the number of write operations delayed byP (write delay optimality). Then we present a protocol which is optimal with respect to write delay optimality and we show how previous protocols presented in the literature are not optimal with respect to such a criterion. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/IPDPS.2004.1302998 | IPDPS |
Keywords | Field | DocType |
concurrent computing,information exchange,broadcasting,distributed computing,distributed shared memory,protocols,history | Broadcasting,Causal consistency,Remuneration,Abstraction,Optimality criterion,Computer science,Read-write memory,Parallel computing,Concurrent computing,Distributed shared memory,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.34 | 13 |
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 |