Skip to main content
Springer Nature Link
Log in

Fast execution mechanisms of parallel inference engine PIE: PIEpelined goal rewriting and goal multicasting

  • Conference paper
  • First Online:
Logic Programming '86 (LP 1986)

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

Included in the following conference series:

  • 133 Accesses

Abstract

PIE is a highly parallel inference machine which executes logic programs based on the goal rewriting model. Goal rewriting makes goals completely independent and reduces access conflict, although it accompanies a substantial copying overhead. To cope with this overhead, two new execution mechanisms are proposed and evaluated. These methods are effective especially to raise parallelism quickly and to exploit other kind of parallelism in programs where OR-parallelism is not high.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Moto-oka,T., Tanaka,T., Aida,H., Maruyama,T. and Hirata,K., "The Architecture of a Parallel Inference Engine-PIE-", FGCS'84, ICOT, 1984.

    Google Scholar 

  2. Goto,A., Tanaka.H. and Moto-oka,T., "Highly Parallel Inference Engine PIE — Goal Rewriting Model and Machine Architecture —", New Generation Computing, Vol.2, OHMSHA and Springer-Verlag, 1984.

    Google Scholar 

  3. Yuhara, M.Aida,H., Tanaka,H. and Moto-oka,T., "Unify Processor and its Reduction Algorithm of the Highly Parallel Inference Engine — PIE (Japanese)", Technical Research Report, EC83-30, IECE of Japan, 1983.

    Google Scholar 

  4. Yuhara,M., Koike,H., Tanaka,H. and Moto-oka,T., "A Unify Processor Pilot Machine for PIE", Proc. of the Logic Programming Conference '84, Tokyo, 1984.

    Google Scholar 

  5. Tick,E. and Warren,D.H.D., "Towards a Pipelined Prolog Processor", International Symposium on Logic Programming, IEEE, 1984.

    Google Scholar 

  6. Warren,D.H.D., "An Abstract Prolog Instruction Set", Tech. report 309, A.I.Center, SRI International, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Faculty of Engineering, The University of Tokyo, 7-3-1, Hongo Bunkyo-ku, 113, Tokyo, Japan

    Hanpei Koike & Hidehiko Tanaka

Authors
  1. Hanpei Koike
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hidehiko Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eiiti Wada

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koike, H., Tanaka, H. (1987). Fast execution mechanisms of parallel inference engine PIE: PIEpelined goal rewriting and goal multicasting. In: Wada, E. (eds) Logic Programming '86. LP 1986. Lecture Notes in Computer Science, vol 264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18024-9_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-18024-9_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47712-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics