Skip to main content

OR-parallel Prolog on distributed memory systems

  • Conference paper
  • First Online:
PARLE'94 Parallel Architectures and Languages Europe (PARLE 1994)

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

  • 124 Accesses

Abstract

A fully distributed OR-parallel Prolog implementation scheme is shown in the paper based on the recomputation model. The main advantage of the recomputation model is that only little modification is needed to the sequential WAM engine in order to achieve a distributed Prolog system. The paper describes the new data structures of the parallel WAM engine and explains how the distributed scheduler can be organized. Finally a broadcast message based cavallier cut implementation scheme is shown in the paper.

The author visited ECRC in 1993 for three months supported by a CEC Fellowship grant (No. 12213) for Scientific and Technical Cooperation with Central and Eastern European Countries. The current work is a result of this three month research in ECRC.

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. A method for Implementing Cut in Parallel Execution of Prolog, Proc. of the 1987 Symp. on Logic Prog., 1987, 449–456

    Google Scholar 

  2. Ali, K. A. M. and Karlsson, R. The Muse Or-Parallel Prolog Model and ist Performance, Proc. of the 1990 North American Logic Prog. Conf., 1990, 757–776

    Google Scholar 

  3. Clocksin,W.F. Principles of DelPhi Parallel Inference Machine, The Computer Journal, vol. 30, no. 5, 1987, 386–392

    Google Scholar 

  4. Clocksin,W.F. and Alshawi,H. A Method for Efficiently Executing Horn Clause Programs Using Multiple Processors, New Gen. Comp., 5 (1988), 361–376

    Google Scholar 

  5. Clocksin,W.F. The DelPhi Multiprocessor Inference Machine, Proc. of the 4th UK Conf. on Logic Prog., 1992, 189–198

    Google Scholar 

  6. Hausman,B. Ciepielewski,A. and Calderwood,A. Cut and Side-Effects in OR-Parallel Prolog Proceedings of the 2nd Int. Conf. on Fifth Generation Comp. Sys., 1988, 831–840

    Google Scholar 

  7. Kacsuk,P. Cut Implementation in a Massively Parallel Prolog Environment, EUROMICRO Workshop on Parallel and Distributed Processing, 1993

    Google Scholar 

  8. Kacsuk,P. OR-Parallel ECLiPSe on Distributed Memory Systems, CEC PECO Fellowship Report, ECRC, 1993

    Google Scholar 

  9. P. Kacsuk and M.J.Wise (editors) Implementations of Distributed Prolog, John Wiley, 1992

    Google Scholar 

  10. Lusk,E. et al. The Aurora Or-Parallel Prolog System, Proceedings of the 2nd Int. Conf. on Fifth Generation Comp. Sys., 1988

    Google Scholar 

  11. Veron, A.et al. Why and How in the OR-Parallel ElipSys CLP System.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Costas Halatsis Dimitrios Maritsas George Philokyprou Sergios Theodoridis

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kacsuk, P. (1994). OR-parallel Prolog on distributed memory systems. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_122

Download citation

  • DOI: https://doi.org/10.1007/3-540-58184-7_122

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics