For Example...

We win if hf > K

Suppose K is bigger than f
Buf 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