A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Brief announcement
2014
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14
Preserved Fulltext
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.
doi:10.1145/2612669.2612707
dblp:conf/spaa/AgrawalF14
fatcat:shagoqro7fa4lhs5zd2j67oxca