Hi, My query has more to do with raid algorithms rather than the Linux implementation. Let me know if I'm off topic :).
I am planning to build system where it is possible to create 100's of array(raid 5) at a time, that means some of them can go faulty even before init-task is complete.If INIT hasn't completed then there is no way to rebuild the array(?). Lets say raid-subsystem does things this way. We bypass init. Array is RUNNING The stripes are always cached in memory. a)whenever a cache miss happens we read the whole stripe(except parity). b) whenever we write to the disk we recompute parity based on the data and write it to disk. c)Now if a single disk fault happens the array is in REBUILD_REQUIRED state,for every read we recompute the parity and give the data back. The assumption here I make is that reads wont happen for locations where writes haven't happened. The exceptions are for boot sector and partition tables. I wanted to know if this is the right approach am I overlooking some aspect? Please excuse my poor English. I hope I was able to convey the qry. Regards, Jeane. -- "L'existence précède et commande l'essence." --Jeane Paul Sartre - To unsubscribe from this list: send the line "unsubscribe linux-raid" in the body of a message to [EMAIL PROTECTED] More majordomo info at http://vger.kernel.org/majordomo-info.html
