Skip to main content
SpringerLink
Log in

Scheduling speculative work in MUSE and performance results

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

Abstract

Work which may later be pruned is called speculative work. In this paper we present and evaluate a simple and efficient strategy, used in the Muse OR-parallel Prolog system, for better scheduling of speculative work. The strategy concentrates workers on the leftmost available work in the Prolog tree as long as there exists enough parallelism, thus emulating the sequential Prolog execution as much as possible. This strategy therefore makes it less probable that unnecessary work is executed. A new cut scheme that reduces the amount of speculative work is also presented. The performance results of our strategy are compared with the performance results of similar strategies implemented in the Aurora OR-parallel Prolog system. The comparison shows that our strategy performs quite well.

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. David H. D. Warren, An Abstract Prolog Instruction Set, Technical Note 309, SRI International (September 1983).

  2. Khayri A. M. Ali and Roland Karlsson, Full Prolog and Scheduling Or-Parallelism in Muse,IJPP 19(6):445–475 (December 1990).

    Google Scholar 

  3. Anthony Beaumont, S. Muthu Raman, Péter Szeredi, and David H. D. Warren, Flexible Scheduling of OR-parallelism in Aurora: The Bristol Scheduler, PARLE91: Conference on Parallel Architectures and Languages Europe, Springer-Verlag, pp. 403–420 (June 1991).

  4. Per Brand, Wavefront scheduling, Internal Report, Gigalips Project (1988).

  5. 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).

  6. 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).

  7. Tony Beaumont and David H. D. Warren, Scheduling Speculative Work in OR-parallel Prolog Systems,Proc. of the 10th Int'l. Conf. on Logic Programming, Budapest-Hungary, pp. 135–149 (June 1993).

  8. Raed Sindaha, The Dharma Scheduler—Definitive Scheduling in Aurora on Multiprocessors Architecture,Proc. of the Fourth IEEE Symp. on Parallel and Distributed Processing, Dallas, Texas, pp. 296–303 (December 1992).

  9. 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).

  10. Khayri A. M. Ali and Roland Karlsson, The Muse Approach to Or-Parallel Prolog,IJPP 19(2):129–162 (April 1990).

    Google Scholar 

  11. David H. D. Warren, WARPLAN: a System for Generating Plans, DCL Memo 76, University of Edinburgh (June 1974).

  12. Helder Coelho and Cotta José,C. Prolog by Example, Springer-Verlag (June 1988).

  13. C. J. Rawlings, W. R. T. Taylor, J. Nyakairu, J. Fox, and M. J. E. Sternberg, Using Prolog to represent and reason about protein structure, Ehud Shapiro, (ed.),Third Int'l Conf. on Logic Programming, London, Springer-Verlag, pp. 536–543 (June 1986).

    Google Scholar 

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

  15. David H. D. Warren, The SRI Model for Or-parallel Execution of Prolog—Abstract Design and Implementation Issues,Proc. of the Symp. on Logic Programming, pp. 92–102 (1987).

  16. Luc Maes, Or-parallel Speedups in a compiled PROLOG engine: Results of the integration of the Muse scheduler in the ProLog by BIM, PEPMA (ESPRIT project 2471) Report, Belgium (December 1992).

  17. Khayri A. M. Ali and Roland Karlsson, OR-parallel Speedups in a Knowledge Based System: on Muse and Aurora,Proc. of FGCS'92 (the Fifth Generation Computer Systems), Tokyo, pp. 739–745 (June 1992).

  18. Khayri A. M. Ali, Roland Karlsson, and Shyam Mudambi, Performance of Muse on Switch-Based Multiprocessor Machines,New Generation Computing,11(1,4):81–103 (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Swedish Institute of Computer Science, SICS, 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. Scheduling speculative work in MUSE and performance results. Int J Parallel Prog 21, 449–476 (1992). https://doi.org/10.1007/BF01379406

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words

Search

Navigation