Skip to main content
SpringerLink
Log in

Full prolog and scheduling or-parallelism in muse

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

Muse is a simple and efficient approach to Or-parallel implementation of the full Prolog language. It is based on havingmultiplesequential Prolog engines, each with its local address space, and some shared memory space. It is currently implemented on a number of bus-based and switch-based multiprocessors. The sequential SICStus Prolog system has been adapted to Or-parallel implementation with very low extra overhead in comparison with other approaches. The Muse performanhce results are very encouraging in absolute and relative terms.

The Muse execution model and its performance results on two different multiprocessor machines for a parallel version of Prolog, named Commit Prolog, have been presented in previous papers. This paper discusses supporting the full Prolog language and describes mechanisms being developed for scheduling Or-parallelism in Muse. It also presents performance results of the Muse implementation on Sequent Symmetry after supporting full Prolog. The results show that the extra overhead associated with supporting the full Prolog language is negligible.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Khayri A. M. Ali and Roland Karlsson, The Muse Approach to OR-Parallel Prolog,Int'l. J. of Parallel Programming,19(2):129–162 (April 1990).

    Google Scholar 

  2. Uri Baron, Jacques Chassin de Kergommeaux, Max Hailperin, Michael Ratcliffe, Philippe Ropert, Jean-Claude Syre, and Harald, Westphal, The Parallel ECRC Prolog System PEPSys: An Overview and Evaluation Results,Proc. of the Int'l. Conf. on Fifth Generation Computer Systems, ICOT pp. 841–850 (November 1988).

  3. Ralph Butler, Ewing Lusk, Robert Olson, and Ross Overbeek, ANLWAM—A Parallel Implementation of the Warren Abstract Machine, Internal Report, Argonne National Laboratory (1986).

  4. William Clocksin, Principles of the DelPhi Parallel Inference Machine,Computer Journal 30(5):386–392 (1987).

    Google Scholar 

  5. Laxmikant V. Kalé, The Reduce-OR Process Model for Parallel Evaluation of Logic Programs,Proc. of the Fourth Int'l. Conf. on Logic Programming, MIT Press, pp. 616–632 (May 1987).

  6. K. Kumon, H. Masuzawa, A. Itashiki, K. Satoh, and Y. Sohma, KABU-WAKE: A New Parallel Inference Method and Its Evaluation, IEEE,COMPCON Spring 86 (1986).

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

    Google Scholar 

  8. H. Yasuhara and K. Nitadori, ORBIT: A Parallel Computing Model of Prolog,New Generation Computing 2:277–288 (1984).

    Google Scholar 

  9. Doug DeGroot, Restricted, And-parallelism,Proc. of the Int'l. Conf. on Fifth Generation Computer Systems, Tokyo, pp. 471–478 (November 1984).

  10. Manuel Hermenegildo, An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs,Third Int'l. Conf. on Logic Programming (Ed. Ehud Shapiro), Springer-Verlag, London, pp. 25–39 (1986).

    Google Scholar 

  11. Yow-Jian Lin and Vipin Kumar, AND-Parallel Execution of Logic Programs on a Shared Memory Multiprocessor: A Summary of Results,Proc. of the Fifth Int'l. Conf. and Symp. on Logic Programming, pp. 1123–1141 (1988).

  12. Prasenjit Biswas, Shyh-Chang Su, and David Y. Y. Yun, A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND parallelism (RAP) in Logic Programs,Proc. of the Fifth Int'l. Conf. and Symp. on Logic Programming, MIT Press, pp. 1160–1179 (August 1988).

  13. John S. Conery, Binding Environments for Parallel Logic Programs in Noshared Memory Multiprocessors,Int'l. J. of Parallel Programming 17(2):125–152 (April 1988).

    Google Scholar 

  14. Laxmikant V. Kalé, B. Ramkumar, and W. Shu, A Memory Organization Independent Binding Environment for, AND-and OR-Parallel Execution of Logic Programs,Proc. of the Fifth Int'l. Conf. and Symp. on Logic Programming, pp. 1223–1240 (1988).

  15. Harald Westphal, Philippe Ropert, Jacques Chassin de Kergommeaux, and Jean-Claude Syre, The PEPSys Model: Combining Backtracking AND-and OR-Parallelism,Proc. of the Symp. on Logic Programming, pp. 436–448 (1987).

  16. Mats Carlsson and Johan Widén, SICStus Prolog User's Manual, SICS Research Report R88007B (October 1988).

  17. Shyam Mudambi, Personal communication (September 1990).

  18. KhayriA. M. Ali and Roland Karlsson, The Muse OR-Parallel Prolog Model and its Performance,Proc. of the North American Conf. on Logic Programming, pp. 757–776, MIT Press (October 1990).

  19. Ralph Butler, Terry Disz, Ewing Lusk, Robert Olson, Ross Overbeek, and Rick Stevens, Scheduling OR-Parallelism: an Argonne perspective,Proc. of the Fifth Int'l. Conf. and Symp. on Logic Programming, MIT Press, pp. 1590–1605 (August 1988).

  20. Khayri A. M. Ali and Roland Karlsson, Scheduling OR-Parallelism in Muse,Proc. of the Int'l. Conf. on Logic Programming, Paris, pp. 807–821 (June 1991).

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

  22. Bogumil Hausman, Pruning and Speculative Work in OR-Parallel Prolog, PhD thesis, Swedish Institute of Computer Science, SICS Dissertation Series 01 (SICS/D-90-9901) (March 1990).

  23. Gopal Gupta and Bharat Jayaraman On Criteria for OR-Parallel Execution Models of Logic Programs,Proc. of the North American Conf. on Logic Programming, MIT Press, pp. 737–756 (October 1990).

  24. Alan Calderwood and Péter Szeredi, Scheduling OR-Parallelism in Aurora—the Manchester scheduler,Proc. of the Sixth Int'l. Conf. on Logic Programming, MIT Press, pp. 419–435 (June 1989).

  25. Per Brand, Wavefront Scheduling, Internal Report, Gigalips Project (1988).

  26. Anthony Beaumont, Muthuraman, and Péter Szeredi, Scheduling OR-parallelism in Aurora with the Bristol Scheduler, Report TR-90-04, University of Bristol (March 1990).

  27. Péter Szeredi, Performance analysis of the Aurora OR-Parallel Prolog System,Proc. of the North American Conf. on Logic Programming, MIT Press, pp. 713–732 (March 1989).

  28. Khayri A. M. Ali, OR-Parallel Execution of Prolog on BC-machine,Proc. of the Fifth Int'l Conf. and Symp. on Logic Programming, pp. 1531–1545 (1988).

  29. David H. D. Warren, The SRI Model for OR-Parallel Execution of Prolog—Abstract Design and Implementation IssuesProc. of the Symp. on Logic Programming, pp. 92–102 (1987).

Download references

Author information

Authors and Affiliations

  1. SICS, Swedish Institute of Computer Science, Box 1263, S-164 28, Kista, Sweden

    Khayri A. M. Ali & Roland Karlsson

Authors
  1. Khayri A. M. Ali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland Karlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ali, K.A.M., Karlsson, R. Full prolog and scheduling or-parallelism in muse. Int J Parallel Prog 19, 445–475 (1990). https://doi.org/10.1007/BF01397627

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words

Search

Navigation