Skip to main content

A novel method for parallel implementation of findall

  • Conference paper
  • First Online:
Progamming Language Implementation and Logic Programming (PLILP 1993)

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

  • 133 Accesses

Abstract

The goal of this paper is to present and evaluate a new method for parallel implementation of findall, preserving the sequential semantics. The method is implemented in the Muse OR-parallel Prolog system and the performance results have been compared with two other methods. The results obtained indicate that our new method is the better one.

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. Khayri A. M. Ali and Roland Karlsson. The Muse Approach to Or-Parallel Prolog. International Journal of Parallel Programming, pages 129–162, Vol. 19, No. 2, April 1990.

    MathSciNet  Google Scholar 

  2. Khayri A. M. Ali and Roland Karlsson. Full Prolog and Scheduling Or-Parallelism in Muse. International Journal of Parallel Programming, pages 445–475, Vol. 19, No. 6, December 1990.

    Google Scholar 

  3. Mats Carlsson, Ken Danhof, and Ross Overbeek. A Simplified Approach to the Implementation of AND-parallelism in an OR-parallel Environment. In the Proceedings of the Fifth International Conference on Logic Programming, pages 1565–1577. MIT Press, August 1988.

    Google Scholar 

  4. Mats Carlsson, et al. SICStus Prolog User's Manual. SICS Technical Report T91:11B, October 1991.

    Google Scholar 

  5. Mats Carlsson. Design and Implementation of an OR-Parallel Prolog Engine. PhD thesis, Swedish Institute of Computer Science, SICS Dissertation Series 02, March 1990.

    Google Scholar 

  6. Roland Karlsson. A High Performance OR-parallel Prolog System. PhD thesis, Swedish Institute of Computer Science, SICS Dissertation Series 07, March 1992.

    Google Scholar 

  7. Ewing Lusk, David H. D. Warren, Scif Haridi, et al. The Aurora Or-parallel Prolog System. New Generation Computing, 7(2,3): 243–271, 1990.

    Google Scholar 

  8. David H. D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Maurice Bruynooghe Jaan Penjam

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ali, K.A.M., Karlsson, R. (1993). A novel method for parallel implementation of findall. In: Bruynooghe, M., Penjam, J. (eds) Progamming Language Implementation and Logic Programming. PLILP 1993. Lecture Notes in Computer Science, vol 714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57186-8_82

Download citation

  • DOI: https://doi.org/10.1007/3-540-57186-8_82

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57186-5

  • Online ISBN: 978-3-540-47945-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics