Abstract
This paper presents the problem of the explosion of code space in methods for exploiting independent AND-parallelism in parallel logic programming systems, and proposes a scheme to solve it. The scheme can largely reduce the code space with minimal loss of parallelism. Some key algorithms in the scheme are presented in this paper. Finally, we give the experimental results and the preliminary performance analysis on the scheme.
This research was partially supported by the Fok Ying Tung Education Foundation and the Chinese National Natural Science Foundation.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
S.K. Debray and D.S. Warren, Automatic Mode Inference for Prolog Programs, Journal of Logic Programming, 207–229, Sept. 1988.
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'l Conf. on Fifth Generation Computer System, Tokyo, (Nov. 1984) pp. 471–478.
D. DeGroot, A technique for compiling execution graph expressions for restricted And-parallelism in logic programs, Proc. of the 1987 Int'l 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, pp. 218–225.
Yu-Wen Tung and Dan I. Moldovan, Detection of And-parallelism in logic programming, Proc. of the 1986 Int'l Conf. on Parallel Processing, IEEE, Pennsylvania, 1986, pp. 984–991.
H. Xia and W.K. Giloi, A Hybrid Scheme for Detecting AND-Parallelism in Prolog Programs, Proc. of ACM 1988 Int. Conf. on Supercomputing, France, July, 1988.
K. Muthukumar and M. Hermenegildo, Methods for Automatic Compile-time Parallelization of Logic Programs using Independent/Restricted And-parallelism, Technical Report ACA-ST-233-89, MCC, Austin, TX 78759, March 1989.
K. Muthukumar and M. Hermenegildo, The CDG, UDG and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism, Technical Report ACA-ST-023-90, MCC, Austin, TX 78759, 1990.
Gao Yaoqing and Hu Shouren, A RAP/LOP-WAM Abstract Instruction Set, Technical Report, Dept. of Computer Sci., Changsha Inst. of Tech., 1989.
C.S. Melish, Abstract Interpretation of Prolog Programs, In 3rd International Conf. on Logic Programming, pp 463–475, Imperial College, Springer-Verlag, July 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.
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, An Improved CAAP Scheme, Technical Report, Dept. of Computer Sci., Changsha Inst. of Tech., 1989.
Hwang Zhiyi and Hu Shouren, Compilation techniques of parallel inference machines, Journal of Computer Science, 1990(3), China.
Sun Chengzheng and Ci Yungui, An automatic partition algorithm for And-parallel execution in the framework of OR-forest, Proc. of the 2nd Int'l Conf. on Computers and Applications, Beijing, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag
About this paper
Cite this paper
Zhiyi, H., Shouren, H., Chengzheng, S., Yaoqing, G. (1991). Reduction of code space in parallel logic programming systems. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) PARLE '91 Parallel Architectures and Languages Europe. PARLE 1991. Lecture Notes in Computer Science, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54152-7_80
Download citation
DOI: https://doi.org/10.1007/3-540-54152-7_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54152-3
Online ISBN: 978-3-540-47472-2
eBook Packages: Springer Book Archive