Académique Documents
Professionnel Documents
Culture Documents
After completing this chapter, you will be able to: Internal Disk subsystem structure Hard disk and internal I/O channels JBOD: Just a Bunch Of Disk Storage virtualization using RAID Different RAID levels Caching: Acceralaration of Hard Disk Access Intelligence and Availability of Disk Sub system
-2
Small storage device is replaced by large storage subsystem. Performance limitation of small storage device. An individual drive has a certain life expectancy
Measured in MTBF Example
If the MTBF of a drive is 750,000 hours, and there are 1000 drives in the array, then the MTBF of the array becomes 750,000 /1000, or 750 hours
-3
Storage consolidation. High Availability. High performance Instant copies Remote mirroring at reasonable price
-4
Disk subsystem visualized as hard disk server. Servers are connected to a disk subsystem using standard I/O techniques.
SCSI: Small computer system interface iSCSI: Internet SCSI Fibre Channel (SAN)
Storage Pooling: Free disk space can be flexibly assigned to each server connected.
-5
-6
The controller increase the data availability data access performance with RAID. facilitates copying services instant copy and remote mirroring. uses a cache in an attempt to accelerate read and write accesses to the server.
-7
All servers share the storage capacity of a disk subsystem. Each server can be assigned free storage more flexibly as required.
-8
-9
Size of the hard disk used limits the maximum capacity of the overall disk subsystem. Maximum Performance Vs Maximum capacity Maximum disk (C,I) More disk more load in terms of R/W operations and I/O channels Factors impacting disk sub system or individual disk:
Size Speed Cache I/O communication medium.
JBOD:
No internal controller. Only full enclosure of disks Normally 8 to 16 hard disk space. Every hard disk has a separate address space Does not support RAID or any other virtualization
Intelligent Disk Subsystem
15
Individual hard disk are slow and has less life expectancy. Stripping: Increases performance by stripping and Mirroring: Improves fault tolerance by redundancy. Parity: Provides data integrity RAID provides:
Increase capacity Higher availability Increased performance
Physical Array
Logical Array
RAID Controller
Hard Disks
RAID Controller
Software
Runs as part of the operating system Performance is dependent on CPU workload Does not support all RAID levels
0 Striped array with no fault tolerance 1 Disk mirroring with fault tolerance Nested RAID (i.e., 1 + 0, 0 + 1) 3 Parallel access array with dedicated parity disk 4 Striped array with independent disks and a dedicated parity disk 5 Striped array with independent disks and distributed parity 6 Striped array with independent disks and dual distributed parity
Intelligent Disk Subsystem
20
Stripe
Strip
Stripe=192KB
Strip 1=64KB
Strip 2=64KB
Strip 3=64KB
Stripe 1 Stripe 2
Strips
Intelligent Disk Subsystem
21
1 5 9 RAID Controller
2 6 10
3 7 11
Host
Block 0 1
Host
RAID 1
Block 1 Block 4
Block 3 0
RAID 0
Host
Block 5
RAID 1
Block 1 Block 4
Block 2 Block 5
Block 5
RAID 0
1 Block 2
Block 4 5 RAID Controller 1 Block 2
Host RAID 1
Block 3 0
Block 4 5
RAID 0
Block 2 Block 5
Block 2 Block 5
Block 4
4
1 6 5 9 RAID Controller
1 ?
Host
3 7 7 11 0123 4 518 67
4 + 6 + ? + 7 = 18 ? = 18 4 6 7 ?=1
Parity Disk Intelligent Disk Subsystem
28
Block
Host
Block 0 Block 4 Block 1 Block 5 Parity RAID0 Block Generated Controller P0123 Block 3
Host
Block 0
Block 2
Block 6
Block 0 Block 4 Block 1 Block 5 Parity RAID4 Block 0 Generated Controller P4 05 16 27 3 Block 3
Host
Block 2
Block 6
Block 0 4
Two disk failures in a RAID set leads to data unavailability and data loss in single-parity schemes, such as RAID-3, 4, and 5 Increasing number of drives in an array and increasing drive capacity leads to a higher probability of two disks failing in a RAID set RAID-6 protects against two disk failures by maintaining two parities
Even-Odd, and Reed-Solomon are two commonly used algorithms for calculating parity in RAID-6
Horizontal parity which is the same as RAID-5 parity Diagonal parity is calculated by taking diagonal sets of data blocks from the RAID set members
RAID Comparison
RAID Min Disks Storage Efficiency % Cost Read Performance
Very good for both random and sequential read
Write Performance
100
Low
Very good
50 (n-1)*100/n where n= number of disks (n-1)*100/n where n= number of disks (n-2)*100/n where n= number of disks
High
Good Slower than a single disk, as every write must be committed to two disks Poor to fair for small random writes Good for large, sequential writes Fair for random write Slower due to parity overhead Fair to good for sequential writes Good for small, random writes (has write penalty)
Moderate
Good for random reads and very good for sequential reads Very good for random reads Good for sequential reads Very good for random reads Good for sequential reads
4 5
Moderate
50
High
Very good
Good
RAID Comparison
RAID Controller
Ep new
Ep old
2 XOR
E4 old
E4 new
P0
D1
D2
D3
D4
Ep = E1 + E2 + E3 + E4 (XOR operations) If parity is valid, then: Ep new = Ep old E4 old + E4 new (XOR operations)
Parity Vs Mirroring
Reading, calculating and writing parity segment introduces penalty to every write operation Parity RAID penalty manifests due to slower cache flushes Increased load in writes can cause contention and can cause slower read response times
Intelligent Disk Subsystem
35
Total IOPS at peak workload is 1200 Read/Write ratio 2:1 Calculate IOPS requirement at peak activity for
RAID 1/0 RAID 5
Key points covered in this chapter: What RAID is and the needs it addresses The concepts upon which RAID is built Some commonly implemented RAID levels
What is a RAID array? What benefits do RAID arrays provide? What methods can be used to provide higher data availability in a RAID array? What is the primary difference between RAID 3 and RAID 5? What is advantage of using RAID 6? What is a hot spare?