Intelligent Disk Subsystems
Intelligent Disk Subsystems
Δ = A ⊕ Ã.
The new parity block ˜P can now simply be calculated from
the old parity block P and , i.e. p̂ = P ⊕ Δ
• Therefore, if P (ABCD) is the parity block for the data blocks A, B, C and D, then after
the data block A has been changed, the new parity block can be calculated without
knowing the remaining blocks B, C and D.
• However, the old block A must be read in before overwriting the physical hard disk
in the controller, so that this can calculate the difference .
•Then it uses the ⊕ operation to calculate the difference between the old and the new parity
block, i.e. Δ = D XOR D˜ , and from this the new
Therefore it is not necessary to read in all four associated data blocks to recalculate the parity block.
To
RAID 2 and RAID 3
• In RAID 2 the Hamming code is used, so that
redundant information is stored in addition to the
actual data. This additional data permits the
recognition of read errors and to some degree also
makes it possible to correct them.
• RAID 3 stores parity data and it distributes the data
of a block amongst all the disks of the RAID 3
system so that, in contrast to RAID 4 or RAID 5, all
disks are involved in every read or write access.
A comparison of the RAID levels
CACHING: ACCELERATION OF HARD DISK ACCESS