Advertisement

Journal of Computer Science and Technology

, Volume 9, Issue 4, pp 373–381 | Cite as

Full or-parallemism and restricted And-parallelism in BTM

  • Zheng Yuhua 
  • Xie Li 
  • Sun Zhongxiu 
Article
  • 12 Downloads

Abstract

BTM is a new And/Or parallel execution model for logic programs which exploits both full Or-parallelism and restricted And-parallelism. The advantages of high parallelism and low run time cost make BTJ, an experimental execution system of BTM implemented on a nonshared-memory multiprocessor system, achieve significant speedup for both And-parallel and Or-parallel logic programs.

Keywords

Full Or-parallelism restricted And-parallelism multi-transputer system nonshared-memory extra-predicates 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    DeGroot D. Restricted And-parallelism. Proc of Int'l Conf on Fifth Generation Computer System, 1984, pp. 471–478.Google Scholar
  2. [2]
    DeGroot D. Restricted And-parallel execution of logic programs. In: Kowalik J S ed. Parallel Computation and Computer for AI, Kluwer Academic Publishers, 1988, pp. 91–107.Google Scholar
  3. [3]
    DeGroot D. Restricted And-parallelism and side effects. Proc of the Fourth Symp on Logic Programming, San Francisco CA, 1987, pp. 80–89.Google Scholar
  4. [4]
    Yow-Jian Lin, Kumar V. Performance of And-parallel execution of logic programs on a shared-memory multi-processor. Proc Int'l Conf on Fifth Generation Computer Systems 1988, ICOT, pp, 851–859.Google Scholar
  5. [5]
    DeGroot D. A technique for compiling execution graph expressions for restricted And-parallelism in logic programs.Journal of Parallel and Distributed Computing, 1988, 5: 494–516.CrossRefMathSciNetGoogle Scholar
  6. [6]
    Li P P, Martin A J. The Sync model: A parallel execution method for logic programming. 1986 Symp on Logic Programming.Google Scholar
  7. [7]
    Ng K W, Leung H F. The competition model for parallel execution of logic programs. Proc Fifth Int'l Conf and Symp on Logic Programming, 1988.Google Scholar
  8. [8]
    Kale L V. The REDUCE-Or process model for parallel evaluation of logic programs. Proc Fourth Int'l Conf on Logic Programming, 1987.Google Scholar
  9. [9]
    Kale L V, Ramkumer B, Shu W. A memory organization independent binding environment for And-parallel execution of logic programs. Proc. Fifth Int'l Conf and Symp on Logic Programming, 1988.Google Scholar
  10. [10]
    Biswas P, Su S-C, Yun D Y Y. A Scalable abstract machine model to support limited-Or(LOR)/restricted-And parallelism (RAP) in logic programs. Proc Fifth Int'l Conf and Symp on Logic Programming, 1988.Google Scholar
  11. [11]
    Biswas P, Tseng C C. A data-driven parallel execution model for logic programs. Proc Fifth Int'l Conf and Symp on Logic Programming, 1988.Google Scholar
  12. [12]
    Westphal H, Robert P, Chassin J, Syre J. The PEPSys model: Combining backtracking, And-and Or-parallelism. Proc IEEE 4th Symp on Logic Programming, San Fransisco, 1987.Google Scholar
  13. [13]
    Warren D H D. The SRI-model for Or-parallel execution of Prolog-abstract design and implementation. Proc IEEE 4th Symp on Logic Programming, San Fransisco, 1987.Google Scholar
  14. [14]
    Lusk Eet al. The Aurora Or-parallel Prolog system.New Generation Computing, 1990, 7.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1994

Authors and Affiliations

  • Zheng Yuhua 
    • 1
  • Xie Li 
    • 1
  • Sun Zhongxiu 
    • 1
  1. 1.Department of Computer ScienceNanjing UniversityNanjing

Personalised recommendations