Name
Abstract | ||
|---|---|---|
We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic Storage, which consists of two separate implementations, ORCAS-A and ORCAS-B. In terms of storage space used, ORCAS-A is more efficient in systems where we expect large number of concurrent writes, whereas, ORCAS-B is more suitable if not many writes are invoked concurrently. Compared to replication based implementations, both ORCAS implementations significantly save on the storage space. The implementations are optimistic in the sense that the used storage is lower in synchronous periods, which are considered common in practice, as compared to asynchronous periods. Indirectly, we show that tolerating asynchronous periods does not increase storage overhead during synchronous periods. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-87779-0_13 | DISC |
Keywords | Field | DocType |
atomic register implementation,storage overhead,storage space,synchronous period,erasure coding,asynchronous period,asynchronous crash-recovery model,concurrent writes,optimistic erasure-coded atomic storage,used storage,erasure code,fault tolerance,distributed storage,distributed algorithm | Asynchronous communication,Computer science,Parallel computing,Distributed data store,Implementation,Real-time computing,Distributed algorithm,Fault tolerance,Erasure code,Stable storage,Distributed computing,Erasure | Conference |
Volume | ISSN | Citations |
5218 | 0302-9743 | 7 |
PageRank | References | Authors |
0.50 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Partha Dutta | 1 | 389 | 23.51 |
| Rachid Guerraoui | 2 | 6364 | 430.90 |
| Ron R. Levy | 3 | 130 | 7.03 |