Skip to main content
SpringerLink
Log in

Is average superlinear speedup possible?

  • Conference paper
  • First Online:
CSL '88 (CSL 1988)

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

Included in the following conference series:

Abstract

A mathematical model for analysing the speedup behaviour of a parallel k processor backtracking algorithm compared with sequential backtracking is studied. The essential parameter of a problem class, which is incorporated in the model, is the distribution of solutions in the corresponding backtracking trees. Under the model assumptions it is shown that in case of sufficiently unbalanced distributions superlinear speedups will occur in the average. Further a result is shown, indicating that in case of restricted classes of CNF-formulas unbalanced distributions of solutions actually occur.

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.

5. References

  1. V. Faber, O.M. Lubeck, and A.B. White: Superlinear speedup of an efficient sequential algorithm is not possible. Parallel Computing, 3, 1986, 259–260

    Article  MathSciNet  Google Scholar 

  2. V.K. Janakiram, D.P. Agrawal, and R. Mehrotra: Randomized parallel algorithms for Prolog programs and backtracking applications. Proc. 1987 Int. Conf. on Parallel Processing, 1987, 278–281

    Google Scholar 

  3. T.-H. Lai and S. Sahni: Anomalies in parallel branch-and-bound algorithms. C. ACM 27 (1984), 594–602

    Article  Google Scholar 

  4. T.-H. Lai and A. Sprague: Performance of parallel branch-and-bound algorithms. Proc. 1985 Conf. on Parallel Processing, 1985, 194–201

    Google Scholar 

  5. T.-H. Lai and A. Sprague: A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions, Informatican Process. Letters, 23, 1986, 119–122

    MathSciNet  Google Scholar 

  6. R. Mehrotra and E.F. Gehringer: Superlinear Speedup through randomized algorithms. Proc. 1985 Conf. on Parallel Processing, 1985, 291–300

    Google Scholar 

  7. D. Parkinson: Parallel efficiency can be greater than unity. Parallel Computing, 3, 1986, 261–262

    Article  Google Scholar 

  8. M.J. Quinn: Designing efficient algorithms for parallel computers. McGraw-Hill 1987

    Google Scholar 

  9. E. Speckenmeyer: On the average case behaviour of backtracking for satisfiability and exact-satisfiability. Reihe Informatik, Bericht Nr. 50, Paderborn 1988 (Habilitationsschrift)

    Google Scholar 

  10. E. Speckenmeyer, B. Monien, and O. Vornberger: Superlinear speedup for parallel backtracking. Proc. Supercomputing 1987, LNCS 297, 985–993

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung Informatik, Universität Dortmund, Postfach 500 500, D-4600, Dortmund 50

    Ewald Speckenmeyer

Authors
  1. Ewald Speckenmeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Speckenmeyer, E. (1989). Is average superlinear speedup possible?. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026309

Download citation

  • DOI: https://doi.org/10.1007/BFb0026309

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51659-0

  • Online ISBN: 978-3-540-46736-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation