> [ ... ] More generally, given a N data blocks and M "parity" > blocks per stripe, [ ... ] As an aside, N or M (not both...) can be 0. When M is zero that's RAID0, and when N is zero all or (more usefully) a subset of M "parity" blocks are needed to reconstruct any one data block; for example M is 5, there are 3 data blocks encoded across them, and any data block can be reconstructed given any 4 "parity" blocks -- numbers made up BTW. In general a logical RAID is a matrix of rows of W data and/or parity blocks times S the number of stripes, and RAID implementations remap that onto another matrix of D storage devices each with C blocks; where both the stripe matrix and athe storage matrix can be be subdivided, by row or column (usually the stripe matrix columwise and the device matrix rowwise). -- To unsubscribe from this list: send the line "unsubscribe linux-raid" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
