Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Architectures and Languages Europe

PARLE 1989: PARLE '89 Parallel Architectures and Languages Europe pp 133–150Cite as

Pruning and scheduling speculative work in or-parallel Prolog

  • Submitted Presentations
  • Conference paper
  • First Online:

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

Abstract

When or-parallel Prolog is implemented on a multiprocessor system care must be taken to preserve the sequential semantics of the Prolog extralogical predicates. One of predicates which needs such attention is cut. We propose an algorithm for execution of cut which minimizes the amount of speculative work allowed. We also propose an algorithm for assessing speculativeness of available work with the corresponding scheduling strategy.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ralph Butler, Terry Disz, E. L. Lusk, Robert Olson, Ross Overbeek and Rick Stevens. Scheduling Or-Parallelism: an Argonne Perspective. In Proceedings of the Fifth International Logic Programming Conference and Fifth Symposium on Logic Programming 1988, MIT Press, August 1988.

    Google Scholar 

  2. Alan Calderwood. Aurora-the Manchester Scheduler. Internal Report, Gigalips Project, May 1988.

    Google Scholar 

  3. Mats Carlsson. Internals of Sicstus Prolog Version 0.6. Internal Report, Gigalips Project, November 1987.

    Google Scholar 

  4. Bogumil Hausman. Side-Effects Predicates in Or-Parallel Execution Model of Parallel Prolog. SICS, Working Paper, January 1988.

    Google Scholar 

  5. Bogumil Hausman, Andrzej Ciepielewski and Alan Calderwood. Cut and Side-Effects in Or-Parallel Prolog. In Proceedings of International Conference on Fifth Generation Computer Systems 1988, pages 831–840, ICOT, November 1988.

    Google Scholar 

  6. Bogumil Hausman, Andrzej Ciepielewski and Seif Haridi. Or-Parallel Prolog Made Efficient on Shared Memory Multiprocessors. In Proceedings of the 1987 Symposium on Logic Programming, pages 69–79, 1987.

    Google Scholar 

  7. Ewing Lusk, David H. D. Warren, Seif Haridi, Ralph Butler, Alan Calderwood, Terrence Disz, Robert Olson, Ross Overbeek, Rick Stevens, Peter Szeredi, Per Brand, Mats Carlsson, Andrzej Ciepielewski and Bogumil Hausman. The Aurora Or-Parallel Prolog System. In Proceedings of International Conference on Fifth Generation Computer Systems 1988, pages 819–830, ICOT, November 1988.

    Google Scholar 

  8. David H. D. Warren. Scheduling Speculative Work in Or-Parallel Prolog. Personal communication, September 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Bogumil Hausman

Authors
  1. Bogumil Hausman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eddy Odijk Martin Rem Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hausman, B. (1989). Pruning and scheduling speculative work in or-parallel Prolog. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-51285-3_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51285-1

  • Online ISBN: 978-3-540-46184-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation