Slides - Stanford PPL - Stanford University

Analytical Guarantees
! Vantage can be completely characterized using analytical
models
F
A
E
1
,..., E
R
~ i.
i.
d.
A = max{ E
1
,..., E
U[0,1]
R
( x)
= P(
A " x)
= x , x ![0,1
]
A = 1 mgd
R ! m
R
}
C " i k
=
"
P
C S
k
1
R ! m
# We can prove that strict guarantees are kept on partition
sizes and interference independently of workload
$ The paper has too much math to describe it here
! We now focus on the intuition behind the math
A
???
i
P
#" S
i=
0
i
k = 1
!
1
A
max
1
R
P
= 1
i
S
k
…
12