Skip to main content

On logic program parallelisation strategies

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 94 — VAPP VI (VAPP 1994, CONPAR 1994)

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

Abstract

Given an OR-parallel logic program with several possible parallelisations, each with a good speedup, should we expect their combination to have a good speedup? Also, can a parallelisation with poor speedup ever have a good effect when combined with other parallelisations? This paper shows that combining speedups may have unexpected effects for both speculative and non-speculative computations, and that these effects have consequences for parallelisation strategies based on speedup measurements. The examples used for illustration are also useful as pathological benchmarks for run-time and compile-time analysis tools, such as trace visualisers and automatic parallelisers.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ali, K. A. M., Karlsson, R.: The Muse approach to OR-parallel programming. Int. J. Par. Prog. 19(2) (1990) 129–162.

    Google Scholar 

  2. Carlsson, M., Danhof, K., Overbeek, R.: A simplified approach to the implementation of AND-parallelism in an OR-parallel environment. Proc. 5th Int. Conf. Logic Prog. (1988) 1565–1577.

    Google Scholar 

  3. Veron, A., Schuerman, K., Reeve, M., Li, L.: Why and how in the ElipSys OR-parallel CLP system. Proc. Par. Arch. and Lang. Europe (1993) 291–302.

    Google Scholar 

  4. Fagin, B. S., Despain, A., Despain, M.: The performance of parallel Prolog programs. IEEE Trans. Comp. 39(12) (1990) 1434–1445.

    Google Scholar 

  5. Lai, T.-H., Sahni, S.: Anomalies in parallel branch-and-bound algorithms. Proc. Int. Conf. Parallel Processing (August 1983) 183–190. Also Comm. ACM 27(6) (1984) 594–602.

    Google Scholar 

  6. Lusk, E. et al: The Aurora OR-parallel Prolog system. Proc. Int. Conf. 5th Gen. Comp. Sys. (1988) 819–830.

    Google Scholar 

  7. Prestwich, S. D.: Parallel speedup anomalies and program development. Tech. Rep. ECRC-93-12 (1993).

    Google Scholar 

  8. Prestwich, S. D., Kusalik, A. J.: High-Level Visualisation of Parallel Logic Program Execution. Proc. Par. Arch. and Lang. Europe (1994) (to appear).

    Google Scholar 

  9. Rao, V., Rao, N., Kumar, V.: On the efficiency of parallel backtracking. IEEE Trans. Par. and Dist. Sys. 4(4) (1993) 427–437.

    Google Scholar 

  10. Singh, J., Singh, P., Hennesy, J., Hennesy, L., Gupta, A.: Scaling parallel programs for multiprocessors: methodology and examples. Computer 26(7) (1993) 42–50.

    Google Scholar 

  11. Sun, X.-H., Ni, L., M.: Another view on parallel speedup. Proc. Supercomputing (1990) 324–333.

    Google Scholar 

  12. Weide, B., W.: Analytical models to explain anomalous behaviour of parallel algorithms. Proc. Int. Conf. Par. Proc. (1981) 183–187.

    Google Scholar 

  13. Witte, E. E., Chamberlain, R. D., Franklin, M., Franklin, A.: Parallel simulated annealing using speculative computation. IEEE Trans. Par. and Dist. Systems 2(4) (1991) 483–494.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prestwich, S. (1994). On logic program parallelisation strategies. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58430-8

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics