Skip to main content

Parallelizing Prolog on shared-memory multiprocessors

  • Conference paper
  • First Online:
Book cover Processing Declarative Knowledge (PDK 1991)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 567))

Included in the following conference series:

  • 177 Accesses

Abstract

The research goal is to design and evaluate a parallel computer system to execute logic programs in both AND-parallel and OR-parallel. In this paper, we first introduce the OR-forest description. Then we provide a brief overview of the OR-forest-based parallel model RAP/LOP and its parallel abstract machine. We focus on the issues relevant to the parallelization of Prolog at compile-time. The simulation system of the RAP/LOP-PIM has been implemented on the SUN workstation and VAX 11/780.

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. Baron, U., de Kergommeaux, J.C., Hailperin, M., Ratcliffe, M., Robert, P., Syre, J.C. and Westphal, H., “The Parallel ECRC PROLOG System PEPSys: an Overview and Evaluation Results,” in Proc. of Int'l Conf. on FGCS 1988.

    Google Scholar 

  2. J.-H. Chang, A. M. Despain and D. DeGroot, “And-parallelism of logic programs based on a static data dependency analysis,” COMPCON 85, San Francisco, Feb., 1985.

    Google Scholar 

  3. A.Ciepielewski, and S.Haridi, “Control of Activities in an OR-Parallel Token machine,” Proc. of logic programming workshop 83, July, 1983.

    Google Scholar 

  4. Conery. J.S., “The AND/OR model for parallel interpretation of Logic Programs,” Ph.D thesis, Dept. of Infor. and Comp. Sci., UC Irvine, 1983.

    Google Scholar 

  5. S.K. Debray and D.S. Warren, “Automatic Mode Inference for Prolog Programs,” Journal of Logic Programming, 207–229, Sept. 1988.

    Google Scholar 

  6. S.K. Debray, Nai-Wei Lin and M.Hermenegildo, “Task Granularity Analysis in Logic Programs,” Proc. of the ACM SIGPLAN'90 Conf. on Programming Language Design and Implementation. White Plains, New York, Jun.,1990.

    Google Scholar 

  7. D. DeGroot, “Restricted And-parallelism,” Proc. of the Int'l Conf. on FGCS, Tokyo, Nov. 1984.

    Google Scholar 

  8. D. DeGroot, “A technique for compiling execution graph expressions for restricted And-parallelism in logic programs,” Proc. of the 1987 Int'l Supercomputing Conf., Athens, Greece, (June 1987).

    Google Scholar 

  9. Gao Yaoqing, “A RAP/LOP-WAM Parallel Abstract Instruction Set,” Tech. Report. Changsha Institute of Technology. 1988.

    Google Scholar 

  10. Gao Yaoqing, Sun Chengzheng and Hu Shouren, “Study of a Parallel Inference Machine for Parallel Execution of Logic Programs,” Int'l Joint Conf. on Vector and Parallel Processing, Zurich, Switzerland, Nov. 1990.

    Google Scholar 

  11. Gao Yaoqing, Hu Shouren and Sun Chengzheng, “Design and Implementation of a Parallel Abstract Machine Model RAP/LOP-WAM for Parallel Execution of Logic Programs,” Proceedings of an International Conference on Information Processing, Tokyo, Japan, Oct. 1990.

    Google Scholar 

  12. Gopal Gupta, “Compiled And-Or Parallelism on Shared Memory Multiprocessor,” Logic Programming: Proc. of the North American Conf., 1988.

    Google Scholar 

  13. Gregory S., “Parallel Programming in PARLOG, the Language and its Implementation.” Addision Wesley, 1987.

    Google Scholar 

  14. 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 

  15. 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 

  16. Zhiyi Hwang and Shouren Hu, “A Compiling Approach for Exploiting And-parallelism in Parallel logic Programming Systems,” Proc. of the Int'l Conf. on Parallel Architecture and Language, Europe, the Netherlands, 1989.

    Google Scholar 

  17. L.V.Kale, “Completeness and Full Parallelism of Parallel Logic Programming Schemes.” Proc. Fourth IEEE Symp. on Logic Programming, San Francisco, CA,IEEE,1987.

    Google Scholar 

  18. Lusk, E., Warren, D.H.D, Haridi, S., Butler,R., Calderwood, A., Disz, T., Olson, R., Overbeek, R., Stevens, R., Szerdi, P., Brand, P., Carlsson, M., Cipelewski, A. and Hausman, B., “The Aurora OR-Parallel PROLOG System,” in Proc. of Int'l Conf. on FGCS 1988.

    Google Scholar 

  19. Pattie Maes, “Issues in Computational Reflection,” Meta-Level Architectures and Reflection, P.Maes, D.Nardi (Editors), Elsevier Science Publishers B.V., 1988.

    Google Scholar 

  20. C.S. Mellish, “Abstract Interpretation of Prolog Programs,” In 3rd International Conf. on Logic Programming,” Imperial College, Springer-Verlag, July 1986.

    Google Scholar 

  21. K. Muthukumar and M. Hermenegildo, “The CDG, UDG and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism,” TR ACA-ST-023-90, MCC, Austin, TX 78759, 1990.

    Google Scholar 

  22. Sun Chengzheng and Tzu Yungui, “The OR-forest Description for the Execution of Programs.,” Lec. Notes in Computer Sci., the Proc. of the 3rd Int'l Conf. on Logic Programming. July, 1986.

    Google Scholar 

  23. Sun Chengzheng and Ci Yungui, “PSOF: A Process Model Based on the OR-forest Description,” Proc. of the int'l Conf. on Computer and Communication, 1986, Beijing.

    Google Scholar 

  24. E.Tick, “Compile-Time Granularity Analysis for Parallel Logic Programming Languages,” Int'l Conf. on FGCS, Tokey, Japan, 1988.

    Google Scholar 

  25. D.H.Warren, “An Abstract Prolog Instruction Set,” Tech. Note 309, SRI International, AI Center, Computer Sci. and Technology Division, 1983.

    Google Scholar 

  26. David H. D. Warren, “The SRI Model for OR-Parallel Execution of Prolog-Abstract Design and Implementation Issues,” In The 1987 Int'l Symp. on Logic Programming, California, IEEE, 1987.

    Google Scholar 

  27. Yu-Wen Tung and Dan I. Moldovan, “Detection of And-parallelism in logic programming,” Proc. of the 1986 Int'l Conf. on Parallel Processing, IEEE, Pennsylvania, 1986, pp. 984–991.

    Google Scholar 

  28. Ueda K., “Guarded Horn Clauses,” Ph.D. Thesis, Information Engineering Course, Faculty of Engineering, University of Tokey, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Harold Boley Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yaoqing, G., Dingxing, W., Xiaolin, Q., Zhiyi, H., Shouren, H. (1991). Parallelizing Prolog on shared-memory multiprocessors. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013541

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55033-4

  • Online ISBN: 978-3-540-46667-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics