Wang, Zhiying and Dimakis, Alexandros G. and Bruck, Jehoshua (2010) Rebuilding for Array Codes in Distributed Storage Systems. California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
- Submitted Version
See Usage Policy. 299kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103
Abstract
In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that uses an EVENODD code. EVENODD codes are maximum distance separable (MDS) array codes that are used to protect against erasures, and only require XOR operations for encoding and decoding. We show that when there are two redundancy nodes, to rebuild one erased systematic node, only 3=4 of the information needs to be transmitted. Interestingly, in many cases, the required disk I/O is also minimized.
| Item Type: | Report or Paper (Technical Report) | ||||
|---|---|---|---|---|---|
| ORCID: |
| ||||
| Group: | Parallel and Distributed Systems Group | ||||
| Record Number: | CaltechPARADISE:2010.ETR103 | ||||
| Persistent URL: | https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103 | ||||
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. | ||||
| ID Code: | 26134 | ||||
| Collection: | CaltechPARADISE | ||||
| Deposited By: | Imported from CaltechPARADISE | ||||
| Deposited On: | 01 Sep 2010 | ||||
| Last Modified: | 22 Nov 2019 09:58 |
Repository Staff Only: item control page
