Leveraging task-parallelism in message-passing dense matrix factorizations using SMPSs
Open Access
- 1 May 2014
- journal article
- research article
- Published by Elsevier in Parallel Computing
- Vol. 40 (5-6) , 113-128
Abstract
No abstract availableKeywords
Funding Information
- HiPEAC-2 Network of Excellence (FP7/ICT 217068)
- Spanish Ministry of Education (CICYT TIN2011-23283, TIN2007-60625, CSD2007-00050)
- Generalitat de Catalunya (2009-SGR-980)
- UPC
- FEDER
This publication has 15 references indexed in Scilit:
- Scheduling algorithms‐by‐blocks on small clustersConcurrency and Computation: Practice and Experience, 2012
- DAGuE: A generic distributed DAG engine for High Performance ComputingParallel Computing, 2012
- Exploiting thread-level parallelism in the iterative solution of sparse linear systemsParallel Computing, 2011
- StarPU: a unified platform for task scheduling on heterogeneous multicore architecturesConcurrency and Computation: Practice and Experience, 2010
- Towards dense linear algebra for hybrid GPU accelerated manycore systemsParallel Computing, 2010
- Programming matrix algorithms-by-blocks for thread-level parallelismACM Transactions on Mathematical Software, 2009
- Parallelizing dense and banded linear algebra libraries using SMPSsConcurrency and Computation: Practice and Experience, 2009
- Distributed SBP Cholesky factorization algorithms with near-optimal schedulingACM Transactions on Mathematical Software, 2009
- The LINPACK Benchmark: past, present and futureConcurrency and Computation: Practice and Experience, 2003
- Algorithmic redistribution methods for block-cyclic decompositionsIEEE Transactions on Parallel and Distributed Systems, 1999