Professional Documents
Culture Documents
HDD performance
HDD
Service time
Exercise 1
• 10240*6.61ms = 67.6864s
• Other approach:
• 10240 * (1-0.35) * 10.11ms + 10240 * 0.35 * 0.11 ms =
67.6864s
Computing Infrastructure
RAID disks
RAID levels
RAID y n
RAID x
RAID 0, 1, 0+1 and 1+0 organizations
RAID 0 RAID 1
RAID 0+1 RAID 1
A1 A2 A1 A1 RAID 0 RAID 0
A3 A4 A2 A2
A1 A2 A3 A1 A2 A3
A5 A6 A3 A3
A4 A5 A6 A4 A5 A6
A7 A8 A4 A4
B1 B2 B3 B1 B2 B3
A1 A1 A2 A2 A3 A3
A1, B1,... data blocks
A4 A4 A5 A5 A6 A6
B1 B1 B2 B2 B3 B3
B4 B4 B5 B5 B6 B6
RAID 4, 5, 5+0
RAID 4 RAID 5
A1 A2 A3 Ap A1 A2 A3 Ap
B1 B2 B3 Bp B1 B2 Bp B3
C1 C2 C3 Cp C1 Cp C2 C3
D1 D2 D3 Dp Dp D1 D2 D3
A1 A2 Ap A3 A4 Ap A5 A6 Ap
B1 Bp B2 B3 Bp B4 B5 Bp B6
Cp C1 C2 Cp C3 C4 Cp C5 C6
D1 D2 Dp D3 D4 Dp D5 D6 Dp
RAID 6 organization
RAID 6
A1 A2 A3 Ap Aq
A1, B1,... are data blocks
Ap, Aq,... are parity blocks B1 B2 Bp Bq B3
C1 Cp Cq C2 C3
Dp Dq D1 D2 D3
NO redundancy
RAID 0
required? YES
§ fast read/write
§ low reliability
§ high-perf computing (speed and
capacity are more important than
reliability)
YES duplication
RAID 1
required?
§ small write random
§ high reliability
§ database appl. (high NO § random small
transaction rate) RAID 5 read/write
§ only 50% of the capacity § medium reliability
(high cost)
RAID 6 § Fault tolerance with
two failures
characteristics of RAID levels (3)
t
−
FX (t) = 1− e MTTF
n
F min( X1... Xn ) (t) = 1− (1− FX (t))
(Why exponential distribution, and why the minimum has this formula will
proven in the availability part of the course)
MTTF – Minimum failure time of n disks (2)
n
" " −
t %% −
n⋅t
F min( X1... Xn ) (t) = 1− $$1− $1− e MTTF
''' = 1− e MTTF
# # &&
§ Maclaurin series
§ Usually we have:
n⋅t
F min( X1... Xn ) (t) ≅
MTTF
MTTF – MTTDL of n disks
n⋅t
−
F min( X1... Xn ) (t) = 1− e MTTF
MTTF
E !" F min( X1... Xn ) (t)#$ =
n
§ In other words, the MTTDL of n disks, is equal to the MTTF of
one disk, divided by n.
Exercise 2: MTTDL of an array RAID0
MTTF
MTTDL =
n MTTR = 1
3000
2500
2000
MTTDL
Exact N = 4
1500
Exact N = 5
Exact N = 6
1000
500
0
0 2000 4000 6000 8000 10000 12000
MTTF
Exercise 3: MTTDL of an array RAID1
The system fails if there is a second failure when the first resource has
failed and is under repair.
We can approximate the failure probability of the first disk as:
st 2
P(1 fail) =
MTTF
And compute the failure probability of the entire RAID 1 as:
st nd 2 MTTR
P(RAID1) = P(1 fail)⋅ P(2 fail < MTTR) = ⋅
MTTF MTTF
Finally we can approximate the MTTDL as:
1 MTTF 2
MTTDL = =
P(RAID1) 2 ⋅ MTTR
Exercise 3: MTTDL of an array RAID1 (2)
MTTF n
MTTDL =
n ⋅ MTTR n−1
MTTR = 1
1E+10
1E+09
100000000
10000000
1000000
100000
MTTDL
N=2 Exact
10000 N=2 Approx
10
1
1 10 100 1000 10000
0,1
0,01
0,001
MTTF
Exercise 4: MTTDL of an array RAID 1+0
In RAID1+0, the second fault causes data loss only if it happens for the
mirror disk of the one already broken.
Here we consider 8 groups (RAID 0) of 2 disks each (RAID 1), for a total
of 16 disks.
1000000
MTTR = 1
100000
10000
1000
N=8 Exact
MTTDL
0,01
0,001
0,0001
MTTF
Exercise 5: MTTDL of an array RAID 0+1
In RAID1+0, the second fault causes data loss only if it happens for any
of the disk of the other group.
10000000 MTTR = 1
1000000
100000
10000
N=8 Exact
MTTDL
0,01
0,001
MTTF
RAID 1+0 and RAID 0+1 comparison
• RAID 1+0 has MTTDL that is 6250/781 = 8 times larger than the
RAID 0+1
• However, as we have seen, RAID 0+1 can be simpler to
implement, and this is why sometimes it is used.
Failures in RAID 5
st nd G (G −1)⋅ MTTR
P(RAID5) = P(1 fail)⋅ P(2 fail < MTTR) = ⋅
MTTF MTTF
1 MTTF 2
MTTDL = =
P(RAID5) G ⋅ (G −1)⋅ MTTR
Failures in RAID 6
Similarly, for RAID 6, where two disks must fail before the repair of
the first distk, we have:
P(RAID6) = P(1st fail)⋅ P(2 nd fail < MTTR)⋅ P(3rd fail < MTTR / 2) =
G (G −1)⋅ MTTR (G − 2)⋅ MTTR
= ⋅ ⋅
MTTF MTTF 2 ⋅ MTTF
§ We have to use MTTR/2 since during the 3rd failure, there are
two disks being repaired, and thus we have to consider the
minimum of the two.
3
1 2 ⋅ MTTF
MTTDL = = 2
P(RAID6) G ⋅ (G −1)⋅ (G − 2)⋅ MTTR
Exercise 6: MTTDL of a RAID5 and RAID6
1000 2
MTTDLRAID5 = = 5000 days
5⋅ 4 ⋅10
2 ⋅1000 3
MTTDLRAID6 = 2
= 166667 days
6 ⋅ 5⋅ 4 ⋅10
§ RAID6 has an MTTDL more than 33.3 times larger than RAID5 !
M. Gribaudo
RAID 5
MTTF 2
MTTDL =
n ⋅ (n −1)⋅ MTTR
1000000 MTTR = 1
100000
10000
1000
N=4 Exact
MTTDL
0,01
0,001
0,0001
MTTF
M. Gribaudo
RAID 6
2 ⋅ MTTF 3
MTTDL =
n ⋅ (n −1)⋅ (n − 2)⋅ MTTR 2
MTTR = 1
1E+09
100000000
10000000
1000000
100000
10000 N=5 Exact
MTTDL
2 ⋅ MTTF 3
MTTDLRAID6 =
4 ⋅ 3⋅ 2 ⋅ MTTR 2
MTTF 2
MTTDLRAID1+0 =
4 ⋅ MTTR
MTTDLRAID6 MTTF
= RAID 6 is better if MTTF > 3 * MTTR
MTTDLRAID1+0 3⋅ MTTR
Recap - RAID 4, 5, 5+0
RAID 4 RAID 5
A1 A2 A3 Ap A1 A2 A3 Ap
B1 B2 B3 Bp B1 B2 Bp B3
C1 C2 C3 Cp C1 Cp C2 C3
D1 D2 D3 Dp Dp D1 D2 D3
A1 A2 Ap A3 A4 Ap A5 A6 Ap
B1 Bp B2 B3 Bp B4 B5 Bp B6
Cp C1 C2 Cp C3 C4 Cp C5 C6
D1 D2 Dp D3 D4 Dp D5 D6 Dp
MTTDL of an array RAID 5+0
MTTF 2
MTTDLgroup G ⋅ (G −1)⋅ MTTR MTTF 2
MTTDLarray = = =
m N N ⋅ (G −1)⋅ MTTR
G
MTTDL of an array RAID 6+0
If the number of parity disks per group are two (RAID 6+0, the data are lost
when a third disk fails during the repair interval of the first two failed), also
the second fail must happen in the same group.
We can apply the same trick used for the RAID 5+0 to compute the MTTDL
of a RAID 6+0:
2 ⋅ MTTF 3
MTTDLarray =
N ⋅ (G −1)⋅ (G − 2)⋅ MTTR 2
Exercise 9: MTTDL of an array RAID 5 + 0
RAID 5
…
RAID 5 RAID 5
A1 A2 Ap A1 A2 Ap A1 A2 Ap
B1 Bp B2 B1 Bp B2 B1 Bp B2
…
…
…
Cp C1 C2 Cp C1 C2 Cp C1 C2
D1 D2 Dp D1 D2 Dp D1 D2 Dp
1000 2
MTTDLRAID5 = = 1000 days
25⋅ 4 ⋅10
M. Gribaudo
RAID 5+0
MTTF 2
MTTDL =
n ⋅ (g −1)⋅ MTTR
1000000
MTTR = 1
100000
10000
1000
N=15 Exact
MTTDL
0,01
0,001
0,0001
MTTF
Exercise 10: comparison between RAID 5 and RAID 5+0
§ Thus, the extra 4 disks allows a MTTDL that is more than four
times larger:
§ MTTDL(RAID 6) / MTTDL(RAID 5) =
2((k-1) x MTTF) / ((2k-1) x (2k-2) ´ MTTR)