A Runtime System for Programming Out-of-Core Matrix Algorithms-by-Tiles on Multithreaded Architectures
DOI10.1145/2331130.2331133zbMATH Open1365.65114OpenAlexW1982891411WikidataQ113310376 ScholiaQ113310376MaRDI QIDQ2989167FDOQ2989167
Authors: Gregorio Quintana-Ortí, Francisco D. Igual, M. Marqués, Enrique S. Quintana-Ortí, Robert A. van de Geijn 
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2331130.2331133
Recommendations
- Programming matrix algorithms-by-blocks for thread-level parallelism
- Scaling up parallel computation of tiled QR factorizations by a distributed scheduling runtime system and analytical modeling
- Generating efficient tiled code for distributed memory machines
- Compile and run-time support for the parallelization of sparse matrix updating algorithms
- Algorithmic patterns for \(\mathcal {H}\)-matrices on many-core processors
Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)
Cited In (5)
- Title not available (Why is that?)
- Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures
- Hierarchical algorithms on hierarchical architectures
- Solving sequences of generalized least-squares problems on multi-threaded architectures
- Title not available (Why is that?)
Uses Software
This page was built for publication: A Runtime System for Programming Out-of-Core Matrix Algorithms-by-Tiles on Multithreaded Architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989167)
