Algorithms to take advantage of hardware prefetching

Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2007, Pages 91-98

  Pan, Shen ^a   Cherng, Cary ^b   Dick, Kevin ^c   Ladner, Richard E ^d  

^a AMAZON   (United States)

^b GOOGLE INC   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^d University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUFFER STORAGE; DYNAMIC PROGRAMMING; FAST FOURIER TRANSFORMS;

CACHE-AWARE ALGORITHMS; CACHE-OBLIVIOUS; HARDWARE PREFETCHING;

PROGRAM PROCESSORS;

EID: 34547953706     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972870.9     Document Type: Conference Paper

References (13)

1. C. Cherng and R. E. Ladner, Cache efficient simple dynamic programming, Proceedings of the International Conference on the Analysis of Algorithms, 2005, pp. 49-58.
2. R. A. Chowdhury and V. Ramachandran, Cacheoblivious dynamic programming, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 591-600.
3. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, MIT Press, 2nd ed., 2001.
4. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms, Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), 1999, pp. 17-18.
5. M. E. Furman, Application of fast multiplication of matrices in the problem of finding the transitive closure of a graph, Dokl. Akad Nauk SSSR, 194:524 (Russian), Soviet Math. Dokl., 11(5):1252, 1970.
6. Intel 64 and IA-32 Architectures Software Developer's Manual, Volume SB, http://www.intel.com/design/ proc essor/manuals/253669.pdf.
7. G. Hinton, D. Sager, M. Upton, D. Boggs, D. Carmean, A. Kyker, and P. Roussel, The Microarchitecture of the Pentium 4 Processor, http://www.intel.com/.
8. T. Kasami, An efficient recognition and syntax algorithm for context-free languages, Scientific Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Mass., 1965.
9. I. Munro, Efficient determination of the transitive closure of a directed graph, Information Processing Letters, l(2):56-58, 1971.
10. J.-S. Park, M. Penner and V. K. Prasanna, Optimizing graph algorithms for improved cache performance, IEEE Transactions on Parallel and Distributed Systems, vol. 15(9), pp. 769-782, 2004.
11. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C: The Art of Scientific Computing, Second Edition, Cambridge University Press, Cambridge, UK, 1992.
12. L. G. Valiant, General context-free recognition in less than cubic time, Journal of Computer and Systems Sciences, 10:308-315, 1975.
13. 3, Information and Control, 10(2):189-208, 1967.