| September 10, 2001 | Quantitative Analysis of Memoization | Slide #10 |
We win if hf > K
Suppose K is bigger than f
But hf is smaller than f
We lose!
We can tolerate large cache management overhead...
But only if the function takes a really long time
If f is real big, it's easier to get a win
In spite of a big K
| Next | |
Copyright © 2001 M-J. Dominus |