Cache-oblivious scheduling of streaming pipelines
Kunal Agrawal, Jeremy T. Fineman · 2014
This paper considers the problem of cache-obliviously scheduling streaming pipelines on uniprocessors with the goal of minimizing cache misses. Our recursive algorithm is not parameterized by cache size, yet it achieves the asymptotically minimum number of cache misses with constant factor memory augmentation.