Name
Abstract | ||
|---|---|---|
To satisfy high reliability accompanied by space efficiency requirements, erasure coding is elected to substitute replication as a redundancy mechanism of in-memory clusters. More often than not, the use of erasure coding is limited to read-intensive applications, in which data in erasure-coded clusters are rarely updated. The essential rationale is that update penalty incurred by parity-synchroni... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/IPDPS49936.2021.00091 | 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS) |
Keywords | DocType | ISSN |
Distributed processing,Protocols,Redundancy,Throughput,Boosting,Encoding,Synchronization | Conference | 1530-2075 |
ISBN | Citations | PageRank |
978-1-6654-4066-0 | 0 | 0.34 |
References | Authors | |
0 | 5 | |