Geometric specification of scheduling constraints: A simplified approach to multiprocessing
References (8)
- et al.
A technique for achieving portability among multiprocessors: Implementation on the Lemur
Parallel Comput.
(1985) - et al.
Parallel logic programming for numeric applications
- et al.
Quasi-automatic parallelization: a simplified approach to multiprocessing
Parallel programming on the HEP multiple instruction stream computer
(1981)
There are more references available in the full text version of this article.
Cited by (1)
Partitioning Communication Processes for Efficient Execution of the Fork-Join Structures
2000, 15th International Conference on Computers and Their Applications 2000, CATA 2000
- ∗
This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.
Copyright © 1988 Published by Elsevier B.V.