Task allocation onto a hypercube by recursive mincut bipartitioning

Journal of Parallel and Distributed Computing

Volumn 10, Issue 1, 1990, Pages 35-44

  Ercal, F ^a   Ramanujam, J ^a   Sadayappan, P ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002817693     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-7315(90)90004-9     Document Type: Article

References (26)

1. Experience with an automatic solution to the mapping problem
2. On the mapping problem
3. Heuristic models of task assignment scheduling in distributed systems
4. A linear-time heuristic for improving network partitions
5. A preprocessor for irregular finite element problems
6. Load balancing and sparse matrix vector multiplication on the hypercube
7. Concurrent computation and the theory of complex systems
8. Practical multiprocessor scheduling algorithms for efficient parallel processing
9. An efficient heuristic procedure for partitioning graphs
10. Optimization by simulated annealing
11. Mapping strategies in message-based multiprocessor systems
12. Heuristic algorithms for task assignment in distributed systems
13. Equation of state calculations by fast computing machines
14. Task allocation by simulated annealing
15. Cluster partitioning approaches to mapping parallel programs onto a hypercube
16. Nearest-neighbor mapping of finite element graphs onto processor meshes
17. ∗ multiprocessor
18. The TimberWolf placement and routing package
19. A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion
20. Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing
21. Efficient computation of optimal assignments for distributed tasks
22. Module assignments in distributed systems
23. Multiprocessor scheduling with the aid of network flow algorithms