Run-Time Techniques for Exploiting Irregular Task Parallelism on Distributed Memory Architectures
- 1 May 1997
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 42 (2) , 143-156
- https://doi.org/10.1006/jpdc.1997.1319
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- DAG-consistent distributed shared memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sparse LU factorization with partial pivoting on distributed memory machinesPublished by Association for Computing Machinery (ACM) ,1996
- Run-time compilation for parallel sparse matrix computationsPublished by Association for Computing Machinery (ACM) ,1996
- TreadMarks: shared memory computing on networks of workstationsComputer, 1996
- MULTIPROCESSOR RUNTIME SUPPORT FOR FINE-GRAINED, IRREGULAR DAGSParallel Processing Letters, 1995
- Remote queuesPublished by Association for Computing Machinery (ACM) ,1995
- Communication Optimizations for Irregular Scientific Computations on Distributed Memory ArchitecturesJournal of Parallel and Distributed Computing, 1994
- Parallel Algorithms for Sparse Linear SystemsSIAM Review, 1991
- The influence of relaxed supernode partitions on the multifrontal methodACM Transactions on Mathematical Software, 1989
- Task scheduling for parallel sparse Cholesky factorizationInternational Journal of Parallel Programming, 1989