Erasure Correcting Code To Analyze And Optimize Stripe Write Data Of Double Parity In Raid Level-6

In Redundant Array of Independent Disks the data reliability and Performance are most important in modern storage systems. Such reliability is usually providing by using erasure correcting codes across storage devices like hard disks. From decades many researchers are work on reliability and data failure where the different techniques applied like single parity, mirroring, and maximum distance separable code to tolerate device failures when any fault or disaster occur. Recently theories observe that these techniques are not sufficient in data storage systems because of new technologies comes in market and also new research is in progress, to continue this, nowadays researchers has found erasure correcting codes methods and techniques with parameter of stripe write data. The output of this technique is an abundance that induces interesting tradeoffs when recover the failed data from redundant storage system.In the first part of this thesis, we analyze that how the data send in a RAID Level 6, the data how to write on the parity hard disk when complete the write data process on the storage system and also on the parity hard disk, after that we have to check that whether the data is to be written on the storage system or not and the new data is updated on the parity hard disk or not? After all, we have developed new theorems to solve the above problems with the help of double erasure correcting codes when any data failed in redundant array storage system. In the process of solving the methods of the double erasure codes, we have found many methods and techniques, which are not solved in a good way when has a large storage system, many theorems tried to solve in single storage system to tolerate only one disk failure, where our frameworks overcomes on these theorems and allows us to prove it and recover the data from the parity hard disk by using double erasure correcting code methods.In the second part, we study about the Data Distribution Mechanism in redundant array of independent disk which is called Data Striping, is describe to simplify the methods are used in highly approach. In storage systems there are multiple hard disks where striping is the process of separating parts of hard disk into data blocks and scattering the blocks across several partitions on different hard disks. The stripe size is an important parameter that has a great influence on the redundant array of independent disk subsystem performance; whereas as the performance impact has been changed due to the development of disk drive technologies and some input/output optimization methods apply which are based on access time of disk drives.Furthermore, approach of Data Distribution Mechanism in storage systems through redundant array of independent disk level 6 where the data could be failing at any risk. In this level has very high fault and drive failure tolerance that need long data retention periods, such as archiving. By using this raid level where one of the main disadvantages is that each set of parities must be calculated separately which shows write performance. When error has occurred in the storage array system, the fault tolerance in an array is corrupted, for this we have many methods to rebuild the data from storage array system to remove the corrupted or failed data.Finally, we used Erasure Correcting Code methods to Analyze and Optimize Stripe Write Data in a Redundant Array of Independent Disk Level 6 to recover failed or corrupted data from redundant array storage systems with the help of XOR techniques and reconstruct the methods which tends to decrease the negative achievement of using array resources for data rebuild, therefore in this RAID Level two parity devices are used and the parity technique allows the construction of an extended array that is tolerant of any one or two storage device failures. Where the old and new data must be applied to the parity hard disks as we can read the data parity from the array storage system. At the end, after update storage system there are six input and output operations performed which are Read Data, Write Data,(Read and Write two Parity disks) where P and Q parity disks which must be read and update. Where we consider possibilities of recover all failed or corrupted data which is happened by any disaster. The main contributions in this thesis are:1. Analyze the Double-Erasure Correcting code methods and proved theorems are used in Redundant Array of Independent Disk for parity when data failure occurs.2. Improvement partial stripe write by using two parity devices in redundant array of independent disk.3. Optimize XOR-based techniques to Recover a Failure Data from Redundant Array of Independent Disk by using Erasure Correcting codes.