Local Search Variants for Hypercube Embedding

The hypercube embedding problem, a restricted ver- sion of the general mapping problem, is the problem of mapping a set of communicating processes to a hy- percube multiprocessor. The goal is to find a map- ping that minimizes the average length of the paths between communicating processes. Iterative improve- ment heuristics for hypercube embedding, including a local search, a Kernighan-Lin, and a simulated an- nealing, are evaluated under different options includ- ing neighborhoods (all-swaps versus cube-neighbors), initial solutions (random versus greedy), and enhance- ments on terminating conditions (flat moves and up- hill moves). By varying these options we obtain a wide range of tradeoffs between execution time and solution quality.

[1]  P. Sadayappan,et al.  Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes , 1987, IEEE Transactions on Computers.

[2]  Kunio Fukunaga,et al.  Assignment of Job Modules onto Array Processors , 1987, IEEE Transactions on Computers.

[3]  Francine Berman,et al.  On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..

[4]  Armen Gabrielian,et al.  Optimal Object Allocation in Distributed Computer Systems , 1984, ICDCS.

[5]  Alan S. Wagner.  Embedding Arbitrary Binary Trees in a Hypercube , 1989, J. Parallel Distributed Comput..

[6]  E. F. Gehringer,et al.  A graph-oriented mapping strategy for a hypercube , 1988, C3P.

[7]  Heinz Mühlenbein,et al.  New solutions to the mapping problem of parallel systems: The evolution approach , 1987, Parallel Comput..

[8]  Heinz Mühlenbein,et al.  Mapping Strategies in Message Based Multiprocessor Systems , 1987, PARLE.

[9]  Karsten Schwan,et al.  Automating Resource Allocation for the Cm* Multiprocessor , 1985, ICDCS.

[10]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[11]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[12]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[13]  Alan Wagner,et al.  Embedding Trees in a Hypercube is NP-Complete , 1990, SIAM J. Comput..

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.