Skip to main content
SpringerLink
Log in

Binding environments for parallel logic programs in non-shared memory multiprocessors

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

Abstract

A method known asclosed environments can be used to represent variable bindings for OR-parellel logic programs without relying on a shared memory or common address space. The representation is based on a procedure that trans-forms stack frames after unification, taking into account problems with common unbound ancestors and shared instances of complex terms. Closed environments were developed for the AND/OR Process Model, but may be applicable to other OR-parallel models.

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. A. Ciepielewski and S. Haridi,Formal Models for Or-Parallel Execution of Logic Programs, CSALAB Working Paper 821121, Royal Institute of Technology Stockholm, Sweden (1982).

    Google Scholar 

  2. A. Ciepielewski and B. Hausman, Performance Evaluation of a Storage Model for OR-Parallel Execution of Logic programs, InProceedings of the 1986 Symposium on Logic Programming, Salt Lake City, Utah, pp. 246–257 (September 1986).

  3. P. Borgwardt, Parallel Prolog using Stack Segments on Shared Memory Multiprocessors, InProceedings of the 1984 International Symposium on Logic Programming, Atlantic City, New Jersey, pp. 2–11 (February 1984).

  4. G. Lindstrom, OR Parallelism on Applicative Architectures, InProceedings of the Second International Logic Programming Conference, Uppsala, Sweden, pp. 159–170 (July 1984).

  5. D. S. Warren, Efficient Prolog Memory Management for Flexible Control Strategies, InProceedings of the 1984 International Symposium on Logic Programming, Atlantic City, New Jersey, pp. 198–202 (February 1984).

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

    Google Scholar 

  7. J. A. Crammond, A Comparative Study of Unification Algorithms for OR-Parallel Execution of Logic Languages, InProceedings of the 1985 International Conference on Parallel Processing, pp. 131–138 (August 1985).

  8. R. J. Swan, S. H. Fuller, and D. P. Siewiorek, Cm*: A Modular, Multi-microprocessor, InProceedings of AFIPS NCC, pp. 637–644 (1977).

  9. C. L. Seitz, The Cosmic Cube,Commun. ACM 28(1):22–33 (January 1985).

    Google Scholar 

  10. A. Gottlieb, R. Grishman, C. P. Kruskal, K. M. McAuliffe, L. Rudolph, and M. Snir, The NYU Ultracomputer-Designing and MIMD Shared Memory Parallel Computer.IEEE Trans. Comput. C-32(2):175–189 (February 1983).

    Google Scholar 

  11. G. F. Pfister and V. A. Norton, “Hot spot” Contention and Combining in Multistage Interconnection Networks, InProceedings of the 1985 International Conference on Parallel Processing, IEEE, pp. 790–797 (August 1985).

  12. M. Ross and K. Ramamohanarao, Paging Strategy for Prolog Based Dynamic Virtual Memory, InProceedings of the 1986 Symposium on Logic Programming, Salt Lake City, Utah, pp. 46–57 (September 1986).

  13. N. More, Implementing the AND/OR Process Model, Master's thesis, University of Oregon (1986).

  14. J. S. Conery and D. M. Meyer,OM: A Virtual Processor for Parallel Logic Programs, Tech. Rep. 87-01, University of Oregon (1987).

  15. M. H. van Emden and R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language,J. ACM 23(4):773–742 (October 1976).

    Google Scholar 

  16. J. S. Conery,The AND/OR Process Model for Parallel Interpretation of Logic Programs, Ph.D. thesis, University of California, Irvine (1983). (Computer and Information Science Tech. Rep. 204.)

    Google Scholar 

  17. M. J. Wise, A Parallel Prolog: The Construction of a Data Driven Model, InConference Record of the Symposium on LISP and Functional Programming, Pittsburgh, Pennsylvania,ACM, pp. 55–66 (1982).

  18. D. H. D. Warren, The SRI Model for OR-Parallel Execution Prolog—Abstract Design and Implementation, InProceedings of the 1987 IEEE Symposium on Logic Programming, San Francisco, California (August 1987).

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

  20. J. S. Conery, Implementing Backward Execution in Nondeterministic AND-Parallel Systems, InProceedings of the Fourth International Conference on Logic Programming, Melbourne, Australia, pp. 633–653 (May 1987).

Download references

Author information

Authors and Affiliations

  1. University of Oregon, Oregon, USA

    John S. Conery

Authors
  1. John S. Conery
    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

Conery, J.S. Binding environments for parallel logic programs in non-shared memory multiprocessors. Int J Parallel Prog 17, 125–152 (1988). https://doi.org/10.1007/BF01383953

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words

Search

Navigation