Skip to main content
SpringerLink
Log in

An abstract machine for the Reduce-OR process model for parallel Prolog

  • Logic Programming
  • Conference paper
  • First Online:
Knowledge Based Computer Systems (KBCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 444))

Included in the following conference series:

  • 1952 Accesses

Abstract

We discuss the design of an abstract machine for the Reduce-OR process model (ROPM) for the AND and OR parallel execution of Prolog programs. It differs from the WAM in many respects, and some of these differences are elaborated upon in this paper. Some of the significant differences are related to the binding environment which has been designed to support AND and OR parallel execution of logic programs on both shared and nonshared memory machines, the process model, and the handling of solutions for AND parallel branches in the Data Join Graph (DJG) that is used to represent data dependencies in a Prolog clause. An emulator for the abstract machine has been implemented and is targeted for both shared and nonshared memory machines.

This work is supported in part by a National Science Foundation grant NSF CCR-87-00988

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. Biswas P., Su S.C. and Yun D. Y. A Scalable Abstract Machine Model to Support Limited-OR/Restricted-AND Parallelism in Logic Programs. In Proceedings of ICLP, Seattle, August 1988.

    Google Scholar 

  2. Conery J.S. Binding Environments for Parallel Logic Programs in Nonshared Memory Multiprocessors. In Proceedings of SLP, San Francisco, September 1987.

    Google Scholar 

  3. de Kergommeaux J.C. and Robert P. An Abstract Machine to implement efficiently OR-AND Parallel Prolog, In Proceedings of ICLP, Seattle, August 1988.

    Google Scholar 

  4. DeGroot D. Restricted AND Parallelism. In Proceedings of the International Conference on FGCS, November 1984.

    Google Scholar 

  5. Gregory S. Parallel Programming in Parlog, the Language and its Implementation. Addison Wesley, 1987.

    Google Scholar 

  6. Gupta G. and Jayaraman B. Combined AND-OR Parallelism on Shared Memory Multiprocessors. In Proceedings of NACLP, Cleveland, October 1989.

    Google Scholar 

  7. Hausman. B., Ciepielewski A. and Haridi S. OR-Parallel Prolog Made Efficient on Shared Memory Multiprocessors. In Proceedings of SLP, San Francisco, September 1987.

    Google Scholar 

  8. Hermenegildo M.V. An Abstract Machine based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel. Ph.D. thesis, Dept. of Computer Science, University of Texas at Austin, 1986.

    Google Scholar 

  9. Kale L.V. 'Completeness’ and ‘Full Parallelism’ of Parallel Logic Programming Schemes. In Proceedings of SLP, San Francisco, September 1987.

    Google Scholar 

  10. Kale L.V. Parallel Execution of Logic Programs: The Reduce-OR Process Model. In Proceedings of ICLP, Melbourne, May 1987.

    Google Scholar 

  11. Kale L.V. and Shu W. The Chare Kernel Language for Parallel Programming: A Perspective. Technical Report UIUCDCS-R-88-1451, Dept. of Computer Science, University of Illinois at Urbana-Champaign, August 1988.

    Google Scholar 

  12. Kale L.V., Ramkumar B. and Shu W. A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs. In Proceedings of ICLP, Seattle, August 1988.

    Google Scholar 

  13. Lin Y-J. and Kumar V. Performance of AND Parallel Execution of Logic Programs on a Shared Memory Multiprocessor. In Proceedings of International Conference of FGCS, Tokyo, November 1988.

    Google Scholar 

  14. Lusk et. al. The Aurora OR-Parallel Prolog System. In Proceedings of International Conference of FGCS, Tokyo, November 1988.

    Google Scholar 

  15. Mudambi S. Performance of Aurora on a Switch-Based Multiprocessor. In Proceedings of NACLP, Cleveland, October 1989.

    Google Scholar 

  16. Ramkumar B. and Kale L.V. Compiled Execution of the Reduce-OR Process Model on Multiprocessors. In Proceedings of NACLP, Cleveland, October 1989.

    Google Scholar 

  17. Taylor S., Safra S. and Shapiro E. A Parallel Implementation of Flat Concurrent Prolog. Technical Report CS87-04, Weizmann Institute of Science, October 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University Of Illinois at Urbana-Champaign, 61801, Urbana, Illinois

    Balkrishna Ramkumar & Laxmikant V. Kalé

Authors
  1. Balkrishna Ramkumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laxmikant V. Kalé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramani R. Chandrasekar K. S. R. Anjaneyulu

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramkumar, B., Kalé, L.V. (1990). An abstract machine for the Reduce-OR process model for parallel Prolog. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018385

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47168-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation