A packet based demand/data driven reduction model for the parallel execution of logic programs

  • Matthew K. O. Lee
Architectural Aspects (Session 3.1)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 237)


This paper presents a computational model for Horn-clause logic programs. OR parallelism and a restricted kind of AND parallelism inherent in such programs are exploited. The model is reduction based and utilizes both data driven and demand driven mechanisms for the efficient use of computational resources and control of parallelism. The binding environment of logical variables in a clause is distributed in nature and a form of back-unification is used to reduce communication traffic in a parallel machine architecture. The model is described in a packet reduction framework which makes it possible for implementation on the range of existing parallel machines supporting packet based reduction model for functional programs.


Logic Program Parallel Machine Goal Statement Parallel Execution Garbage Collection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Moto-oka et al, Challenge for Knowledge Information-Processing Systems, Proceedings of the International Conference on Fifth Generation Systems, North-Holland, Amsterdam, 1982.Google Scholar
  2. 2.
    Clocksin, W. F. and Mellish, C. S.,’ Programming in PROLOG', Springer-Verlag, Berlin, 1981.Google Scholar
  3. 3.
    Kowalski, R. A., Logic for Problem Solving, Elsevier-North Holland, New York, 1979.Google Scholar
  4. 4.
    Robinson, J. A., A Machine-oriented Logic based on the Resolution Principle, Journal of the ACM(12), PP.23–41, 1965.Google Scholar
  5. 5.
    Conery, J. S., The AND/OR Process Model for Parallel Interpretation of Logic Programs, Technical Report 204, University of California, Irvine, June 1983.Google Scholar
  6. 6.
    Dennis, J. B., First Version of a Data Flow Procedure Language, in Lecture Notes in Computer Science, Vol.19, pp.362–376, Springer-Verlag, 1974.Google Scholar
  7. 7.
    Gurd, J. R. and Watson, I., Preliminary Evaluation of a Prototype Dataflow Computer, Proceedings of IFIP 83, Sept 1983.Google Scholar
  8. 8.
    Treleaven, P. C., Brownbridge, D. R., and Hopkins, R. C., Data-Driven and Demand-Driven Computer Architecture, ACM Computing Surveys, 14(1), pp.93–143, March 1982.CrossRefGoogle Scholar
  9. 9.
    Darlington, J. and Reeve, M., ALICE: A Multiprocessor Reduction Machine for the Parallel Evaluation of Applicative Languages, Proceedings of the 1981 ACM Conference on Functional Programming and Computer Architecture.Google Scholar
  10. 10.
    Bundy, A.,’ The Computer Modelling of Mathematical Reasoning', Academic Press, 1983.Google Scholar
  11. 11.
    Watson, I., Watson, P., and Woods, V., Parallel Data-Driven Graph Reduction, Proceedings of IFIP 85, Sept. 1985.Google Scholar
  12. 12.
    Lee, M.K.O., A Packet Based Demand/Data Driven Reduction Model for the Parallel Execution of Logic Programs, Internal Working Paper, Declarative Systems Group, Dept. of Computer Science, The University, Manchester, April, 1986.Google Scholar
  13. 13.
    Hoare, C. A. R., Communicating Sequential Process, Communication of ACM 21(8), pp.666–677, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Matthew K. O. Lee
    • 1
  1. 1.Department of Computer ScienceUniversity of ManchesterManchesterUnited Kingdom

Personalised recommendations