Cache-Oblivious Computation: Algorithms and Experimental Evaluation

Abstract

We describe our recent research results on cache-oblivious algorithms for certain types of dynamic programs and triply-nested loop computations, and for priority queues and their application in shortest path problems in graphs. We present some preliminary results from our ongoing experimental work on comparing our cache-oblivious algorithms to currently available code for these problems. Our results demonstrate that cache-oblivious methods can give rise to efficient algorithms both in theory and in practice