Eliminating redundant communication of code generation for distributed memory machines

被引：0

作者：

Shen, Ya Nan ^{[1
]}

Zhao, Rong Cai ^{[1
]}

Wang, Lei ^{[2
]}

机构：

[1] Natl Digital Switching Syst Engn & Technol R&D Ct, Zhengzhou 450002, Peoples R China

[2] Beijing Univ Aeronaut & Astronaut, Beijing 100083, Peoples R China

来源：

SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 2, PROCEEDINGS | 2007年

关键词：

D O I：

10.1109/SNPD.2007.482

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

How to, eliminate redundant communications is a key issue in developing, parallelizing compilers for distributed' memory, machines. An important way, to) improve the, performance of the code generated by parallelizing compiler in distributed memory systems is to eliminate as much communications as possible. This paper investigates algorithms for generating communications code from previously published work and modifies them to eliminate redundant communications. Based on the mathematical model of symbolic coefficient linear inequalities the revisited formal specification of communications sets are presented and the corresponding improved algorithms are given. Experimental results indicate that the new algorithms can reduce communication messages and improve the performance of parallelized code significantly.

引用

页码：751 / +

页数：2