Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Moto-oka et al, Challenge for Knowledge Information-Processing Systems, Proceedings of the International Conference on Fifth Generation Systems, North-Holland, Amsterdam, 1982.
Clocksin, W. F. and Mellish, C. S.,’ Programming in PROLOG', Springer-Verlag, Berlin, 1981.
Kowalski, R. A., Logic for Problem Solving, Elsevier-North Holland, New York, 1979.
Robinson, J. A., A Machine-oriented Logic based on the Resolution Principle, Journal of the ACM(12), PP.23–41, 1965.
Conery, J. S., The AND/OR Process Model for Parallel Interpretation of Logic Programs, Technical Report 204, University of California, Irvine, June 1983.
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.
Gurd, J. R. and Watson, I., Preliminary Evaluation of a Prototype Dataflow Computer, Proceedings of IFIP 83, Sept 1983.
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.
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.
Bundy, A.,’ The Computer Modelling of Mathematical Reasoning', Academic Press, 1983.
Watson, I., Watson, P., and Woods, V., Parallel Data-Driven Graph Reduction, Proceedings of IFIP 85, Sept. 1985.
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.
Hoare, C. A. R., Communicating Sequential Process, Communication of ACM 21(8), pp.666–677, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, M.K.O. (1986). A packet based demand/data driven reduction model for the parallel execution of logic programs. In: Händler, W., Haupt, D., Jeltsch, R., Juling, W., Lange, O. (eds) CONPAR 86. CONPAR 1986. Lecture Notes in Computer Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16811-7_173
Download citation
DOI: https://doi.org/10.1007/3-540-16811-7_173
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16811-9
Online ISBN: 978-3-540-44856-3
eBook Packages: Springer Book Archive