Skip to main content
SpringerLink
Log in

A parallel implementation for AKL

  • 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))

Abstract

This paper describes the design of an AND/OR parallel implementation called ParAKL, for the Andorra Kernel Language. The design is inspired by the Warren Abstract Machine with some important extensions. One of the main problems in AND/ OR parallel systems is the efficient handling of variables. We have adopted the PEPSys hashing scheme with additional mechanisms for the notion of quietness required by the theoretical model of AKL. A ParAKL computation builds a tree representing the branches of the search tree currently under execution. This tree is built in the usual WAM-like way until a processor blocks and is scheduled to other work. A scheduled branch is separated from the original branch using a hash window, in which bindings made to shared variables are saved.

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.

References

  1. Ali, Khayri A. M. and Roland Karlsson, “The Muse Or-Parallel Prolog Model and its Performance”, in Proceedings of the 1990 North American Conference on Logic Programming, ed. Manuel Hermenegildo, pp. 737–756, MIT Press, Cambridge, Massachusetts, 1990.

    Google Scholar 

  2. Baron, Uri, Jacques Chassin de Kergommeaux, Max Hailperin, Michael Ratcliffe, Philippe Robert, Jean-Claude Syre, and Harald Westphal, “The parallel ECRC Prolog System PEPSys: an overview and evaluation results”, in Proceedings of the International Conference on Fifth Generation Computer Systems 1988, ed. ICOT, pp. 841–850, ICOT, Tokyo, 1988.

    Google Scholar 

  3. Gopal Gupta and Bharat Jayaraman, “Compiled And-Or Parallelism on Shared Memory Multiprocessors”, in Proceedings of the North American Conference on logic Programming, Cleveland, pp 332–349, MIT Press, 1989.

    Google Scholar 

  4. Scif Haridi and Sverker Janson, “Kernel Andorra Prolog and its Computation Model”, in Logic Programming, Proceedings of the Seventh International Conference, pp. 31–48, The MIT Press, 1990.

    Google Scholar 

  5. Sverker Janson, Scif Haridi, “Programming Paradigms of the Andorra Kernel Language”, in “Proceedings of the International Logic Programming Symposium”, ed. V. Saraswat, The MIT Press, Cambridge, Massachusetts, 1991.

    Google Scholar 

  6. Per Brand, “The new AKL compiler”, communication at the ACCLAIM workshop, SICS, Sweden, November 1992.

    Google Scholar 

  7. Remco Moolenaar, Henk Van Acker, “καππα, a Kernel Andorra Prolog Parallel Architecture Design”, KU, Leuven, CW-report 131, 1991.

    Google Scholar 

  8. Vitor Santos Costa, David H.D. Warren, and Rong Yang, “Andorra-I: A Parallel Prolog System that Transparently Exploits both And-and Or-Parallelism”, in Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, PPOPP'91, SIGPLAN NOTICES, vol. 26, no. 7, pp. 83–93, ACM Press, Baltimore, July 1991.

    Google Scholar 

  9. Tick, Evan, “Parallel logic programming”, MIT Press Cambridge, Massachusetts 1991.

    Google Scholar 

  10. Warren, David H.D., “An abstract Prolog instruction set”, Technical Report no 309, p. 30, SRI International, Menlo Park, 1983.

    Google Scholar 

  11. Warren, David H. D., “Or-Parallel Execution Models of Prolog”, in TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987, pp. 244–259, Springer-Verlag, Berlin, 1987.

    Google Scholar 

  12. Warren, D. S., “Efficient Prolog Memory Management for Flexible Control Strategies”, in The 1984 International Symposium on Logic Programming, pp. 198–202, IEEE, Atlantic City, 1984.

    Google Scholar 

  13. Harald Westphal, Philippe Robert, Jacques Chassin de Kergommeaux and Jean-Claude Syre, “The PEPSys Model: Combining Backtracking, AND-and OR-parallelism”, in Proceedings of the 4th Symposium on Logic Programming, pp. 436–448, IEEE, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, K.U.Leuven, Celestijnenlaan, 200 A, B-3001, Belgium

    Remco Moolenaar & Bart Demoen

Authors
  1. Remco Moolenaar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bart Demoen
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Moolenaar, R., Demoen, B. (1993). A parallel implementation for AKL. 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_83

Download citation

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

  • 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

Search

Navigation