Efficient run-time support for irregular task computations with mixed granularities
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Improved load distribution in parallel sparse Cholesky factorizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Randomized load balancing for tree-structured computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Communication Optimizations for Irregular Scientific Computations on Distributed Memory ArchitecturesJournal of Parallel and Distributed Computing, 1994
- Techniques to overlap computation and communication in irregular iterative applicationsPublished by Association for Computing Machinery (ACM) ,1994
- On the granularity and clustering of directed acyclic task graphsIEEE Transactions on Parallel and Distributed Systems, 1993
- Parallel Algorithms for Sparse Linear SystemsSIAM Review, 1991
- A new parallel architecture for sparse matrix computation based on finite projective geometriesPublished by Association for Computing Machinery (ACM) ,1991
- Parallel Programming and CompilersPublished by Springer Nature ,1988
- Computational Methods for Fluid FlowPublished by Springer Nature ,1983