Advertisement

Study of a parallel inference machine for parallel execution of logic programs

  • Gao Yaoqing
  • Sun Chengzheng
  • Hu Shouren
Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 457)

Abstract

This paper presents a parallel inference machine called RAP/LOP-WAM, which is a parallel extension of the WAM to support Restricted AND- and Limited OR-Parallelism. The RAP/LOP-WAM is based on the OR-forest description. It handles Restricted AND-Parallelism through procedure-level and clause-level analysis at compiler-time, and simple run-time checks to identify independent goals of the body of a clause. It exploits OR-parallelism under the limit of the number of processors.

Keywords

Logic Programming WAM OR-Forest Description Restricted AND Parallelism Limited OR Parallelism RAP/LOP-WAM 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [Sun86]
    Sun Chengzheng and Tzu Yungui, The OR-forest Description for the Execution of Logic Programs. Lec. Notes in Computer Sci., the Proc. of the 3rd Int,1 Conference on Logic Programming, July, 1986.Google Scholar
  2. [Lloyd84]
    Lloyd, J.W. Foundations of Logic Programming, Springer-Verlag, Germany, 1984.Google Scholar
  3. [DeGoot84]
    D. DeGroot, Restricted AND-Parallelism. Proc. of the Int'l. Conf. on Fifth Generation Computer System, Nov. 1984.Google Scholar
  4. [Ciepielewski83]
    A. Ciepeielewski, and S. Haridi, Control of Activities in an OR-Parallel Token Machine, Proc. of Logic Programming Workshop 83, July, 1983.Google Scholar
  5. [Hermengildo86]
    M. V. Hermengildo, An Abstract Prolog Machine based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel. Ph. D thesis, The University of Texas at Austin, 1986.Google Scholar
  6. [Conery83]
    Conery. J. S., The AND/OR model for parallel interpretation of Logic Programs. Ph.D thesis, Dept. of Infor. and Computer Sci., UC Irvine, 1983.Google Scholar
  7. [Warren83]
    D. H. Warren, An Abstract Prolog Instruction Set. Technical Note 309, SRI International, AI Center, Computer Science and Technology Division, 1983.Google Scholar
  8. [Gao89]
    Gao Yaoqing and Hu Shouren, Design of a Parallel Abstract Machine Based on the RAP-PSOF Parallel Model of Logic Programs. Proc. of Int'l Conf. on Computer and Communication, Beijing, 1989.Google Scholar
  9. [Gao88]
    Gao Yaoqing, A RAP/LOP-WAM Parallel Abstract Instruction Set. Tech. Report. Changsha Institute of Technology. 1988.Google Scholar
  10. [Gao89(b)]
    Gao Yaoqing, Hu Shouren, A Memory Management Scheme for Supporting Parallel Execution of Logic Program. Journal of Macro and Small Computer System. Vol. 8, China.Google Scholar
  11. [Gao89(c)]
    Gao Yaoqing, Hu Shouren, RAP/LOP:A Restricted AND-and Limited OR-Parallel Execution Model. Journal of Computer Engineering and Application, Vol. 9, China, 1989.Google Scholar
  12. [Hausman87]
    B. Hausman, A. Ciepielewski, and S. Haridi, OR-parallel Prolog made efficient on shared memory multiprocessors. In The 1987 Int'l Symp. on Logic Programming, San Francisco, California, IEEE 1987.Google Scholar
  13. [Hwang89]
    Zhiyi Hwang and Shouren Hu, A Compiling Approach for Exploiting And-parallelism in Parallel Logic Programming Systems, Proc. of Parallel Architecture and Language, Europe, 1989.Google Scholar
  14. [Warren87]
    David H. D. Warren, The SRI Model for OR-Parallel Execution of Prolog—Abstract Design and Implementation Issues. In The 1987 Int'l Sym. on LP, San Francisco, CA, IEEE, 1987.Google Scholar
  15. [Chang85]
    Chang, J.-H., Despain, A. M. and DeGroot, D. And-parallelism of Logic Programs based on a Static Data Dependency Analysis, COMPCON 85, pp. 218–225, Feb., 1985.Google Scholar
  16. [Tung86]
    Tung, Yu-Wen and Moldovan, Dan I. Detection of And-Parallelism in Logic Programming, Proc. of the 1986 Int. Conf. on Parallel Processing, IEEE, 1986, pp.984–991.Google Scholar
  17. [Mellish81]
    Mellish, C. S. The Automatic Generation of Mode Declarations for Prolog Programs, DAI Research paper 163, Dept. of Artificial Intelligence, Univ. of Edinburgh (August 1981).Google Scholar
  18. [Mellish85]
    Mellish, C. S., Some Global Optimization for a Prolog Compiler, J. Logic Programming, 1985.Google Scholar
  19. [Bruynooghe87]
    Bruynooghe, M., Abstract Interpretation: Towards the Global Optimization of Prolog Programs, Proc. of the 1987 Symp. on Logic programming. San Francisco, Aug. 1987, IEEE Computer Soc., 1987.Google Scholar
  20. [Debray86]
    Debray, S. and Warren, D, S., Mode Inference, Proc. of the 1986 Symp. on Logic Programming, Salt Lake City, IEEE Computer Soc. Press, 1986.Google Scholar
  21. [Borgwart]
    P. Borgwart, Parallel Prolog Using Stack Segments on Shared-Memory Multiprocessor. Proc. of 1984 Int'l. Symp. on Logic Programming, Atlantic City.Google Scholar
  22. [Shen86]
    K. Shen, An Investigation of the Argonne Model of OR-parallel Prolog. Master's thesis, Univ. of Manchester, 1986.Google Scholar
  23. [Sun86]
    Sun, Chengzheng and Ci, Yungui, PSOF: A Process Model Based on the OR-forest Description, Proc. of the Int'l Conference on Computer and Communication, 1986, Beijing.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Gao Yaoqing
    • 1
  • Sun Chengzheng
    • 1
  • Hu Shouren
    • 1
  1. 1.Department of Computer ScienceChangsha Institute of TechnologyChangshaP.R.China

Personalised recommendations