An efficient heuristic algorithm for mapping parallel programs onto multicomputers
- 31 March 1993
- journal article
- Published by Elsevier in Microprocessing and Microprogramming
- Vol. 36 (2) , 83-92
- https://doi.org/10.1016/0165-6074(93)90249-k
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Task allocation onto a hypercube by recursive mincut bipartitioningJournal of Parallel and Distributed Computing, 1990
- Cluster partitioning approaches to mapping parallel programs onto a hypercubeParallel Computing, 1990
- Nearest-Neighbor Mapping of Finite Element Graphs onto Processor MeshesIEEE Transactions on Computers, 1987
- Efficient computation of optimal assignments for distributed tasksJournal of Parallel and Distributed Computing, 1987
- Optimal partitioning of randomly generated distributed programsIEEE Transactions on Software Engineering, 1986
- Practical Multiprocessor Scheduling Algorithms for Efficient Parallel ProcessingIEEE Transactions on Computers, 1984
- Optimization by Simulated AnnealingScience, 1983
- Heuristic Models of Task Assignment Scheduling in Distributed SystemsComputer, 1982
- On the Mapping ProblemIEEE Transactions on Computers, 1981
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970