Hardware-oriented implementation of cache oblivious matrix operations based on space-filling curves

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

Volumn 4967 LNCS, Issue , 2008, Pages 628-638

  Bader, Michael ^a   Franz, Robert ^a   Günther, Stephan ^a   Heinecke, Alexander ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CURVE FITTING; CURVES (ROAD); MICROFLUIDICS; RECURSIVE FUNCTIONS; STANDARDS; STATISTICS;

APPLIED MATHEMATICS; CACHE-OBLIVIOUS; HEIDELBERG (CO); HIGH PERFORMANCE; INTERNATIONAL CONFERENCES; L U DECOMPOSITION; LEVEL-1; MATRIX ELEMENTS; MATRIX MULTIPLICATIONS; MATRIX OPERATIONS; NUMBERING SCHEMES; PARALLEL PROCESSING; SPACE FILLING CURVES; SPACE FILLING CURVES (SFC); SPRINGER (CO);

MATRIX ALGEBRA;

EID: 45449120592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68111-3_66     Document Type: Conference Paper

References (12)

1. Aberdeen, D., Baxter, J.: Emmerald: a fast matrix-matrix multiply using Intel's SSE instructions, Concurrency Computat.: Pract. Exper. 13 (2001)
2. Bader, M., Zenger, C.: Cache oblivious matrix multiplication using an element ordering based on a Peano curve. Linear Algebra Appl. 417(2-3) (2006)
3. Bader, M., Zenger, C.: A cache oblivious algorithm for matrix multiplication based on Peano's space filling curve. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Wásniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, Springer, Heidelberg (2006)
4. Bader, M., Mayer, C.: Cache oblivious matrix operations using Peano curves. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, Springer, Heidelberg (2007)
5. Duff, I.S., Koster, J.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20(4) (1999)
6. Elmroth, E., Gustavson, F., Jonsson, I., Kågström, B.: Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Review 46(1) (2004)
7. GotoBLAS, Texas Advanced Computing Center, http://www.tacc.utexas.edu/ resources/software/
8. Gustavson, F.G.: Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Research and Development 41(6) (1997)
9. Intel Math Kernel Library (2005), http://intel.com/cd/software/products/ asmo-na/eng/perflib/mkl/
10. Joffrain, T., Quintana-Orti, E.S., van de Geijn, R.: Updating an LU factorization and its application to scalable out-of-core
11. Whaley, R.C., Petitet, A., Dongarra, J.J.: Automated empirical optimization of software and the ATLAS project. Parallel Computing 27(1-2) (2001)
12. Yotov, K., Roeder, T., Pingali, K., Gunnels, J., Gustavson, F.: Is cache oblivious DGEMM a viable alternative. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, Springer, Heidelberg (2007)