A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
Cluster partitioning approaches to mapping parallel programs onto a hypercube
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
doi:10.1016/0167-8191(90)90115-p
fatcat:lpyqgwud3zhebaljyb2h6lk7tq