Skip to main content

Improving the execution of the dependent and-parallel Prolog DDAS

  • 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))

Abstract

In this paper, a scheme that improves the execution of the Dynamic Dependent And-parallel Scheme, a dependent and-parallel execution model for Prolog, is presented. The main idea is to make further use of dependence information that is already used in the extraction in parallelism to improve the precision of both the forward and backward execution schemes. As the information is already available, no overhead is incurred in obtaining it, and reusing it imposes very small implementation overheads. An abstract machine instruction set which implements these improvements is then presented. This instruction set can also be used to implement other and-parallel logic programming languages, and offers some advantages over previously proposed schemes.

Some of the research reported in this paper was carried out while I was at the Computer Laboratory, University of Cambridge, Cambridge, U.K.

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. H. Ait-Kaci. Warren's Abstract Machine, A Tutorial Reconstruction. The MIT Press, 1991.

    Google Scholar 

  2. M. Carlsson. SICStus Prolog Internals Manual. SICS, 1989.

    Google Scholar 

  3. D. DeGroot. Restricted AND-Parallelism. In Proc. FGCS'84, 1984.

    Google Scholar 

  4. G. Gupta and M. V. Hermenegildo. Recomputation based Implementation of And-Or Parallel Prolog. In Proceedings of FGCS'92, Vol. 2. ICOT, 1992.

    Google Scholar 

  5. M. V. Hermenegildo. An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel. PhD thesis, The University of Texas At Austin, 1986.

    Google Scholar 

  6. M. V. Hermenegildo and K. J. Green. &-Prolog and its Performance: Exploiting Independent And-Parallelism. In Proc. Seventh ICLP. MIT Press, 1990.

    Google Scholar 

  7. M. V. Hermenegildo and F. Rossi. Non-Strict Independent And-Parallelism. In Proc. Seventh ICLP, 1990.

    Google Scholar 

  8. K. Shen. Exploiting And-parallelism in Prolog: the Dynamic Dependent And-parallel Scheme (DDAS). In Proc. Joint ICLP/SLP. MIT Press, 1992.

    Google Scholar 

  9. K. Shen. Studies of And/Or Parallelism in Prolog. PhD thesis, Computer Laboratory, University of Cambridge, 1992.

    Google Scholar 

  10. K. Shen. Implementing Dynamic Dependent And-parallelism. In Proc. Tenth ICLP. MIT Press, 1993.

    Google Scholar 

  11. H. Tebra. Optimistic And-Parallelism in Prolog. PhD thesis, Vrije Universiteit te Amsterdam, 1989.

    Google Scholar 

  12. D. H. D. Warren. An Abstract Prolog Instruction Set. Technical report, SRI International, 1983.

    Google Scholar 

  13. R. Warren, M. V. Hermenegildo, and S. K. Debray. On the Practicality of Global Flow Analysis of Logic Programs. In Proc. Fifth ICLP/SLP, 1988.

    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

Shen, K. (1994). Improving the execution of the dependent and-parallel Prolog DDAS. 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_121

Download citation

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

  • 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