Scheduling Trees of Malleable Tasks for Sparse Linear Algebra

This publication has 14 references indexed in Scilit:

• Scheduling Trees of Malleable Tasks for Sparse Linear Algebra
  2015
• A Runtime Approach to Dynamic Resource Allocation for Sparse Direct Solvers
  2014
• PaRSEC: Exploiting Heterogeneity to Enhance Scalability
  Computing in Science & Engineering, 2013
• Fine Granularity Sparse QR Factorization for Multicore Based Systems
  Lecture Notes in Computer Science, 2012
• StarPU: a unified platform for task scheduling on heterogeneous multicore architectures
  Concurrency and Computation: Practice and Experience, 2010
• KAAPI
  2007
• Scheduling malleable tasks with precedence constraints
  2005
• PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems
  Parallel Computing, 2002
• Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers
  The International Journal of Supercomputing Applications, 1987
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
  ACM Transactions on Mathematical Software, 1983