Version vectors (VV) are used pervasively to track dependencies between replica versions in multi-version distributed storage systems. In these systems, VV tend to have a dual functionality: identify a version and encode causal dependencies. In this paper, we show that by maintaining the identifier of the version separate from the causal past, it is possible to verify causality in constant time (instead ofO(n)for VV) and to precisely track causality with information with size bounded by the degree of replication, and not by the number of concurrent writers.
|Title of host publication||ACM symposium on Principles of distributed computing|
|Publication status||Published - 1 Jan 2012|
|Event||2012 ACM symposium on Principles of distributed computing - |
Duration: 1 Jan 2012 → …
|Conference||2012 ACM symposium on Principles of distributed computing|
|Period||1/01/12 → …|