Skip to main content
SpringerLink
Log in

Full or-parallemism and restricted And-parallelism in BTM

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

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. DeGroot D. Restricted And-parallelism. Proc of Int'l Conf on Fifth Generation Computer System, 1984, pp. 471–478.

  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.

  3. DeGroot D. Restricted And-parallelism and side effects. Proc of the Fourth Symp on Logic Programming, San Francisco CA, 1987, pp. 80–89.

  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.

  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.

    Article  MathSciNet  Google Scholar 

  6. Li P P, Martin A J. The Sync model: A parallel execution method for logic programming. 1986 Symp on Logic Programming.

  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.

  8. Kale L V. The REDUCE-Or process model for parallel evaluation of logic programs. Proc Fourth Int'l Conf on Logic Programming, 1987.

  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.

  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.

  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.

  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.

  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.

  14. Lusk Eet al. The Aurora Or-parallel Prolog system.New Generation Computing, 1990, 7.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Nanjing University, 210008, Nanjing

    Zheng Yuhua, Xie Li & Sun Zhongxiu

Authors
  1. Zheng Yuhua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xie Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sun Zhongxiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zheng, Y., Xie, L. & Sun, Z. Full or-parallemism and restricted And-parallelism in BTM. J. of Comput. Sci. & Technol. 9, 373–381 (1994). https://doi.org/10.1007/BF02943584

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation