Abstract | ||
---|---|---|
Abstract Causal consistency has been introduced to increase wait-free concurrent accesses to a shared memory. Contrarily to sequential consistency, causal consistency allows independent write operations, with respect to the causality relation, to be executed in dierent orders at each distinct process. This paper introduces a protocol for fully replicated settings which exploits the writing semantic and piggybacks on each update message related to a write operation an amount,of control information which is O(n) where n is the number,of processes. The protocol tracks causality relation by taking transitive dependencies on write operations into account. Keywords: Causal Memories, Writing Semantic, Replication, Distributed Coordination, Distributed Systems. |
Year | Venue | Keywords |
---|---|---|
2002 | OPODIS | shared memory,sequential consistency,distributed system |
Field | DocType | Citations |
Causal consistency,Causality,Sequential consistency,Shared memory,Computer science,Exploit,Real-time computing,Theoretical computer science,Transitive dependency,Consistency model,Distributed shared memory,Distributed computing | Conference | 1 |
PageRank | References | Authors |
0.36 | 14 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roberto Baldoni | 1 | 1606 | 132.37 |
C. Sparziani | 2 | 1 | 0.36 |
Sara Tucci Piergiovanni | 3 | 286 | 22.22 |
Daniela Tulone | 4 | 184 | 10.95 |