On the complexity of task allocation

A detailed study is presented on the combinatorial optimization problem of allocating parallel tasks to a parallel computer. Depending on two application/machine-specific parameters, both a sequential and a parallel optimal allocation phase are shown to exist. A sudden “phase” transition is observed if one of these parameters is varied. Simulated annealing is used to find the optimal allocations, which is justified by the self-similar structure of the task allocation energy landscape. It is shown that the difficulty of finding optimal allocations behaves anomalously near the transition, analogous to critical slowing down of simulated equilibration at second-order phase transitions. © 1997 John Wiley & Sons, Inc.

[1]  T. Hogg.  Statistical mechanics of combinatorial search , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.

[2]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[3]  Tilak Agerwala,et al.  SP2 System Architecture , 1999, IBM Syst. J..

[4]  P. Stadler,et al.  The landscape of the traveling salesman problem , 1992 .

[5]  Geoffrey C. Fox,et al.  Parallel Computing Works , 1994 .

[6]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

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

[8]  P. Cheeseman,et al.  Computational Complexity And Phase Transitions , 1992, Workshop on Physics and Computation.

[9]  Gregory B. Sorkin.  Simulated annealing on fractals: theoretical analysis and relevance for combinatorial optimization , 1990 .

[10]  C. P. Williams,et al.  Phase transitions and coarse-grained search , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.

[11]  Athanassios Siapas,et al.  Criticality and Parallelism in Combinatorial Optimization , 1996, Science.

[12]  Correlation structure of the landscape of the graph-bipartitioning problem , 1992 .

[13]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[14]  Tad Hogg,et al.  Using Deep Structure to Locate Hard Problems , 1992, AAAI.

[15]  Izidor Gertner,et al.  On the Complexity of Scheduling Problems for Parallel/Pipelined Machines , 1989, IEEE Trans. Computers.