Expected Gains from Parallelizing Constraint Solving for Hard Problems

A number of recent studies have examined how the difficulty of various NP-hard problems varies with simple parameters describing their structure. In particular, they have identified parameter values that distinguish regions with many hard problem instances from relatively easier ones. In this paper we continue this work by examining independent parallel search. Specifically, we evaluate the speedup as function of connectivity and search difficulty for the particular case of graph coloring with a standard heuristic search method. This requires examining the full search cost distribution rather than just the more commonly reported mean and variance. We also show similar behavior for a single-agent search strategy in which the search is restarted whenever it fails to complete within a specified cost bound.

[1]  Masaharu Imai,et al.  A Parallel Searching Scheme for Multiprocessor Systems and Its Application to Combinatorial Problems , 1979, IJCAI.

[2]  William A. Kornfeld.  The Use of Parallelism to Implement a Heuristic Search , 1981, IJCAI.

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

[4]  Edward F. Gehringer,et al.  Superlinear Speedup Through Randomized Algorithms , 1985, International Conference on Parallel Processing.

[5]  Dharma P. Agrawal,et al.  Randomized Parallel Algorithms for Prolog Programs and Backtracking Applications , 1987, International Conference on Parallel Processing.

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7]  Charles E. McDowell,et al.  Modeling Speedup greater than n , 1989, International Conference on Parallel Processing.

[8]  Wolfgang Ertel,et al.  Random competition: a simple, but efficient method for parallelizing inference systems , 1990, Forschungsberichte, TU Munich.

[9]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[10]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[11]  B A Huberman,et al.  Cooperative Solution of Constraint Satisfaction Problems , 1991, Science.

[12]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[13]  Ira Pramanick,et al.  Study of an Inherently Parallel Heuristic Technique , 1991, ICPP.

[14]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

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

[16]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[17]  Tad Hogg,et al.  Extending Deep Structure , 1993, AAAI.

[18]  James M. Crawford,et al.  Experimental Results on the Crossover Point inSatis ability , 1993 .

[19]  Tad Hogg,et al.  Solving the Really Hard Problems with Cooperative Search , 1993, AAAI.

[20]  Vipin Kumar,et al.  On the Efficiency of Parallel Backtracking , 1993, IEEE Trans. Parallel Distributed Syst..

[21]  Toby Walsh,et al.  An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..

[22]  Wolfgang Ertel,et al.  Optimal parallelization of Las Vegas algorithms , 1993, Forschungsberichte, TU Munich.