Cache-Oblivious Computation: Algorithms and Experimental Evaluation

I
ICCTA
2007
International Conference on Computing: Theory and Applications (ICCTA'07)
Abstract - Cache-Oblivious Computation: Algorithms and Experimental Evaluation

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Vijaya Ramachandran

International Conference on Computing: Theory and Applications (ICCTA'07)

Kolkata, India

March 05-March 07

ISBN: 0-7695-2770-1

	ASCII Text	x
	Vijaya Ramachandran, "Cache-Oblivious Computation: Algorithms and Experimental Evaluation," International Conference on Computing: Theory and Applications, pp. 20-26, International Conference on Computing: Theory and Applications (ICCTA'07), 2007.

	BibTex	x
	@article{ 10.1109/ICCTA.2007.34, author = {Vijaya Ramachandran}, title = {Cache-Oblivious Computation: Algorithms and Experimental Evaluation}, journal ={International Conference on Computing: Theory and Applications}, volume = {0}, year = {2007}, isbn = {0-7695-2770-1}, pages = {20-26}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICCTA.2007.34}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - International Conference on Computing: Theory and Applications TI - Cache-Oblivious Computation: Algorithms and Experimental Evaluation SN - 0-7695-2770-1 SP20 EP26 A1 - Vijaya Ramachandran, PY - 2007 KW - null VL - 0 JA - International Conference on Computing: Theory and Applications ER -

Vijaya Ramachandran, University of Texas at Austin, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCTA.2007.34

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.