Politecnico di Milano

EECS Dept.
Course 095897 - Computing Infrastructures
M. Gribaudo
List of formulas for the exam
Table V. AVAILABILITY: VARIABLES
Disclaimer: this document is intended as a sup-
port to the exam. It should not replace the study. No Variable Definition
guarantee is given on the correctness of the formulas λ Failure rate
contained: we assume no responsibility for errors R(t) Reliability
that might occur in the exam due to mistakes in this A
MT T F
Availability
Mean Time to Failure
document. However we did our best to ensure the MT T R Mean Time to Repair
correctness of the material here included.
Do not take notes on this document. Table VI. AVAILABILITY: RELATIONS

Table I. P ERFORMANCE : VARIABLES Relations

Variable Definition R(t) = 1 −

QF (t)
RSer. (t) =Q Ri (t)
T length of an observation interval RP ar. (t) = 1 − (1 − Ri (t))
B Busy time
C Number of completions MT T F
A=
A Number of arrivals M T T F +M T T R

N number of users A·M T T R

MT T F = 1−A
U utilization
Z average think time of a user MT T R =
(1−A)M T T F
A
X system throughput
λ arrival rate Q
ASer. =Q Ai
S service time
R system response time AP ar. = 1 − (1 − Ai )

Xk , U k measure for resource k For exponential failure/repair time distributions

Sk , Rk − t
R(t) = e M T T F = e−λt
λ = 1/M T T F

Non-repairable identical components

Table II. P ERFORMANCE : RELATIONS 1 MT T F
M T T FSer.
P= N ·λ = N
1 N 1
PN 1
Relations M T T FP ar. = λ i = MT T F
i=1 i=1 i

A
λ= T Non-repairable components with different MTTF
C
X = T M T T FSer. = P1 = P 11
Bk λi
Uk = M T T Fi
T 1
Bk M T T FP ar.(2) = M T T F1 + M T T F2 − 1 1
Sk = Ck M T T F1
+
M T T F2
Bk
Dk = C
X = λ if stable Repairable components
M T T FSer. = P1 = P 1
1
λi
M T T Fi
1
M T T RP ar. = P 1
M T T Ri
Table III. P ERFORMANCE : LAWS

Law Definition
C
Visits Vk = Ck
Demand Dk = Vk Sk
Utilization Uk = Xk Sk = XDk
Little’s N k = Xk R k
N
Response time R= X −Z
Forced flow Xk = XVk
Queue time Rk − D k

P
Denoted D = Dk :
Table IV. P ERFORMANCE : BOUNDS

Bounds Open Closed

Resp. Time R≥D max(D, N Dmax − Z) ≤ R ≤ N D

1 N 1 N
Throughput X ≤ Dmax N D+Z ≤ X ≤ min Dmax , D+Z
N∗ N∗ = D+Z
Dmax
 Table VII. RAID: VARIABLES

Variable Definition
MT T F Mean Time to Failure
MT T R Mean Time to Repair
M T T DL Mean Time to Data Loss
N Number of disks in the array
G Number of disks in a group

Table VIII. RAID: AVAILABILITY

Relations
M T T DLRAID0 = M TNT F
MT T F 2
M T T DLRAID1 = 2·M TTR
TTF2
M T T DLRAID1+0 = NM·M TTR
TTF2
M T T DLRAID0+1 = 2·M
2 N ·M T T R
MT T F 2
M T T DLRAID5 = G·(G−1)·M T T R
2·M T T F 3
M T T DLRAID6 =
G·(G−1)·(G−2)·M T T R2
MT T F 2
M T T DLRAID5+0 = N ·(G−1)·M T T R
2·M T T F 3
M T T DLRAID6+0 =
N ·(G−1)·(G−2)·M T T R2

Table IX. RAID PARITY: VARIABLES

Variable Definition
Di Data on i-th disk (0 ≤ i < N )
P Parity data
Q Second Parity data
g Parity generator Table XIV. V IRTUALIZATION

Variable Definition
Table X. RAID 5 AND 6 PARITY P Tp Execution time on PM
PN −1 pp Fraction of privileged instructions
Parity Computation P = Di op Overhead of privileged instr.
i=0
Tv Execution time on VM
Tv = Tp (1 + pp · op )
Table XI. RAID 6 PARITY Q
PN −1
Parity Computation Q= g i Di
i=0

Table XII. D ISKS : VARIABLES

Variable Definition
Ts Mean seek time
Tt Mean transfer time (for one block)
B Block size
rt Transfer rate
Tl Rotational latency time
rr Rotational speed
Tc Controller overhead
Tb Mean service time (for one block)
Ta Mean service time (for one file)
F File size
l data locality

Table XIII. D ISK : RELATIONS

Relations
Tb = Ts + Tl + Tt + Tc
1
Tl = 2·r r
Tt = rB
t
Ta = dF/Be · Tb ?
◦
Ta = dF/Be · [Tt + Tc + (1 − l)(Ts + Tl )]
?
for one file, without locality
◦
for one file, with locality