Cluster partitioning approaches to mapping parallel programs onto a hypercube
- 1 January 1990
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 13 (1) , 1-16
- https://doi.org/10.1016/0167-8191(90)90115-p
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubesIEEE Transactions on Computers, 1988
- Heuristic algorithms for task assignment in distributed systemsIEEE Transactions on Computers, 1988
- 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
- A Partitioning Strategy for Nonuniform Problems on MultiprocessorsIEEE Transactions on Computers, 1987
- Optimal partitioning of randomly generated distributed programsIEEE Transactions on Software Engineering, 1986
- A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax CriterionIEEE Transactions on Computers, 1985
- Practical Multiprocessor Scheduling Algorithms for Efficient Parallel ProcessingIEEE Transactions on Computers, 1984
- On the Mapping ProblemIEEE Transactions on Computers, 1981
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970