Exploiting Coarse Grain Parallelism with Parallel Recognition Compiler
How to analyze serial codes and automatically find itsparallelism for generating parallel codes to execute on large scale machines is a problem concerned by parallel recognition compiler. For communications between nodes by using message mechanism on distributed memory machines, we need to exploit coarse grain parallelism of serial codes to avoid losing parallel incomings due to expensive communications between computation nodes. In this paper, we present the major compilation passes used in our parallel recognition compiler. This compiler takes a sequential program as input and automatically translates it into parallel code, which can be compiled by the native parallel compiler and run on the target machine.
parallel recognition compiler parallelization analyses computation and data decomposition code generation
Lin Han Jianmin Pang Rongcai Zhao Ning Qi
National Digital Switching System Engineering &Technological R&D Center Zhengzhou, Henan China
国际会议
杭州
英文
243-245
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）