A fault-tolerant parallel heuristic for assignment problems

This paper presents a new approach for parallel heuristic algorithms based on adaptive parallelism. Adaptive parallelism was used to dynamically adjust the parallelism degree of the application with respect to the system load. This approach demonstrates that high-performance computing using heterogeneous workstations combined with massively parallel machines is feasible to solve large assignment problems. The fault-tolerant algorithm allows a minimal loss of computation in case of failures. The proposed algorithm exploits the properties of this class of applications in order to reduce the complexity of the algorithm. The parallel heuristic algorithm combines di erent search strategies: simulated annealing and tabu search. Encouraging results have been obtained in solving the quadratic assignment problem. We have improved the best known solutions for some large real-world problems.

[1]  James S. Plank.  Efficient checkpointing on MIMD architectures , 1993 .

[2]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[3]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[4]  David Gelernter,et al.  Supercomputing out of recycled garbage: preliminary experience with Piranha , 1992, ICS '92.

[5]  E. Talbi,et al.  MARS * : Adaptive scheduling of parallel applications in a multi-userheterogeneous environmentZ , 1996 .

[6]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[7]  Jean-Marc Geib,et al.  A New Approach for Checkpointing Parallel Application , 1997, PDPTA.

[8]  Miron Livny,et al.  Parallel Processing on Dynamic Resources with CARMI , 1995, JSSPP.

[9]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

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

[11]  Marvin Theimer,et al.  Finding idle machines in a workstation-based distributed system , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[12]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[13]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[14]  David A. Nichols,et al.  Using idle workstations in a shared computing environment , 1987, SOSP '87.