Multiprocessors and run‐time compilation
- 1 December 1991
- journal article
- research article
- Published by Wiley in Concurrency: Practice and Experience
- Vol. 3 (6), 573-592
- https://doi.org/10.1002/cpe.4330030607
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Run-time parallelization and scheduling of loopsIEEE Transactions on Computers, 1991
- Run-time scheduling and execution of loops on message passing machinesJournal of Parallel and Distributed Computing, 1990
- Krylov methods preconditioned with incompletely factored matrices on the CM-2Journal of Parallel and Distributed Computing, 1990
- Aggregation Methods for Solving Sparse Triangular Systems on MultiprocessorsSIAM Journal on Scientific and Statistical Computing, 1990
- Parallel pivoting combined with parallel reduction and fill-in controlParallel Computing, 1989
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERSInternational Journal of High Speed Computing, 1989
- Compiling programs for distributed-memory multiprocessorsThe Journal of Supercomputing, 1988
- Multigrid solution of the two-dimensional Euler equations on unstructured triangular meshesAIAA Journal, 1988
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- Parallel implementation of multifrontal schemesParallel Computing, 1986