diff --git a/chapters/part4/algorithmic_analysis/index.html b/chapters/part4/algorithmic_analysis/index.html index 8abfe575..f0127e27 100644 --- a/chapters/part4/algorithmic_analysis/index.html +++ b/chapters/part4/algorithmic_analysis/index.html @@ -17,7 +17,7 @@

Distributed File System

-

Imagine the task of loading a large file from your computer at Stanford, over the interet. Your file is stored in a distributed file system. In a distributed file system, the closest instance of your file might be on one of several computers at different locations in the world. Imagine you know the probability that the file is in one of a few locations $l$: $\P(L=l)$, and for each location the expected time, $T$, to get the file, $\E[T|L=l]$, given it is in that location:

+

Imagine the task of loading a large file from your computer at Stanford, over the internet. Your file is stored in a distributed file system. In a distributed file system, the closest instance of your file might be on one of several computers at different locations in the world. Imagine you know the probability that the file is in one of a few locations $l$: $\P(L=l)$, and for each location the expected time, $T$, to get the file, $\E[T|L=l]$, given it is in that location:

@@ -90,4 +90,4 @@

Proof of Law of Total Expectation

&= \sum_x x \sum_y  P(X =x , Y = y)  \\ &= \sum_x x P(X =x)  \\ &= E[X]\end{align*} - \ No newline at end of file +
Location$P(L = l)$$\E[T| L = l]$