In this paper, we present a detection technique of and-parallelism in logic programs. The detection consists of three phases: analysis of entry modes, derivation of exit modes and determination of execution graph expressions. Compared with other techniques[2, 4, 5], our 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 technique and DeGroot’s approach respectively, have been implemented in SES- PIM system. Through compiling and running some typical benchmarks in SES- PIM, we conclude that our technique can, in most cases, exploit as much and- parallelism as the dynamic approach does under “producer- consumer” scheme, and needs less dynamic overhead while exploiting more and-parallelism than DeGroot’s approach does.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
J. S. Conery, The AND/OR model for parallel interpretation of logic programs, Ph. D. Th., Dept. of Infor. and Computer Sci., Univ. of California, Irvine, 1983.
D. DeGroot, Restricted And—parallelism, Proc. of the Int ′1 Conf. on Fifth Generation Computer System, Tokyo, Nov. 1984, 471–478.
D. DeGroot, A technique for compiling execution graph expressions for restricted And—parallelism in logic programs, Proc. of the 1987 Int ′1 Supercomputing Conf., Athens, Greece, June 1987.
J.-H.Chang, A. M. Despain and D. DeGroot, And—parallelism of logic programs based on a static data dependency analysis, COMPCON 85, San Francisco, Feb., 1985, 218–225.
Yu-Wen Tung and Dan I. Moldovan, Detection of And—parallelism in logic programming Proc. of the 1986 Int ′1 Conf. on Parallel Processing, IEEE, Pennsylvania, 1986, 984–991.
K. L. Clark and S. Gregory, PARLOG: parallel programming in logic, Research report DOC 84/4, Imperial College, London, U. K.
E. Y. Shapiro, A Subset of Concurrent Prolog and its Interpreter, ICOT. Technical Report: TR-003, Feb., 1983.
C. S. Melish, The automatic generation of mode declarations for Prolog programs, DAI Research paper 163, Dept. of Artificial Intelligence, Univ. of Edinburgh, August 1981, U. K.
D. DeGroot, Restricted And—parallelism and side—effects in logic programming, in Supercomputers and AI Machines, Kai Hwang and Doug DeGroot Editors, McGraw— Hill, 1988.
Sun Chengzheng and Ci Yungui, The OR—forest description for the execution of logic programs, Lecture Notes in Computer Science, Proc. of the 3rd Int ′1 Conf. on Logic Programming, London, July, 1986.
Sun Chengzheng and Ci Yungui PSOF: a process model based on the OR—forest description, Proc. of the Int ′1 Conf. on Computer and Communication, Beijing, 1986.
Sun Chengzheng and Ci Yungui, SES— PIM: a simulation and experiment system for PIM — PSOF, the 2nd National Conf. on Logic Programming, China, 1986.
Sun Chengzheng and Ci Yungui, An automatic partition algorithm for And—parallel execution in the framework of OR—forest, Proc. of the 2nd Int ′1 Conf. on Computers and Applications, Beijing, 1987.
Hwang Zhiyi and Hu Shouren, A compiling approach for exploiting And— parallelism in parallel logic programming systems, Proc. of Parallel Architecture and Language Europe, Netherlands, 1989.
Hwang Zhiyi and Hu Shouren, Analysis of RAP, the 3rd National Conf. on Logic Programming, China, 1987.
This research was partially supported by the Fok Ying Tung Education Foundation.
About this article
Cite this article
Huang, Z., Hu, S. Detection of and-parallelism in logic programs. J. of Comput. Sci. & Technol. 5, 379–387 (1990). https://doi.org/10.1007/BF02945290
- Logic Program
- Logic Programming
- Entry Mode
- Mode Table
- Exit Mode