Superlinear speedup for parallel backtracking
We have implemented a backtracking strategy for the satisfiability problem on a ring of processors and we observed a superlinear speedup in the average. In this paper we describe a model from which this superlinear speedup can be deduced. The model is based on the fact that in the average the solutions are distributed nonuniformly in the case of the satisfiability problem. To our knowledge this phenomenon was not used before in the analysis of algorithms.
KeywordsTravelling Salesman Problem Conjunctive Normal Form Average Speedup Satisfiability Problem Unbalanced Distribution
Unable to display preview. Download preview PDF.
- Brown, C.A./Purdom, P.W.: An average time analysis of backtracking. SIAM J. Comput., Vol 10,No.3, August 1981, 583–593Google Scholar
- Finkel, R./Manber, U.: DIB — a Distributed Implementation of Backtracking. Computer Science Technical Report 588, University of Wisconsin, Madison, March 1985Google Scholar
- Garey, M.R./Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Calif., 1979Google Scholar
- Mohan, J.: A study on Parallel Computation: the Travelling Salesman Problem. Technical Report CMU-CS-82-136(R), Dept. of Computer Science, Carnegie Mellon University, 1983Google Scholar
- Monien, B./Speckenmeyer, E.: Solving satisfiability in less than 2n steps. Discrete Appl. Math., Vol. 10, 1985, 287–295Google Scholar
- Monien, B./Speckenmeyer, E./Vornberger, O.: Superlinear Speedup for Parallel Backtracking. Technical Report No.30, Reihe Theoretische Informatik, Universität-GH Paderborn, 1986Google Scholar
- Quinn, M./Deo, N.: Parallel Graph Algorithms. Computing survey, Vol. 16, No. 3, September 1984, 319–348Google Scholar