Name
Abstract | ||
|---|---|---|
A key-value store (KVS) offers functions for storing and retrieving values associated with unique keys. KVSs have become widely used as shared storage solutions for Internet-scale distributed applications. We present a fault-tolerant wait-free efficient algorithm that emulates a multi-reader multi-writer register from a set of KVS replicas in an asynchronous environment. Our implementation serves an unbounded number of clients that use the storage. It tolerates crashes of a minority of the KVSs and crashes of any number of clients. We provide two variants of our algorithm: one implementing an atomic register and one implementing a regular register; the latter does not require read operations to store data at the underlying KVSs. We note that applying state-of-the-art reliable storage solutions to this scenario is either impossible or prohibitively inefficient. |
Year | Venue | Keywords |
|---|---|---|
2011 | DSN '12 Proceedings of the 2012 42nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) | computational complexity,distributed storage,robustness,automata,information retrieval,semantics,fault tolerant,distributed application,cloud computing,emulation,registers |
DocType | ISSN | Citations |
Conference | 1530-0889 | 13 |
PageRank | References | Authors |
0.67 | 20 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristina Basescu | 1 | 32 | 2.81 |
| Christian Cachin | 2 | 2444 | 182.10 |
| Ittay Eyal | 3 | 304 | 26.11 |
| Robert Haas | 4 | 261 | 15.05 |
| Marko Vukolić | 5 | 504 | 32.42 |