Maintenance-Efficient Erasure Coding for Distributed Archival Storage
Cuong Hung Pham, Feng Zhang, Duc A. Tran
Abstract
Cuong Hung Pham, Feng Zhang, Duc A. Tran
Abstract
Maintenance is an important issue in distributed storage systems. In many cases, such as in archival storage where data access is infrequent, the workload due to maintaining a system is dominant and much heavier than that to answering retrieval queries. Erasure coding, widely used in many distributed storage systems for its high reliability, is efficient for maintenance but not so efficient for access. In this paper, we investigate an extension of this method with the purpose of improving maintenance efficiency and provide an analysis on the tradeoff of this extension.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Maintenance is an important issue in distributed storage systems. In many cases, such as in archival storage where data access is infrequent, the workload due to maintaining a system is dominant and much heavier than that to answering retrieval queries. Erasure coding, widely used in many distributed storage systems for its high reliability, is efficient for maintenance but not so efficient for access. In this paper, we investigate an extension of this method with the purpose of improving maintenance efficiency and provide an analysis on the tradeoff of this extension.
Key concepts: Erasure code, Computer science, Distributed data store, Coding (social sciences), Workload, Distributed database, Distributed computing, Erasure