Sequential and Parallel Performance III
Interesting point about swapping time is that it is independent of L except for the factor (1-2L) which is a factor of two increase from L=1 to largest L
After spending this time, one can then do “in-cache” computations even in an iterative algorithm
Computations are larger by a factor L (roughly log of Cache Size) compared to cost of re-ordering