DocumentCode
1924257
Title
Cache-Oblivious Computation: Algorithms and Experimental Evaluation
Author
Ramachandran, Vijaya
Author_Institution
Dept. of Comput. Sci., Texas Univ., Austin, TX
fYear
2007
fDate
5-7 March 2007
Firstpage
20
Lastpage
26
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
Keywords
algorithm theory; cache storage; dynamic programming; graph theory; cache-oblivious computation; dynamic program computation; graph theory; shortest path problem; triply-nested loop computation; Algorithm design and analysis; Application software; Computer applications; Costs; Delay; Dynamic programming; Partitioning algorithms; Registers; Shortest path problem; Size measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing: Theory and Applications, 2007. ICCTA '07. International Conference on
Conference_Location
Kolkata
Print_ISBN
0-7695-2770-1
Type
conf
DOI
10.1109/ICCTA.2007.34
Filename
4127337
Link To Document