The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
DOI10.1007/S00224-010-9273-8zbMATH Open1213.68070OpenAlexW2711285122MaRDI QIDQ613114FDOQ613114
Authors: 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
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Automated empirical optimizations of software and the ATLAS project
- Title not available (Why is that?)
- Introduction to algorithms
- A Theorem on Boolean Matrices
- Cache-oblivious algorithms
- Two Notes on Notation
- The cache complexity of multithreaded cache oblivious algorithms
- FLAME
- Title not available (Why is that?)
- Cache-oblivious dynamic programming
- Oblivious algorithms for multicores and networks of processors
- The data locality of work stealing
- Locality of Reference in LU Decomposition with Partial Pivoting
- R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
Cited In (2)
Uses Software
This page was built for publication: The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613114)
