loading...
Cache-Oblivious Computation: Algorithms and Experimental Evaluation
Kolkata, India March 05-March 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCTA.2007.34International Conference on Computing ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Vijaya Ramachandran, University of Texas at Austin, USA
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.
Citation:
Vijaya Ramachandran, "Cache-Oblivious Computation: Algorithms and Experimental Evaluation," iccta, pp.20-26, International Conference on Computing: Theory and Applications (ICCTA'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.