loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)
Communication Optimization Algorithms based on Extend Data Flow Graph
Haier International Training Center, Qingdao, China
July 30-August 01
ISBN: 0-7695-2909-7
ASCII Text
x 
 
Xue-rong Gong, Zhao Rong-cai, Lin-sheng Lu, "Communication Optimization Algorithms based on Extend Data Flow Graph," Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on, vol. 3, pp. 3-8, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/SNPD.2007.168,
author = {Xue-rong Gong and Zhao Rong-cai and Lin-sheng Lu},
title = {Communication Optimization Algorithms based on Extend Data Flow Graph},
journal ={Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on},
volume = {3},
year = {2007},
isbn = {0-7695-2909-7},
pages = {3-8},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.168},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
TI - Communication Optimization Algorithms based on Extend Data Flow Graph
SN - 0-7695-2909-7
SP3
EP8
A1 - Xue-rong Gong,
A1 - Zhao Rong-cai,
A1 - Lin-sheng Lu,
PY - 2007
KW - communication optimization
KW - extend data flow graph
KW - control flow graph
KW - data flow analysis
KW - distributed memory systems
VL - 3
JA - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
ER -
 
Xue-rong Gong, National Digital Switching System, China
Zhao Rong-cai, National Digital Switching System, China
Lin-sheng Lu, Jiangnan Institute of Computing Technology, China
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.
Index Terms:
communication optimization, extend data flow graph, control flow graph, data flow analysis, distributed memory systems
Citation:
Xue-rong Gong, Zhao Rong-cai, Lin-sheng Lu, "Communication Optimization Algorithms based on Extend Data Flow Graph," snpd, vol. 3, pp.3-8, 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.