Skip to main content
SpringerLink
Log in

Bounded buffer communication in Concurrent Prolog

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Concurrent Prolog is a logic-based parallel programming language which was designed and implemented experimentally in Prolog by E. Shapiro. In this paper, we examine the expressive power of communication mechanism based on shared logical variables and show that the language can express both unbounded buffer and bounded buffer stream communication only by shared logical variables and read-only annotation. We will also present the abstraction technique which hides buffer control such as unbounded and bounded inside stream operations and makes it invisible from user programs.

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. Shapiro, E. Y., “A Subset of Concurrent Prolog and Its Interpreter,”ICOT Technical Report, TR-003, 1983.

  2. Clark, K. L. and Gregory, S., “A Relational Language for Parallel Programming,”Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture, 1981.

  3. Clark, K. L. and Gregory, S., “PARLOG: Parallel Programming in Logic,”Research Report, DOC 84/4, April, 1984.

  4. Takeuchi, A. and Furukawa, K., “Interprocess Communication in Concurrent Prolog,”Proceedings of Logic Programming Workshop ’83, Albufeira Portugal, 1983.

  5. Hellerstein, L. and Shapiro, E., “Implementing Parallel Algorithm in Concurrent Prolog: The MAXFLOW Experience,”1984 International Symposium on Logic Programming, Atlantic City, 1984.

  6. Shapiro, E. and Mierowski, C., “Fair, Biased and Self-Balancing Merge Operators: Their Specification and Implementation in Concurrent Prolog,”New Generation Computing,Vol. 2,No. 3, 1984.

  7. van Emden, M. H. and de Lucena, G. J., “Predicate logic as a programming language for parallel programming,” inLogic Programming (K. L. Clark, S. Å. Tärnlund, eds.), Academic Press, 1982.

Download references

Author information

Authors and Affiliations

  1. ICOT Research Center, Institute for New Generation Computer Technology, Mita-Kokusai Bldg. 21F, 1-4-28, Mita, Minato-ku, 108, Tokyo, Japan

    Akikazu Takeuchi & Koichi Furukawa

Authors
  1. Akikazu Takeuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koichi Furukawa
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Takeuchi, A., Furukawa, K. Bounded buffer communication in Concurrent Prolog. NGCO 3, 145–155 (1985). https://doi.org/10.1007/BF03037066

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation