Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Machine Independent AND and OR Parallel Execution of Logic Programs: Part I-The Binding Environment

Published: 01 February 1994 Publication History
  • Get Citation Alerts
  • Abstract

    We describe a binding environment for the AND and OR parallel execution of logicprograms that is suitable for both shared and nonshared memory multiprocessors. Thebinding environment was designed with a view of rendering a compiler using this bindingenvironment machine independent. The binding environment is similar to closedenvironments proposed by J. Conery. However, unlike Conery's scheme, it supports ORand independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel.

    References

    [1]
    {1} U. Baron, J.C. de Kergommeaux, et al. "The Parallel ECRC Prolog System PEPSys: An overview and evaluation results," presented at the Int. Conf. Fifth Generation Comput. Syst., Tokyo, Japan, Nov. 1988.
    [2]
    {2} P. Borgwardt, "Parallel Prolog using stack segments on shared-memory multiprocessors," presented at the Symp. Logic Programming, Feb. 1984.
    [3]
    {3} M. Bruynooghe, "The Memory Management of Prolog Implementations," in Logic Programming. New York: Academic Press, 1979.
    [4]
    {4} R. Butler, E. L. Lusk,et al., "ANLWAM: A parallel implementation of the warren abstract machine," Internal Rep., 1986.
    [5]
    {5} J. H. Chang and A. M. Despain, "Semi intelligent backtracking of Prolog based on a static data dependency analysis," presented at the Symp. Logic Programming, July 1985.
    [6]
    {6} J. H. Chang, A. M. Despain, and D. DeGroot, "AND parallelism of Logic programs based on a static data dependency analysis," in IEEE COMPCON, Feb. 1985.
    [7]
    {7} A. Ciepielewski and S. Haridi, "Control of activities in an an or-parallel token machine," presented at the Symp. Logic Programming, Feb. 1984.
    [8]
    {8} Conery, J. "The AND/OR process model for parallel interpretation of Logic programs" Ph.D. thesis, Dept. of Comput. Sci., Univ. of California-Irvine, 1983.
    [9]
    {9} Conery, J. "Binding environments for parallel logic programs in nonshared memory multiprocessors," in Symp. Logic Programming, Sept. 1987, pp. 457-467.
    [10]
    {10} Conery, J. "OM: A virtual machine for the AND/OR process model," Tech. Rep., Univ. of Oregon, 1988.
    [11]
    {11} J. S. Conery and D. F. Kibler, "AND parallelism in logic programs," presented at the Int. Joint Conf. Artificial Intell., Aug. 1983.
    [12]
    {12} J. A. Crammond, "Comparative study of unificaiton algorithms for OR parallel execution of Logic languages," presented at the Int. Conf. Parallel Processing, Aug. 1985.
    [13]
    {13} D. DeGroot, "Restricted AND parallelism," in Int. Conf. Fifth Generation Comput. Syst., Nov. 1984, pp. 471-478.
    [14]
    {14} W. Fenton, B. Ramkumar, V. A. Saletore, Sinha A. B., L. V. Kalé, "Supporting machine independent programming on diverse parallel architectures," presented at the Int. Conf. Parallel Processing, Aug. 1991.
    [15]
    {15} G. Gupta and B. Jyaraman, "Compiled AND-OR parallelism on shared memory multiprocessors," in North Amer. Conf. Logic Programming, Cleveland, OH, Oct. 1989, pp. 332-349.
    [16]
    {16} G. Gupta and B. Jyaraman, "On criteria for on-parallel execution models of logic programs," In North Amer. Conf. Logic Programming, Austin, TX, Oct. 1990, pp. 737-756.
    [17]
    {17} S. Haridi and P. Brand, "ANDORRA Prolog: An integration of Prolog and committed choice languages," in Int. Conf. Fifth Generation Comput. Syst., Tokyo, Japan, Nov. 1988, pp. 745-754.
    [18]
    {18} B. Hausman, A. Ciepielewski, and S. Haridi, "OR-parallel Prolog made efficient on shared memory multiprocessors," in Symp. Logic Programming , Sept. 1987, pp. 69-79.
    [19]
    {19} M. Hermenegildo and F. Rossi, "On the correctness and efficiency of independent AND parallelism in Logic programs," in North Amer. Conf.n Logic Programming, Oct. 1989, pp. 369-389.
    [20]
    {20} M. V. Hermenegildo, "An abstract machine based execution model for computer architecture design and efficient implementation of Logic programs in parallel," Ph.D. thesis, Dept. of Comput. Sci., Univ. of Texas at Austin, 1986.
    [21]
    {21} L. V. Kalé, "'Completeness' and 'Full Parallelism' of parallel Logic programming schemes," In Symp. Logic Programming, San Francisco, CA, Sept. 1987, pp. 125-133.
    [22]
    {22} L. V. Kalé, "The REDUCE-OR process model for the parallel evaluation of logic programs," in Int. Conf. Logic Programming, Melbourne, May 1987, pp. 616-632.
    [23]
    {23} L. V. Kalé, "The Chare Kernel parallel programming system," presented at the Int. Conf. Parallel Processing, Aug. 1990.
    [24]
    {24} L. V. Kalé and B. Ramkumar, "Joining AND parallel solutions in AND/OR parallel systems," presented at the North Amer. Conf. Logic Programming, Oct. 1990.
    [25]
    {25} S. Kasif, M. Kohli, and J. Minker, "PRISM: A parallel inference system for problem solving," presented at the Int. Joint Conf. Artificial Intell., Karlsruhe, W. Germany, Aug. 1983.
    [26]
    {26} P. P. Li and A. J. Martin, "The Sync Model: A parallel execution method for logic programming," presented at the Symp. Logic Programming, Salt Lake City, UT, Sept. 1986.
    [27]
    {27} Y-J. Lin and V. Kumar, "Performance of AND-parallel execution of logic programs on a shared memory multiprocessor," in Int. Conf. Fifth Generation Comput. Syst., Tokyo, Japan, Nov. 1988, pp. 851-860.
    [28]
    {28} G. Lindstrom, "OR Parallelism on Applicative Architectures," in Int. Conf. Logic Programming, July 1984, pp. 159-170.
    [29]
    {29} C.S. Mellish, "An Alternative to Structure Sharing in the Implementation of a Prolog Interpreter," in Logic Programming. New York: Academic Press, 1979.
    [30]
    {30} S. Mudambi, "Performance of Aurora on a Switch-Based Multiprocessor," presented at the North Amer. Conf. Logic Programming, Oct. 1989.
    [31]
    {31} P. Tinker and G. Lindstrom, "A Performance-Oriented Design for OR-Parallel Logic Programming," in Int. Conf. Logic Programming, May 1987, pp. 601-615.
    [32]
    {32} D. H. D. Warren, "OR parallel execution models of Prolog," in Proc. Int. Joint Conf. Theory and Practice of Software Develop., 1987.
    [33]
    {33} D. H. D. Warren, "The SRI model for OR-parallel execution of Prolog-abstract design and implementation," in Symp. Logic Programming, Sept. 1987, pp. 92-102. (Invited talk.)
    [34]
    {34} D. S. Warren, "Efficient Prolog memory management for flexible control strategies," presented at the Symp. Logic Programming, Feb. 1984.
    [35]
    {35} H. Westphal and P. Robert "The PEPSys model: Combining backtracking, AND and OR parallelism," in Symp. Logic Programming, San Francisco, CA, Sept. 1987, pp. 436-448.
    [36]
    {36} M. J. Wise, Prolog Multiprocessors, int. ed. Englewood Cliffs, NJ: Prentice Hall, 1986.
    [37]
    {37} H. Yasuhara and K. Nitadori, "ORBIT: A parallel computing model of Prolog," New Generation Computing, vol. 2, 1984.

    Cited By

    View all
    • (2007)Regular PaperInternational Journal of High Performance Computing Applications10.1177/109434200707822621:2(222-245)Online publication date: 1-May-2007
    • (2001)Backtracking in Independent And-Parallel Implementations of Logic Programming LanguagesIEEE Transactions on Parallel and Distributed Systems10.1109/71.96912712:11(1169-1189)Online publication date: 1-Nov-2001

    Index Terms

    1. Machine Independent AND and OR Parallel Execution of Logic Programs: Part I-The Binding Environment
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image IEEE Transactions on Parallel and Distributed Systems
      IEEE Transactions on Parallel and Distributed Systems  Volume 5, Issue 2
      February 1994
      113 pages

      Publisher

      IEEE Press

      Publication History

      Published: 01 February 1994

      Author Tags

      1. Chare Kernel
      2. Index Termsmultiprocessing systems
      3. binding environment
      4. compiler
      5. logic programming
      6. logic programs
      7. nonshared memory multiprocessors
      8. parallel execution
      9. parallel programming
      10. shared memory multiprocessors

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 28 Jul 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2007)Regular PaperInternational Journal of High Performance Computing Applications10.1177/109434200707822621:2(222-245)Online publication date: 1-May-2007
      • (2001)Backtracking in Independent And-Parallel Implementations of Logic Programming LanguagesIEEE Transactions on Parallel and Distributed Systems10.1109/71.96912712:11(1169-1189)Online publication date: 1-Nov-2001

      View Options

      View options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media