Cluster partitioning approaches to mapping parallel programs onto a hypercube

P Sadayappan, F Ercal, J Ramanujam
1990 Parallel Computing  
The task-to-processor mapping problem is addressed in the context of a local-memory multiprocessor with a hypercube interconnection topology. Two heuristic cluster-based mapping strategies are compared -1) a nearest-neighbor approach and 2) a recursiveclustering scheme. The nearest-neighbor strategy is shown to be more e ective on hypercube systems with high communication start-up costs, especially for nite element graphs; the recursive partitioning heuristic is generally better on hypercubes
more » ... th lower communication start-up costs and is more e ective on random task graphs.
doi:10.1016/0167-8191(90)90115-p fatcat:lpyqgwud3zhebaljyb2h6lk7tq