Abstract
Exploiting and-parallelism is important in the research of parallel execution of logic programs. In this paper, we present a compiling approach for exploiting and-parallelism in logic programming. The approach consists of three phases: analysis of entry modes; derivation of exit modes; and determination of execution graph expressions. Compared with other approaches [2,4,5], this approach, with the compile-time program-level data-dependence analysis of logic programs, can efficiently exploit and-parallelism in logic programs. Two precompilers, based on our approach and DeGroot's [3] respectively, have been implemented in SES-PIM system [19]. Through compiling and running some typical benchmarks in SES-PIM, we conclude that our approach can exploit the maximum and-parallelism under "producer-consumer" scheme, exactly, the same degree as the dynamic approach [20] once employed in SES-PIM, and needs significantly less dynamic overhead than DeGroot's while exploiting more and-parallelism than DeGroot's.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Conery, J. S. The AND/OR model for parallel interpretation of logic programs Ph.D. Th. Dept. of Infor. and Computer Sci. UC, Irvine, 1983.
DeGroot, D. Restricted And-Parallelism Proc. of the Inter. Conf. on Fifth Generation Computer System (Nov. 1984) pp. 471–478.
DeGroot, D. A Technique for Compiling Execution Graph Expressions for Restricted And-Parallelism in Logic Programs Proc. of the 1987 Inter. Supercomputing Conf. (June 1987).
Chang, J.-H., Despain, A. M. and DeGroot, D. And-parallelism of Logic Programs based on a static data dependency analysis COMPCON 85, pp. 218–225, Feb., 1985.
Tung, Yu-Wen and Moldovan, Dan I. Detection of And-Parallelism in Logic Programming Proc. of the 1986 Int. Conf. on Parallel Processing, IEEE, 1986, pp. 984–991.
Clark, K. L. and Gregory, S. PARLOG: parallel programming in logic Research report DOC 84/4, Imperial College, London, England.
Shapiro, E. Y. A Subset of Concurrent Prolog and its Interpreter ICOT. Technical Report: TR-003 (Feb., 1983).
Pollard, G. H. Parallel Execution of Horn Clause Programs Ph.D. Th., Univ. of London, Imperial College of Sci. & Tech., U.K., 1987.
Kowalski, R. Predicate Logic as Programming Language Proc. of IFIP Congress, North Holland Publishing Company, Amsterdam, pp. 569–574, 1974.
Warren, D. H. D. An Abstract Prolog Instruction Set Technical Note 309, SRI International, AI center, Computer Science and Technology Division, 1983.
Melish, C. S. The Automatic Generation of Mode Declarations for Prolog Programs DAI Research paper 163, Dept. of Artificial Intelligence, Univ. of Edinburgh (August 1981).
DeGroot, D. Restricted And-Parallelism and Side-effects in Logic Programming in Supercomputers and AI Machines, Kai Hwang and Doug DeGroot Editors, McGraw-Hill, 1988.
Hermenegildo, M. V. An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs Proc. of the 3rd Inter. Conf. on Logic Programming (July, 1986)
Warren, D. H. D. The SRI Model for Or-parallel Execution of Prolog—Abstract Design and Implementation Issues Proc. of the 1987 Inte. Symposium on Logic Programming, San Francisco, California, IEEE, pp.92–102, 1987.
Hausman, B., Ciepielewski, A. and Haridi, S. Or-parallel Prolog made efficient on shared memory multiprocessors Proc. of the 1987 Inte. Symposium on Logic Programming, San Francisco, California, IEEE, pp.69–79, 1987.
Gao, Yaoqin and Hu, Shouren Design of a Parallel Abstract Machine based on the RAP-PSOF Parallel Model of Logic Programs to appear in Proc. of International Conference on Computer and Communication, Beijing, 1989.
Sun, Chengzheng and Ci, Yungui The OR-forest Description for the Execution of Logic Programs Lecture Notes in Computer Science, the Proc. of the Third International Conference on Logic Programming (July, 1986), pp.710–717.
Sun, Chengzheng and Ci, Yungui PSOF: A Process Model Based on the OR-forest Description Proc. of the International Conference on Computer and Communication, 1986, Beijing.
Sun, Chengzheng and Ci, Yungui SES-PIM: A Simulation and Experiment System for PIM-PSOF the Second National Conference on Logic Programming, 1986, China.
Sun, Chengzheng and Ci, Yungui An Automatic Partition Algorithm for And-parallel Execution in the Framework of OR-forest Proc. of the Second International Conference on Computers and Applications, 1987, Beijing.
Hwang, Zhiyi and Hu, Shouren A Compiling Approach for Exploiting And-Parallelism in Logic programming Proc. of the 1988 Annual Conference of National Artificial Intelligence Federation, 1988, China.
Hwang, Zhiyi and Hu, Shouren Analysis of RAP the Third National Conference on Logic Programming, 1987, China.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, Z., Hu, S. (1989). A compiling approach for exploiting and-parallelism in parallel logic programming systems. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_50
Download citation
DOI: https://doi.org/10.1007/3-540-51285-3_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51285-1
Online ISBN: 978-3-540-46184-5
eBook Packages: Springer Book Archive