Code generators for automatic tuning of Numerical Kernels: Experiences with FFTW position paper

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1924, Issue , 2000, Pages 190-211

  Vuduc, Richard ^a   Demmel, James W ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; AUTOMATIC PROGRAMMING; COSINE TRANSFORMS; DISCRETE COSINE TRANSFORMS; DISCRETE FOURIER TRANSFORMS; MATRIX ALGEBRA; SEMANTICS;

AUTOMATIC TUNING; CODE GENERATORS; DENSE MATRICES; EMPIRICAL EVALUATIONS; PEAK PERFORMANCE; POSITION PAPERS; SPARSE MATRIX-VECTOR MULTIPLICATION; TUNING SYSTEM;

CODES (SYMBOLS);

EID: 65249097463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45350-4_14     Document Type: Conference Paper

References (28)

1. Millennium: An hierarchical campus-wide cluster of clusters (home page). http://www.millennium.berkeley.edu.
2. Independent JPEG Group Reference Implementation, May 2000. http://www.ijg.org.
3. G. Bi. DCT algorithms for composite sequence lengths. IEEE Transactions on Signal Processing, 46(3):554–562, March 1998.
4. J. Bilmes, K. Asanović, C. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: a Portable, High-Performance, ANSI C coding methodology. In Proceedings of the International Conference on Supercomputing,V ienna, Austria, July 1997.
5. J. Bilmes, K. Asanović, J. Demmel, D. Lam, and C. Chin. The PHiPAC WWW home page. http://www.icsi.berkeley.edu/~bilmes/phipac.
6. S. Blackford, G. Corliss, J. Demmel, J. Dongarra, I. Duff, S. Hammarling, G. Henry, M. Heroux, C. Hu, W. Kahan, L. Kaufman, B. Kearfott, F. Krogh, X. Li, Z. Maany, A. Petitet, R. Pozo, K. Remington, W. Walster, C. Whaley, and J.W. von Gudenberg. Document for the Basic Linear Algebra Subprograms (BLAS) standard: Blas technical forum. http://www.netlib.org/cgi-bin/checkout/blast/blast.pl.
7. L.-P. Chau and W.-C. Siu. Recursive algorithm for the discrete cosine transform with general lengths. Electronic Letters, 30(3):197–198, February 1994.
8. J.W. Cooley and J.W. Tukey. An algorithm for the machine calculation of complex fourier series. Mathematics of Computation, 19:297–301, April 1965.
9. R. E. Crochiere and A. V. Oppenheim. Analysis of digital linear networks. In Proceedings of the IEEE, volume 63, pages 581–595, April 1975.
10. J. Dongarra, J. D. Croz, I. Duff, and S. Hammarling. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Soft., 16(1):1–17, March 1990.
11. J. Dongarra, J. D. Croz, I. Duff, S. Hammarling, and R. J. Hanson. An extended set of Fortran basic linear algebra subroutines. ACM Trans. Math. Soft., 14(1):1–17, March 1988.
12. E. Elmroth and F. Gustavson. Applying recursion to serial and parallel QR factorization leads to better performance. IBM Journal of Research and Development, 44(1), January 2000. http://www.cs.umu.se/~elmroth/papers/eg99.ps.
13. M. Frigo. A fast Fourier transform compiler. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, May 1999.
14. M. Frigo and S. Johnson. FFTW: An adaptive software architecture for the FFT. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, May 1998.
15. F. Gustavson. Recursion leads to automatic variable blocking for dense linear algebra algorithms. IBM Journal of Research and Development, 41(6), November 1997. http://www.research.ibm.com/journal/rd/416/gustavson.html.
16. G. Henry. Linux libraries for 32-bit Intel Architectures, March 2000. http://www.cs.utk.edu/~ghenry/distrib.
17. E.-J. Im and K. Yelick. Optimizing sparse matrix vector multiplication on SMPs. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, March 1999.
18. C. Lawson, R. Hanson, D. Kincaid, and F. Krogh. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Soft., 5:308–323, 1979.
19. P. Z. Lee. Restructured recursive DCT and DST algorithms. IEEE Transactions on Signal Processing, 42(7), July 1994.
20. P. Z. Lee and F.-Y. Huang. An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementation. IEEE Transactions on Signal Processing, 42(8):1996–2005, August 1994.
21. C. Loeffler, A. Ligtenberg, and G. Moschytz. Practical fast 1-D DCT algorithms with 11 multiplications. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, volume 2, pages 988–991, May 1989.
22. D. P. K. Lun. On efficient software realization of the prime factor discrete cosine transform. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, volume 3, pages 465–468, April 1994.
23. A. Oppenheim and R. Schafer. Discrete-time Signal Processing. Prentice-Hall, 1999.
24. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, 1992. http://www.nr.com.
25. K. R. Rao and P. Yip. Discrete Cosine Transform: Algorithms,A dvantages, Applications. Academic Press, Inc., 1992.
26. J. Siek and A. Lumsdaine. The Matrix Template Library: A generic programming approach to high performance numerical linear algebra. In Proceedings of the International Symposium on Computing in Object-Oriented Parallel Environments, December 1998.
27. P. Swarztrauber. FFTPACK User’s Guide, April 1985. http://www.netlib.org/fftpack.
28. S. Toledo. Locality of reference in LU decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications, 18(4), 1997. http://www.math.tau.il/~sivan/pubs/029774.ps.gz.