A Heuristic Rule of Partitioning Irregular Loop for Parallelizing Compilers

摘要：

For irregular applications on distributed-memory systems, computation partition is an important issue on parallel compiling techniques of parallelizing compilers. In this paper, we propose a local optimal solution, called heuristic computes rule (HCR), which could be used for irregular loop partitioning. This rule considers both the iteration being partitioned and the iterations partitioned, which ensures that iterations are assigned so as to produce less communication costs. And HCR rule proposes that irregular loop partitioning should trade off the maximum message degrees of processors, the number of messages, the message sizes, and workload balance. In our experiments, we compare HCR with almost owner computes rule and least communication computes rule. The results show that the executing of irregular loop partitioned by HCR rule has much less communication cost and achieve better performance.

作者: Changjun Hu Yali Liu Jue Wang Jianjiang Li

作者单位: School of Information Engineering, University of Science and Technology Beijing,No. 30 Xueyuan Road, School of Information Engineering, University of Science and Technology Beijing,No. 30 Xueyuan Road, School of Information Engineering,University of Science and Technology Beijing,No. 30 Xueyuan Road,H School of Information Engineering, University of Science and Technology Beijing,No. 30 Xueyuan Road,

会议类型: 国际会议

会议名称: The Second International Conference on High Performance Computing and Applications(第二届高性能计算及应用国际会议)

会议地点: 上海

会议语种:英文

页码: 177-182

在线出版日期: 2009-08-10（万方平台首次上网日期，不代表论文的发表时间）