Communication Optimization Algorithms based on Extend Data Flow Graph

  • Authors:

  • Xue-rong Gong;Zhao Rong-cai;Lin-sheng Lu

  • Affiliations:

  • National Digital Switching System, China;National Digital Switching System, China;Jiangnan Institute of Computing Technology, China

  • Venue:
  • SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reducing communication overhead is extremely important for parallelizing compiler to generate efficient codes for distributed memory machines. In this paper, a redundant parallel execution model (RPEM) is used as the model for target programs. The extend data flow graph is introducedCand optimization algorithms based on the data-flow analysis are discussed. The overhead of data flow analysis can be reduced by performing analysis on the extend data flow graph. The analysis helps to reduce the redundant communication overhead. These optimization algorithms are able to perform inter-loop and inter-procedure analysis. Experimental results prove that these optimizations algorithms are effective in reducing both the number of communications and the communication volume.