Cache oblivious matrix operations using peano curves

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

Volumn 4699 LNCS, Issue , 2007, Pages 521-530

  Bader, Michael ^a   Mayer, Christian ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; ALGORITHMS; BUFFER STORAGE; COMPUTATION THEORY; HIERARCHICAL SYSTEMS;

CACHE LEVEL; DATA ACCESS PATTERNS; PEANO SPACE FILLING;

MATRIX ALGEBRA;

EID: 38049077599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75755-9_64     Document Type: Conference Paper

References (7)

1. Bader, M., Zenger, C.: Cache oblivious matrix multiplication using an element ordering based on a Peano curve. Linear Algebra and its Applications 417(2-3) (2006)
2. Bader, M., Zenger, C.: A Cache Oblivious Algorithm for Matrix Multiplication Based on Peano's Space Filling Curve. In: Wyrzykowski, R., Dongarra, J.J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 1042-1049. Springer, Heidelberg (2006)
3. 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)
4. Gustavson, F.G.: Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Research and Development 41(6) (1997)
5. Intel math kernel library (2005), http://intel.com/cd/software/products/ asmo-na/eng/perflib/mkl/
6. Mayer, Ch.: Cache oblivious matrix operations using Peano curves, Diploma Thesis, TU München (2006), http://tifammy.sourceforge.net/documentation. php
7. Gunnels, J., Gustavson, F., Pingali, K., Yotov, K.: Is Cache-oblivious DGEMM Viable? In: Kagstrom, B., Elmroth, E., Dongarra, J., Wasniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, pp. 919-928. Springer, Heidelberg (2007)