Rebuilding for Array Codes in Distributed Storage Systems

Details Rebuilding for Array Codes in Distributed Storage Systems Rebuilding for Array Codes in Distributed Storage Systems

2010-09-16

arxiv.org/abs/1009.3291v1

Computer Science

Information Theory

7 pages, 3 figures, accepted by workshop on the Application of Communication Theory to Emerging Memory Technologies (ACTEMT) 2

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Rebuilding for Array Codes in Distributed Storage Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rebuilding for Array Codes in Distributed Storage Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rebuilding for Array Codes in Distributed Storage Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-441194