Distributed File System | prof. Giovanni Chiola | ![]() |
Original data are split in K stripes. M redundant stripes are added, producing N=K+M total parts. | ||
A Galois' Field of order n such that 2n>N=K+M is chosen. | ||
Computational efficiency of coding and decoding is optimal in case of GF(8), with one byte representations; hence the total number of stripes is limited to N<256. | ||
Data can be restored if at least K stripes are available out of the N that were stored. | ||
previous | redun04.htm | next |