Skip to main content
SpringerLink
Log in

Compiling CIL rewriting language for multiprocessors

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The high-level Compiler Intermediate Language CIL is a general-purpose description language of parallel graph rewriting computational model intended for parallel implementation of declarative languages on multiprocessor systems. In this paper, we first outline a new Hybrid Execution Model(HEM) and corresponding parallel abstract machine PAM/TGR based on Extended parallel Graph Rewriting Computational Model EGRCM for implementing CIL language on distributed memory multiprocessor systems. Then we focus on the compiling CIL language with various optimizing techniques such as pattern matching, rule indexing, node ordering and compile-time partial scheduling. The experimental results on a 16-node Transputer Array demonstrates the effectiveness of our model and strategies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Augustsson L. Compiling lazy functional language Part II. Ph.D Thesis, Department of Computer Science, Chalmers University, 1987, Sweden.

    Google Scholar 

  2. Burs T H. Clean—A language for function graph rewriting. LNCS 274, Springer-Verlag, Sept. 1987, pp.264–384.

  3. Darlington J, 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.

  4. Fairbair J. TIM—a simple lazy abstract machine to execute supercombinator. In: Proc. IFIP Conf. on Func. Prog. Lang. and Comp. Archi., Springer Verlag, LNCS 274, pp.34–45.

  5. Goldberg B E. Multiprocessor execution of functional programs.Int'l J., of Parallel Programming, 1988, 17(5): 425–473.

    Article  Google Scholar 

  6. Hudak P, Goldberg B E. Serial combinator: optimal grains of parallelism LNCS 201, Springer-Verlag, Sept., 1985, pp.382–388.

  7. Hwang K, Degroot D. Parallel processing for supercomputer and artificial intelligence. McGraw-Hill, 1989.

  8. Johnsson T. Parallel graph reduction with the <v,G>-machine. In: Proc. of Functional Prog. Lang. and Comp. Archi., 1989, pp.202–213.

  9. Kernaway J R. Implementing term rewrite languages in DACTL. Internal Report, SYS-C87-02, London College, Jan. 1987.

  10. Kernaway J R. On ‘On graph rewriting’. Internal Report, SYS-C87-05, London College Jan. 1987.

  11. Milner R, Mitchell H. Introduction to standard ML. Computer Science Department, University of Edinburgh, UK, 1987.

    Google Scholar 

  12. Reyton Jones S Let al. GRIP—A high performance architecture for parallel graph reduction. LNCS 274, Sept. 1987, pp.98–112.

  13. Peyton Jones S Let al. High-performance parallel graph reduction machine. PARLE'89, Springer-Verlag, 1989, pp.184–205.

  14. Tian Xinmin, Wang Dingxing, Shen Meiminget al. Granularity analysis for exploiting adaptive parallelism of declarative programs on multiprocessors. Journal of Comput. Sci. & Technol. 1994, 9(2), pp. 144–152.

    Article  Google Scholar 

  15. Tian Xinmin, Wang Dingxing Shen Meiminget al. Automatic parallelizing of compiled functional and logic languages on the abstract machine PAM/TGR. In: Proceedings of Int'l Computer Symposium ICS'92, Dec. 1992, Taichung, Taiwan.

  16. Tian Xinmin, Wang Dingxing, Shen Meiminget al. An optimized parallel compiler for executing declarative programs on transputer array. In: Proc. of 15th Int'l. Conf. on Transputer and Occam Applications, April, 1992, Aberdeen, UK.

  17. Tian Xinmin, Wang Dingxing, Shen Meiminget al. Parallelizing techniques for compiled declarative languages execution on transputer architecture. In: Proc. of Int'l Conf. on Intelligence Information and System ICIIPS'92, Oct. 1992, PRC.

  18. Wang Dingxinget al., Specification of CIL. Technical Report, Dept. of Comp. Sci. and Tech., Tsinghua University, Beijing, China, Jan. 1989.

    Google Scholar 

  19. Wang Dingxinget al. A high-level compiling implementation of PARLOG based on extended graph rewriting. In: Proc. of Tools for Artificial Intelligence 90, Washington D.C., USA, Nov. 1990.

  20. Watson Pet al. Flagship: A parallel architecture for declarative programming. In: Proc. of the 15th Annual Int'l Symp. on, Comp. Archi., 1988, pp.125–130.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, 100084, Beijing

    Tian Xinmin, Wang Dingxing, Zheng Weimin, Shen Meiming & Li Cheng

Authors
  1. Tian Xinmin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wang Dingxing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zheng Weimin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shen Meiming
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Li Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by the National 863 High-Tech Project Grant 863-306-06-02-1 and the National Natural Science Foundation of China 69303006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, X., Wang, D., Zheng, W. et al. Compiling CIL rewriting language for multiprocessors. J. of Comput. Sci. & Technol. 9, 302–310 (1994). https://doi.org/10.1007/BF02943577

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943577

Keywords

Search

Navigation