Exploring high performance distributed file storage using LDPC codes
Parallel Computing
RobuSTore: a distributed storage architecture with robust and high performance
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Redundancy and distributed caching in mobile DTNs
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
A three-tier information management architecture for mobile grid environments
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
Design of packet-based block codes with shift operators
EURASIP Journal on Wireless Communications and Networking
Towards efficient execution of erasure codes on multicore architectures
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
| Hi-index | 0.00 |
The problem of efficiently retrieving a file that has been broken into blocks and distributed across the wide-area pervades applications that utilize Grid, peer-to-peer, and distributed file systems. While the use of erasure codes to improve the fault-tolerance and performance of wide-area file systems has been explored, there has been little work that assesses the performance and quantifies the impact of modifying various parameters. This paper performs such an assessment. We modify our previously defined framework for studying replication in the wide-area [6] to include both Reed-Solomon and Low-Density Parity-Check (LDPC) erasure codes. We then use this framework to compareReed-Solomon and LDPC erasure codes in three wide-area, distributed settings. We conclude that although LDPC codes have an advantage over Reed-Solomon codes in terms of decoding cost, this advantage does not always translate to the best overall performance in wide-area storage situations.