The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation

DOI10.1007/s00224-010-9273-8zbMath1213.68070OpenAlexW2711285122MaRDI QIDQ613114

Vijaya Ramachandran, Rezaul Alam Chowdhury

Publication date: 17 December 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.7590

zbMATH Keywords

Gaussian eliminationtilingparallelmatrix multiplicationcache-obliviousall-pairs shortest path

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (2)

Oblivious algorithms for multicores and networks of processors ⋮ Resilient dynamic programming

Uses Software

• ATLAS
• FLAME
• BLAS
• Valgrind
• STXXL
• GotoBLAS
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cache complexity of multithreaded cache oblivious algorithms
• R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
• Oblivious algorithms for multicores and networks of processors
• The data locality of work stealing
• Two Notes on Notation
• Cache-Oblivious Algorithms
• Cache-oblivious dynamic programming
• Locality of Reference in LU Decomposition with Partial Pivoting
• FLAME
• A Theorem on Boolean Matrices
• Automated empirical optimizations of software and the ATLAS project

This page was built for publication: The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation