SlideShare a Scribd company logo
1 of 3
Download to read offline
RAID
A variety of disk-organization techniques, collectively called redundant arrays of independent disks (RAID),
have been proposed to achieve improved performance and reliability
Improved reliability via redundancy:
 Measured of the reliability of the disk is MTTF (Mean Time to Failure) which states that the amount of
time that, on average, we can expect the system to run continuously without any failure.
 The chance that some disk out of a set of N disks will fail is much higher than the chance that a specific
disk will fail.
Suppose that the MTTF of a disk is 100,000 hours or slightly over 11 years
MTTF of some disk in an array of 100 disks will be 100,000/100 = 1000 hours or around 42 days, which
is not long at all!
 If it is stored only one copy of data, then each disk failure will result in loss of a significant amount of
data. Such a high rate of data loss is unacceptable. The solution is to introduce redundancy – store
extra information that is not needed normally, but that can be used in the event of failure of a disk to
rebuild the lost information.
 Approaches: The simplest but most expensive approach to introduce redundancy is to duplicate every
disk. This technique is called mirroring or shadowing.
Improved performance via parallelism:
1. With disk mirroring, the rate at which read requests can be handled is doubled, since read requests
can be sent to either disk
2. The transfer rate of each read is the same as in a single disk system, but the number of reads per unit
time is doubled.
3. With multiple disks we can improve the transfer rate by striping data (bit level striping or block level
striping) across multiple disks.
 In its simplest form, data striping consists of splitting the bits of each byte across multiple disks;
such striping is called bit-level striping
 Block-level striping stripes blocks across multiple disks. It treats the array of disks
as a single large disk, and it gives blocks logical numbers; we assume the block numbers start from
0.
RAID Levels:
 Mirroring provides high reliability but it is expensive. Striping provides high data transfer rates, but does
not improve reliability. So it requires redundancy at lower cost.
 Various alternative schemes aim to provide redundancy at lower cost by combining disk striping with
parity bits. These schemes have different cost-performance trade-offs. These schemes are classified
into RAID levels as in Figure 1. (In the figure, P indicates error-correcting bits, and C indicates a second
copy of the data.) For all levels, the figure depicts four disk’s worth of data, and the extra disks depicted
are used to store redundant information for failure recovery.
• RAID level 0 refers to disk arrays with striping at the level of blocks, but without any redundancy (such
as mirroring or parity bits).
• RAID level 1 refers to disk mirroring with block striping.
• RAID level 2, known as memory-style error-correcting-code (ECC) organization, employs parity bits.
Memory systems have long used parity bits for error detection and correction.
RAID level 3, bit-interleaved parity organization, improves on level 2 by exploiting the fact that disk
controllers, unlike memory systems, can detect whether a sector has been read correctly, so a single
parity bit can be used for error correction, as well as for detection.
RAID level 4, block-interleaved parity organization, uses block level striping, like RAID 0, and in
addition keeps a parity block on a separate disk for corresponding blocks from N other disks.
RAID level 5, block-interleaved distributed parity, improves on level 4 by partitioning data and parity
among all N + 1 disks, instead of storing data in N disks and parity in one disk.
RAID level 6, the P + Q redundancy scheme, is much like RAID level 5, but stores extra redundant
information to guard against multiple disk failures. Instead of using parity, level 6 uses error-correcting
codes such as the Reed–Solomon codes
Choice of RAID Level
The factors to be taken into account when choosing a RAID level are
• Monetary cost of extra disk storage requirements
• Performance requirements in terms of number of I/O operations
• Performance when a disk has failed
• Performance during rebuild (that is, while the data in a failed disk is being rebuilt on a new disk)

More Related Content

What's hot

Introduction to Storage technologies
Introduction to Storage technologiesIntroduction to Storage technologies
Introduction to Storage technologiesKaivalya Shah
 
Mass storage device
Mass storage deviceMass storage device
Mass storage deviceRaza Umer
 
Secondary storage structure
Secondary storage structureSecondary storage structure
Secondary storage structurePriya Selvaraj
 
Chapter 12 - Mass Storage Systems
Chapter 12 - Mass Storage SystemsChapter 12 - Mass Storage Systems
Chapter 12 - Mass Storage SystemsWayne Jones Jnr
 
Mass Storage Devices
Mass Storage DevicesMass Storage Devices
Mass Storage DevicesPrabu U
 
Mass storage structurefinal
Mass storage structurefinalMass storage structurefinal
Mass storage structurefinalmarangburu42
 
Coal presentationt
Coal presentationtCoal presentationt
Coal presentationtfika sweety
 
Quick Faq 3-Geo Configuration
Quick Faq 3-Geo ConfigurationQuick Faq 3-Geo Configuration
Quick Faq 3-Geo ConfigurationWestern Digital
 
Spectrum Scale Memory Usage
Spectrum Scale Memory UsageSpectrum Scale Memory Usage
Spectrum Scale Memory UsageTomer Perry
 
Cassandra advanced part-ll
Cassandra advanced part-llCassandra advanced part-ll
Cassandra advanced part-llachudhivi
 
HP Storage Backup (RDX) presentation
HP Storage Backup (RDX) presentation HP Storage Backup (RDX) presentation
HP Storage Backup (RDX) presentation Jaideep Kumar
 

What's hot (20)

Introduction to Storage technologies
Introduction to Storage technologiesIntroduction to Storage technologies
Introduction to Storage technologies
 
Mass storage device
Mass storage deviceMass storage device
Mass storage device
 
Secondary storage structure
Secondary storage structureSecondary storage structure
Secondary storage structure
 
Chapter 12 - Mass Storage Systems
Chapter 12 - Mass Storage SystemsChapter 12 - Mass Storage Systems
Chapter 12 - Mass Storage Systems
 
Mass Storage Devices
Mass Storage DevicesMass Storage Devices
Mass Storage Devices
 
Raid level 4
Raid level 4Raid level 4
Raid level 4
 
Mass storage structurefinal
Mass storage structurefinalMass storage structurefinal
Mass storage structurefinal
 
Storage Technologies
Storage TechnologiesStorage Technologies
Storage Technologies
 
Coal presentationt
Coal presentationtCoal presentationt
Coal presentationt
 
Disk structure
Disk structureDisk structure
Disk structure
 
Ch10
Ch10Ch10
Ch10
 
Disk Management
Disk ManagementDisk Management
Disk Management
 
HDFS
HDFSHDFS
HDFS
 
Quick Faq 3-Geo Configuration
Quick Faq 3-Geo ConfigurationQuick Faq 3-Geo Configuration
Quick Faq 3-Geo Configuration
 
Spectrum Scale Memory Usage
Spectrum Scale Memory UsageSpectrum Scale Memory Usage
Spectrum Scale Memory Usage
 
Disk management
Disk managementDisk management
Disk management
 
Nachos Extra Points
Nachos Extra PointsNachos Extra Points
Nachos Extra Points
 
Cassandra advanced part-ll
Cassandra advanced part-llCassandra advanced part-ll
Cassandra advanced part-ll
 
HP Storage Backup (RDX) presentation
HP Storage Backup (RDX) presentation HP Storage Backup (RDX) presentation
HP Storage Backup (RDX) presentation
 
Mass storage structure
Mass storage structureMass storage structure
Mass storage structure
 

Similar to RAID Levels

disk structure and multiple RAID levels .ppt
disk structure and multiple  RAID levels .pptdisk structure and multiple  RAID levels .ppt
disk structure and multiple RAID levels .pptRAJASEKHARV10
 
Data center core elements, Data center virtualization
Data center core elements, Data center virtualizationData center core elements, Data center virtualization
Data center core elements, Data center virtualizationMadhuraNK
 
Chapter 8 - Multimedia Storage and Retrieval
Chapter 8 - Multimedia Storage and RetrievalChapter 8 - Multimedia Storage and Retrieval
Chapter 8 - Multimedia Storage and RetrievalPratik Pradhan
 
Exercise 3-1 This chapter’s opening scenario illustrates a specific .docx
Exercise 3-1 This chapter’s opening scenario illustrates a specific .docxExercise 3-1 This chapter’s opening scenario illustrates a specific .docx
Exercise 3-1 This chapter’s opening scenario illustrates a specific .docxnealwaters20034
 
CS 2212- UNIT -4.pptx
CS 2212-  UNIT -4.pptxCS 2212-  UNIT -4.pptx
CS 2212- UNIT -4.pptxLilyMkayula
 
Dr module 3 assignment Management homework help.docx
Dr module 3 assignment Management homework help.docxDr module 3 assignment Management homework help.docx
Dr module 3 assignment Management homework help.docxwrite31
 
RAID: High-Performance, Reliable Secondary Storage
RAID: High-Performance, Reliable Secondary StorageRAID: High-Performance, Reliable Secondary Storage
RAID: High-Performance, Reliable Secondary StorageUğur Tılıkoğlu
 
Raid Levels Technology
Raid Levels TechnologyRaid Levels Technology
Raid Levels TechnologyIshwor Panta
 
Storage systems reliability
Storage systems reliabilityStorage systems reliability
Storage systems reliabilityJuha Salenius
 

Similar to RAID Levels (20)

disk structure and multiple RAID levels .ppt
disk structure and multiple  RAID levels .pptdisk structure and multiple  RAID levels .ppt
disk structure and multiple RAID levels .ppt
 
Raid
RaidRaid
Raid
 
Data center core elements, Data center virtualization
Data center core elements, Data center virtualizationData center core elements, Data center virtualization
Data center core elements, Data center virtualization
 
raid technology
raid technologyraid technology
raid technology
 
Chapter 8 - Multimedia Storage and Retrieval
Chapter 8 - Multimedia Storage and RetrievalChapter 8 - Multimedia Storage and Retrieval
Chapter 8 - Multimedia Storage and Retrieval
 
Exercise 3-1 This chapter’s opening scenario illustrates a specific .docx
Exercise 3-1 This chapter’s opening scenario illustrates a specific .docxExercise 3-1 This chapter’s opening scenario illustrates a specific .docx
Exercise 3-1 This chapter’s opening scenario illustrates a specific .docx
 
RAID
RAIDRAID
RAID
 
CS 2212- UNIT -4.pptx
CS 2212-  UNIT -4.pptxCS 2212-  UNIT -4.pptx
CS 2212- UNIT -4.pptx
 
Dr module 3 assignment Management homework help.docx
Dr module 3 assignment Management homework help.docxDr module 3 assignment Management homework help.docx
Dr module 3 assignment Management homework help.docx
 
UNIT III.pptx
UNIT III.pptxUNIT III.pptx
UNIT III.pptx
 
RAID: High-Performance, Reliable Secondary Storage
RAID: High-Performance, Reliable Secondary StorageRAID: High-Performance, Reliable Secondary Storage
RAID: High-Performance, Reliable Secondary Storage
 
Raid Levels Technology
Raid Levels TechnologyRaid Levels Technology
Raid Levels Technology
 
SEMINAR
SEMINARSEMINAR
SEMINAR
 
Raid(Storage Technology)
Raid(Storage Technology)Raid(Storage Technology)
Raid(Storage Technology)
 
Raid and its levels
Raid and its levelsRaid and its levels
Raid and its levels
 
RAID
RAIDRAID
RAID
 
data recovery-raid
data recovery-raiddata recovery-raid
data recovery-raid
 
Storage systems reliability
Storage systems reliabilityStorage systems reliability
Storage systems reliability
 
Raid
Raid Raid
Raid
 
Raid in SNA
Raid in SNA Raid in SNA
Raid in SNA
 

More from A. S. M. Shafi (20)

2D Transformation in Computer Graphics
2D Transformation in Computer Graphics2D Transformation in Computer Graphics
2D Transformation in Computer Graphics
 
3D Transformation in Computer Graphics
3D Transformation in Computer Graphics3D Transformation in Computer Graphics
3D Transformation in Computer Graphics
 
Projection
ProjectionProjection
Projection
 
2D Transformation
2D Transformation2D Transformation
2D Transformation
 
Line drawing algorithm
Line drawing algorithmLine drawing algorithm
Line drawing algorithm
 
Fragmentation
FragmentationFragmentation
Fragmentation
 
File organization
File organizationFile organization
File organization
 
Bankers algorithm
Bankers algorithmBankers algorithm
Bankers algorithm
 
RR and priority scheduling
RR and priority schedulingRR and priority scheduling
RR and priority scheduling
 
Fcfs and sjf
Fcfs and sjfFcfs and sjf
Fcfs and sjf
 
Applications of stack
Applications of stackApplications of stack
Applications of stack
 
1D Array
1D Array1D Array
1D Array
 
2D array
2D array2D array
2D array
 
Stack push pop
Stack push popStack push pop
Stack push pop
 
Queue
QueueQueue
Queue
 
Searching
SearchingSearching
Searching
 
Sorting
SortingSorting
Sorting
 
Linked list
Linked listLinked list
Linked list
 
Sum of subset problem
Sum of subset problemSum of subset problem
Sum of subset problem
 
Quick sort
Quick sortQuick sort
Quick sort
 

Recently uploaded

GDSC ASEB Gen AI study jams presentation
GDSC ASEB Gen AI study jams presentationGDSC ASEB Gen AI study jams presentation
GDSC ASEB Gen AI study jams presentationGDSCAESB
 
Oxy acetylene welding presentation note.
Oxy acetylene welding presentation note.Oxy acetylene welding presentation note.
Oxy acetylene welding presentation note.eptoze12
 
pipeline in computer architecture design
pipeline in computer architecture  designpipeline in computer architecture  design
pipeline in computer architecture designssuser87fa0c1
 
Sachpazis Costas: Geotechnical Engineering: A student's Perspective Introduction
Sachpazis Costas: Geotechnical Engineering: A student's Perspective IntroductionSachpazis Costas: Geotechnical Engineering: A student's Perspective Introduction
Sachpazis Costas: Geotechnical Engineering: A student's Perspective IntroductionDr.Costas Sachpazis
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxJoão Esperancinha
 
Biology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptxBiology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptxDeepakSakkari2
 
Call Girls Narol 7397865700 Independent Call Girls
Call Girls Narol 7397865700 Independent Call GirlsCall Girls Narol 7397865700 Independent Call Girls
Call Girls Narol 7397865700 Independent Call Girlsssuser7cb4ff
 
Past, Present and Future of Generative AI
Past, Present and Future of Generative AIPast, Present and Future of Generative AI
Past, Present and Future of Generative AIabhishek36461
 
Application of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptxApplication of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptx959SahilShah
 
Software and Systems Engineering Standards: Verification and Validation of Sy...
Software and Systems Engineering Standards: Verification and Validation of Sy...Software and Systems Engineering Standards: Verification and Validation of Sy...
Software and Systems Engineering Standards: Verification and Validation of Sy...VICTOR MAESTRE RAMIREZ
 
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECHIntroduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECHC Sai Kiran
 
Arduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.pptArduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.pptSAURABHKUMAR892774
 
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidNikhilNagaraju
 
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfRisk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfROCENODodongVILLACER
 
Work Experience-Dalton Park.pptxfvvvvvvv
Work Experience-Dalton Park.pptxfvvvvvvvWork Experience-Dalton Park.pptxfvvvvvvv
Work Experience-Dalton Park.pptxfvvvvvvvLewisJB
 
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube ExchangerStudy on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube ExchangerAnamika Sarkar
 
Effects of rheological properties on mixing
Effects of rheological properties on mixingEffects of rheological properties on mixing
Effects of rheological properties on mixingviprabot1
 
What are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptxWhat are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptxwendy cai
 

Recently uploaded (20)

GDSC ASEB Gen AI study jams presentation
GDSC ASEB Gen AI study jams presentationGDSC ASEB Gen AI study jams presentation
GDSC ASEB Gen AI study jams presentation
 
Oxy acetylene welding presentation note.
Oxy acetylene welding presentation note.Oxy acetylene welding presentation note.
Oxy acetylene welding presentation note.
 
pipeline in computer architecture design
pipeline in computer architecture  designpipeline in computer architecture  design
pipeline in computer architecture design
 
Sachpazis Costas: Geotechnical Engineering: A student's Perspective Introduction
Sachpazis Costas: Geotechnical Engineering: A student's Perspective IntroductionSachpazis Costas: Geotechnical Engineering: A student's Perspective Introduction
Sachpazis Costas: Geotechnical Engineering: A student's Perspective Introduction
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
 
Biology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptxBiology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptx
 
Call Girls Narol 7397865700 Independent Call Girls
Call Girls Narol 7397865700 Independent Call GirlsCall Girls Narol 7397865700 Independent Call Girls
Call Girls Narol 7397865700 Independent Call Girls
 
Past, Present and Future of Generative AI
Past, Present and Future of Generative AIPast, Present and Future of Generative AI
Past, Present and Future of Generative AI
 
young call girls in Green Park🔝 9953056974 🔝 escort Service
young call girls in Green Park🔝 9953056974 🔝 escort Serviceyoung call girls in Green Park🔝 9953056974 🔝 escort Service
young call girls in Green Park🔝 9953056974 🔝 escort Service
 
Application of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptxApplication of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptx
 
Software and Systems Engineering Standards: Verification and Validation of Sy...
Software and Systems Engineering Standards: Verification and Validation of Sy...Software and Systems Engineering Standards: Verification and Validation of Sy...
Software and Systems Engineering Standards: Verification and Validation of Sy...
 
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECHIntroduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECH
 
Arduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.pptArduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.ppt
 
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfid
 
9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf
9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf
9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf
 
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfRisk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdf
 
Work Experience-Dalton Park.pptxfvvvvvvv
Work Experience-Dalton Park.pptxfvvvvvvvWork Experience-Dalton Park.pptxfvvvvvvv
Work Experience-Dalton Park.pptxfvvvvvvv
 
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube ExchangerStudy on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
 
Effects of rheological properties on mixing
Effects of rheological properties on mixingEffects of rheological properties on mixing
Effects of rheological properties on mixing
 
What are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptxWhat are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptx
 

RAID Levels

  • 1. RAID A variety of disk-organization techniques, collectively called redundant arrays of independent disks (RAID), have been proposed to achieve improved performance and reliability Improved reliability via redundancy:  Measured of the reliability of the disk is MTTF (Mean Time to Failure) which states that the amount of time that, on average, we can expect the system to run continuously without any failure.  The chance that some disk out of a set of N disks will fail is much higher than the chance that a specific disk will fail. Suppose that the MTTF of a disk is 100,000 hours or slightly over 11 years MTTF of some disk in an array of 100 disks will be 100,000/100 = 1000 hours or around 42 days, which is not long at all!  If it is stored only one copy of data, then each disk failure will result in loss of a significant amount of data. Such a high rate of data loss is unacceptable. The solution is to introduce redundancy – store extra information that is not needed normally, but that can be used in the event of failure of a disk to rebuild the lost information.  Approaches: The simplest but most expensive approach to introduce redundancy is to duplicate every disk. This technique is called mirroring or shadowing. Improved performance via parallelism: 1. With disk mirroring, the rate at which read requests can be handled is doubled, since read requests can be sent to either disk 2. The transfer rate of each read is the same as in a single disk system, but the number of reads per unit time is doubled. 3. With multiple disks we can improve the transfer rate by striping data (bit level striping or block level striping) across multiple disks.  In its simplest form, data striping consists of splitting the bits of each byte across multiple disks; such striping is called bit-level striping  Block-level striping stripes blocks across multiple disks. It treats the array of disks as a single large disk, and it gives blocks logical numbers; we assume the block numbers start from 0.
  • 2. RAID Levels:  Mirroring provides high reliability but it is expensive. Striping provides high data transfer rates, but does not improve reliability. So it requires redundancy at lower cost.  Various alternative schemes aim to provide redundancy at lower cost by combining disk striping with parity bits. These schemes have different cost-performance trade-offs. These schemes are classified into RAID levels as in Figure 1. (In the figure, P indicates error-correcting bits, and C indicates a second copy of the data.) For all levels, the figure depicts four disk’s worth of data, and the extra disks depicted are used to store redundant information for failure recovery. • RAID level 0 refers to disk arrays with striping at the level of blocks, but without any redundancy (such as mirroring or parity bits). • RAID level 1 refers to disk mirroring with block striping. • RAID level 2, known as memory-style error-correcting-code (ECC) organization, employs parity bits. Memory systems have long used parity bits for error detection and correction. RAID level 3, bit-interleaved parity organization, improves on level 2 by exploiting the fact that disk controllers, unlike memory systems, can detect whether a sector has been read correctly, so a single parity bit can be used for error correction, as well as for detection.
  • 3. RAID level 4, block-interleaved parity organization, uses block level striping, like RAID 0, and in addition keeps a parity block on a separate disk for corresponding blocks from N other disks. RAID level 5, block-interleaved distributed parity, improves on level 4 by partitioning data and parity among all N + 1 disks, instead of storing data in N disks and parity in one disk. RAID level 6, the P + Q redundancy scheme, is much like RAID level 5, but stores extra redundant information to guard against multiple disk failures. Instead of using parity, level 6 uses error-correcting codes such as the Reed–Solomon codes Choice of RAID Level The factors to be taken into account when choosing a RAID level are • Monetary cost of extra disk storage requirements • Performance requirements in terms of number of I/O operations • Performance when a disk has failed • Performance during rebuild (that is, while the data in a failed disk is being rebuilt on a new disk)