this is for holding javascript data
Henri van den Bulk edited Problem 3.tex
over 9 years ago
Commit id: e8900fbac031a4a11d55e0e373eb4d6f368589f8
deletions | additions
diff --git a/Problem 3.tex b/Problem 3.tex
index 0b07d04..9df9b37 100644
--- a/Problem 3.tex
+++ b/Problem 3.tex
...
\subsection{Problem 3}
With a $s$ factor or 3.5 the memory performance increases to 50\% of the new latency or $CPU_time$. Using absolute execution times, Amdahl's law is in terms of $L_{new}$, the execution time after an improvement; , $L_{memory}$ the execution time affected by the improvement; $s$, how many times faster the improved part runs, or its speedup; and
$L_{unaffected}, $L_{unaffected}$, the execution time unaffected by the improvement. In these terms, Amdahl's Law states that:
\begin{displaymath}{L_{new}=\frac{L_{memory}}{s} + L_{unaffected}}\end{displaymath}
If we assume that $L_{new} = 100$ then based on the given that the new memory latency is 50\%, then that would imply that $L_{unaffected} = 50$. Using these numbers in the Amdahl's law we get the following:
\begin{displaymath}{100=\frac{L_{memory}}{3.5} + 50}\end{displaymath}
Solving for $L_{memory}$ would result in it being 175. This will then give us a total $L_{old} = 175 + 50 = 224$. Now we can calculate the percentage that $L_{memory}$ is of the original latency:
$\frac{175}{225) * 100 = 77.77\%$