Cache-Oblivious Algorithms (Extended Abstract) (1999)
Cached
Download Links
- [www-static.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [supertech.csail.mit.edu]
- [ocw.mit.edu]
- [theory.lcs.mit.edu]
- [www.fftw.org]
- [supertech.lcs.mit.edu]
- [www.daimi.au.dk]
- [www.daimi.au.dk]
| Venue: | In Proc. 40th Annual Symposium on Foundations of Computer Science |
| Citations: | 10 - 1 self |
BibTeX
@INPROCEEDINGS{Frigo99cache-obliviousalgorithms,
author = {Matteo Frigo and Charles E. Leiserson and Harald Prokop and Sridhar Ramachandran and Z W(l},
title = {Cache-Oblivious Algorithms (Extended Abstract)},
booktitle = {In Proc. 40th Annual Symposium on Foundations of Computer Science},
year = {1999},
pages = {285--397},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents asymptotically optimal algorithms for rectangular matrix transpose, FFT, and sorting on computers with multiple levels of caching. Unlike previous optimal algorithms, these algorithms are cache oblivious: no variables dependent on hardware parameters, such as cache size and cache-line length, need to be tuned to achieve optimality. Nevertheless, these algorithms use an optimal amount of work and move data optimally among multiple levels of cache. For a cache with size Z and cache-line length L where Z = W(L 2 ) the number of cache misses for an m \Theta n matrix transpose is Q(1 +mn=L). The number of cache misses for either an n-point FFT or the sorting of n numbers is Q(1+ (n=L)(1 + log Z n)). We also give an Q(mnp)-work algorithm to multiply an m \Theta n...
