Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Eliminating Redundant Communication of Code Generation for Distributed Memory Machines Haier International Training Center, Qingdao, China July 30-August 01 ISBN: 0-7695-2909-7
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.482
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.
Citation:
Ya Nan Shen, Rong Cai Zhao, Lei Wang, "Eliminating Redundant Communication of Code Generation for Distributed Memory Machines," snpd, vol. 2, pp.751-756, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||