Skip to main content
SpringerLink
Log in

Superlinear speedup for parallel backtracking

  • Session 10: Algorithms, Architectures And Performance III
  • Conference paper
  • First Online:
Supercomputing (ICS 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 297))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. Brown, C.A./Purdom, P.W.: An average time analysis of backtracking. SIAM J. Comput., Vol 10,No.3, August 1981, 583–593

    Google Scholar 

  2. Finkel, R./Manber, U.: DIB — a Distributed Implementation of Backtracking. Computer Science Technical Report 588, University of Wisconsin, Madison, March 1985

    Google Scholar 

  3. Garey, M.R./Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Calif., 1979

    Google Scholar 

  4. 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, 1983

    Google Scholar 

  5. Monien, B./Speckenmeyer, E.: Solving satisfiability in less than 2n steps. Discrete Appl. Math., Vol. 10, 1985, 287–295

    Google Scholar 

  6. Monien, B./Speckenmeyer, E./Vornberger, O.: Superlinear Speedup for Parallel Backtracking. Technical Report No.30, Reihe Theoretische Informatik, Universität-GH Paderborn, 1986

    Google Scholar 

  7. Quinn, M./Deo, N.: Parallel Graph Algorithms. Computing survey, Vol. 16, No. 3, September 1984, 319–348

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität-GH Paderborn, D-4790, Paderborn, West Germany

    Ewald Speckenmeyer, Burkhard Monien & Oliver Vornberger

Authors
  1. Ewald Speckenmeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oliver Vornberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. N. Houstis T. S. Papatheodorou C. D. Polychronopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Speckenmeyer, E., Monien, B., Vornberger, O. (1988). Superlinear speedup for parallel backtracking. In: Houstis, E.N., Papatheodorou, T.S., Polychronopoulos, C.D. (eds) Supercomputing. ICS 1987. Lecture Notes in Computer Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18991-2_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-18991-2_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18991-6

  • Online ISBN: 978-3-540-38888-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation