Advertisement

New Generation Computing

, Volume 9, Issue 3–4, pp 233–256 | Cite as

The &-Prolog system: Exploiting independent and-parallelism

  • M. V. Hermenegildo
  • K. J. Greene
Special Issue

Abstract

The &-Prolog system, a practical implementation of a parallel execution model for Prolog exploiting strict and non-strict independent and-parallelism, is described. Both automatic and manual parallelization of programs are supported. This description includes a summary of the system’s language and architecture, some details of its execution model (based on the RAP-WAM model), and data on its performance on sequential workstations and shared memory multiprocessors, which is compared to that of current Prolog systems. The results to date show significant speed advantages over state-of-the-art sequential systems.

Keywords

Parallelism Logic Programming Prolog Automatic Parallelization Performance Analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1).
    Ali, K. A. M. and Karlsson, R., “The Muse Or-Parallel Prolog Model and Its Performance,” in1990 North American Conference on Logic Programming, MIT Press, Oct. 1990.Google Scholar
  2. 2).
    Biswas, P., Su, S. and Yun, D., “A Scalable Abstract Machine Model to Support Limited-or Restricted and Parallelism in Logic Programs,” inFifth International Conference and Symposium on Logic Programming, pp. 1160–1179, 1988.Google Scholar
  3. 3).
    Brand, P., Haridi, S. and Warren, H. H. D., “Andorra Prolog — The Language and Application in Distributed Simulation,” inInternational Conference on Fifth Generation Computer Systems, Tokyo, Nov. 1988.Google Scholar
  4. 4).
    Carlsson, M.,Sicstus Prolog User’s Manual, Po Box 1263, S-16313 Spanga, Sweden, Feb. 1988.Google Scholar
  5. 5).
    Conery, J. S., “The And/Or Process Model for Parallel Interpretation of Logic Programs,”Ph. D thesis, The University of California At Irvine, 1983.Technical Report, 204.Google Scholar
  6. 6).
    Santos Costa, V., Warren, D. H. D. and Yang, R., “The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model,” in1991 International Conference on Logic Programming, MIT Press, pp. 825–839, June 1991.Google Scholar
  7. 7).
    Cousot P. and Cousot, R., “Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints,” inConf. Rec. 4th Acm Symp. on Prin. of Programming Languages, pp. 238–252, 1977.Google Scholar
  8. 8).
    Debray, S. K., Lin, N.-W. and Hermenegildo, M., “Task Granularity Analysis in Logic Programs,” inProc. of the 1990 ACM Conf. on Programming Language Design and Implementation, ACM Press, June 1990.Google Scholar
  9. 9).
    DeGroot, D., “Restricted AND-Parallelism,” inInternational Conference on Fifth Generation Computer Systems, Tokyo, pp. 471–478, Nov. 1984.Google Scholar
  10. 10).
    Gupta, G., Santos Costa, V., Yang, R. and Hermenegildo, M., “I-updiom: A Model Integrating Dependent-, Independent-, and Or-Parallelism,” in1991 International Logic Programming Symposium, MIT Press, Oct. 1991.Google Scholar
  11. 11).
    Gupta, G. and Hermenegildo, M., “ACE: And/Or-Parallel Copying-Based Execution of Logic Programs,” inICLP’91 Workshop on Parallel Execution of Logic Programs, U. of Bristol, CS Dept., June 1991.Google Scholar
  12. 12).
    Gupta, G. and Jayaraman, B., “Compiled And-Or Parallelism on Shared Memory Multiprocessors,” in1989 North American Conference on Logic Programming, MIT Press, pp. 332–349, Oct. 1989.Google Scholar
  13. 13).
    Hermenegildo, M. and Rossi, F., “On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs,” in1989 North American Conference on Logic Programming, MIT Press, pp. 369–390, Oct. 1989.Google Scholar
  14. 14).
    Hermenegildo, M. V., “An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel,”Ph. D thesis, Dept. of Electrical and Computer Engineering,TR-86-20, Dept. of Computer Science, University of Texas at Austin, Austin, Texas 78712, Aug. 1986.Google Scholar
  15. 15).
    Hermenegildo, M. V., “An Abstract Machie for Restricted AND-Parallel Execution of Logic Programs,” inThird International Conference on Logic Programming, Lecture Notes in Computer Science, Imperial College, Springer-Verlag, pp. 25–40, July 1986.Google Scholar
  16. 16).
    Hermenegildo, M. V., “Relating Goal Scheduling, Precedence, and Memory Management in AND-Parallel Execution of Logic Programs,” inFourth International Conference on Logic Programming, University of Melbourne, MIT Press, pp. 556–575, May 1987.Google Scholar
  17. 17).
    Hermenegildo, M. V. and Nasr, R. I., “Efficient Management of Backtracking in AND-Parallelism,” inThird International Conference on Logic Programming, Lecture Notes in Computer Science, Imperial College, Springer-Verlag, pp. 40–55, July 1986.Google Scholar
  18. 18).
    Hermenegildo, M. V. and Tick, E., “Memory Performance of AND-Parallel Prolog on Shared-Memory Architectures,”New Generation Computing, 7, 1, Oct. 1989.Google Scholar
  19. 19).
    Karp, A. H. and Babb, R. C., “A Comparison of 12 Parallel Fortran Dialects,”IEEE Software, Sept. 1988.Google Scholar
  20. 20).
    Lin, Y.-J., “A Parallel Impelentation of Logic Programs,”Ph. D. thesis, Dept. of Computer Science, University of Texas at Austin, Austin, Texas 78712, Aug. 1988.Google Scholar
  21. 21).
    Muthukumar, K. and Hermenegildo, M., “Compile-Time Derivation of Variable Dependency Using Abstract Interpretation,” to appear in theJournal of Logic Programming (also published asTechnical Report, FIM 59.1/1A/90, Computer Science Dept., Universidad Politécnica de Madrid, Spain, Aug. 1990).Google Scholar
  22. 22).
    Muthukumar, K. and Hermenegildo, M., “Efficient Methods for Supporting Side Effects in Independent And-Parallelism and Their Backtracking Semantics,” in1989 International Conference on Logic Programming, MIT Press, June 1989.Google Scholar
  23. 23).
    Muthukumar, K. and Hermenegildo, M., “The CDG, UDG, and MEL Methods for Automatic Compile-Time Parallelization of Logic Programs for Independent And-Parallelism,” in1990 International Conference on Logic Programming, MIT Press, pp. 221–237, June 1990.Google Scholar
  24. 24).
    Muthukumar K. and Hermenegildo, M., “Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation,” in1991 International Conference on Logic Programming, MIT Press, June 1991.Google Scholar
  25. 25).
    Ramkumar B. and Kale, L. V., “Compiled Execution of the Reduce-OR Process Model on Multiprocessors,” in1989 North American Conference on Logic Programming, MIT Press, pp. 313–331, Oct. 1989.Google Scholar
  26. 26).
    Shen K. and Hermenegildo, M., “A Simulation Study of Or- and Independent And-Parallelism,” in1991 International Logic Programming Symposium, MIT Press, Oct. 1991.Google Scholar
  27. 27).
    Szeredi, P., “Performance Analysis of the Aurora Or-Parallel Prolog System,” in1989 North American Conference on Logic Programming, MIT Press, Oct. 1989.Google Scholar
  28. 28).
    Tick, E.,Memory Performance of Prolog Architectures, Kluwer Academic Publishers, Norwell, MA 02061, 1987.Google Scholar
  29. 29).
    Warren, D. H. D., “An Abstract Prolog Instruction Set,”Technical Report, 309, SRI International, 1983.Google Scholar
  30. 30).
    Warren, D. H. D., “The SRI Model for OR-Parallel Execution of Prolog — Abstract Design and Implementation,” inInternational Symposium on Logic Programming, San Francisco, IEEE Computer Society, pp. 92–102, Aug. 1987.Google Scholar
  31. 31).
    Warren, R., Hermenegildo, M. and Debray, S., “On the Practicality of Global Flow Analysis of Logic Programs,” inFifth International Conference and Symposium on Logic Programming, MIT Press, Aug. 1988.Google Scholar
  32. 2).
    Westphal, H. and Robert, P., “The PEPSys Model: Combining Backtracking, AND-and OR-Parallelism,” inSymp. of Logic Prog., pp. 436–448, Aug. 1987.Google Scholar

Copyright information

© Ohmsha, Ltd. and Springer 1991

Authors and Affiliations

  • M. V. Hermenegildo
    • 1
  • K. J. Greene
    • 2
  1. 1.Facultad de InformáticaUniversidad Politécnica de Madrid (UPM)MadridSpain
  2. 2.MCCAustinUSA

Personalised recommendations