Abstract
In this paper, we focus on the compiling implementation of parallel logic language PARLOG and functional language ML on distributed memory multiprocessors. Under the graph rewriting framework, a Heterogeneous Parallel Graph Rewriting Execution Model (HPGREM) is presented firstly. Then based on HPGREM, a parallel abstract machine PAM/TGR is described. Furthermore, several optimizing compilation schemes for executing declarative programs on transputer array are proposed. The performance statistics on a transputer array demonstrate the effectiveness of our model, parallel abstract machine, optimizing compilation strategies and compiler.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Augustsson, L., Compiling Lazy Functional Language Part II. Ph. D thesis, Department of Computer Science, Chalmers University 1987, Sweden.
Bosco, P. G., Cecahi, C.et al., Logic and Functional Programming on Distributed Memory Architecture. In Proc. of 2nd North-American Conf. on Logic Programming (MIT Press), Oct. 1990.
Clark, K. L. and Gregory, S., PARLOG: a parallel programming in logic.ACM Transactions on Programming Languages and Systems, 1986, 8(1), pp. 1–49.
Cousineau, G., The Categorical Abstract Machine. In Proc. IFIP Conf. on Func. Prog Lang. and Comp. Archi. 1985, pp. 50–64.
Darlington, J. and Reeve, M., ALICE: a multiprocessor reduction machine for the parallel evaluation of applicative language. In Functional Programming Languages and Computer Architecture, Oct. 1981, ACM, pp. 65–76.
Davie, A. J. T.et al., CASE—a lazy version of an SECD machine with a flat environment. Department of Computer Science, University of St Andrew, 1989.
Goldberg, B. E., Multiprocessor execution of functional programs.Int'l J. of Parallel Programming, 1988, 17 (5), pp. 425–473.
Johnsson, T., Paraliel Graph Reduction with the <v, G>-machine. In Proc. of Functional Prog. Lang. and Comp. rchi. 1989, pp. 202–213.
Lin Y. J. and Kumar V., AND-parallel execution of logic programs on a shared-memory multiprocessor.Journal of Logic Programming, Oct. 1991.
Milner, R. and Mitchell, Introduction to Standard ML. Computer Science Department, University of Edinburgh, UK, 1987.
Peyton Jones, S. L.et al., GRIP—A High Performance Architecture for Parallel Graph Reduction. LNCS 274, Sept. 1987, pp. 98–112.
Tian, X. M.,and Wang, D. X., A parallel graph rewriting abstract machine and its efficient execution mechanism. Technical Report, Tsinghua University, Beijing, May, 1991.
Tian, X. M., Wang, D. X., Shen, M. M. and Zheng, W. M., A practical eager-lazy control method for dynamic deriving parallel tasks. Accepted by Journal of Software, China.
Tian, X. M., Wang, D. X., Shen, M. M. and Zheng, W. M., The compile-time partial scheduling strategies for optimizing granularity of parallel graph rewriting.Journal of Computer Science and Technology, 1993, (to appear).
Wang, D. X.et al., A High-Level Compiling Implementation of PARLOG Based on Extended Graph Rewriting. In Proceedings of Tools for Artificial Intelligence 90, Washington. D. C., Nov. 1990.
Author information
Authors and Affiliations
Additional information
This work was partially supported by the National 863 High Technical Grant 863-306-101, the National Doctoral Subject Foandation Grant 0249136.
Rights and permissions
About this article
Cite this article
Shen, M., Tian, X., Wang, D. et al. Optimized parallel execution of declarative programs on distributed memory multiprocessors. J. of Compt. Sci. & Technol. 8, 233–242 (1993). https://doi.org/10.1007/BF02939530
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02939530