The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2009)
Rome, Italy
May 23, 2009 to May 29, 2009
ISBN: 978-1-4244-3751-1
pp: 1-12
Chao Ma , Department of Computer Science, National University of Singapore, Singapore
Yong Meng Teo , Department of Computer Science, National University of Singapore, Singapore
Verdi March , Department of Computer Science, National University of Singapore, Singapore
Naixue Xiong , College of Computer Science&Technology, Wuhan University, China
Ioana Romelia Pop , Department of Computer Science, National University of Singapore, Singapore
Yan Xiang He , College of Computer Science&Technology, Wuhan University, China
Simon See , Asia-Pacific Science and Technology Center, Sun Microsystems, Inc., China
ABSTRACT
Interprocessor communication is an important factor in determining the performance scalability of parallel systems. The communication requirements of a parallel application can be quantified to understand its communication pattern and communication pattern similarities among applications can be determined. This is essential for the efficient mapping of applications on parallel systems and leads to better interprocessor communication implementation among others. This paper proposes a methodology to compare the communication pattern of distributed-memory programs. Communication correlation coefficient quantifies the degree of similarity between two applications based on the communication metrics selected to characterize the applications. To capture the network topology requirements, we extract the communication graph of each applications and quantities this similarity. We apply this methodology to four applications in the NAS parallel benchmark suite and evaluate the communication patterns by studying the effects of varying problem size and the number of logical processes (LPs).
INDEX TERMS
CITATION

Y. M. Teo et al., "An approach for matching communication patterns in parallel applications," 2009 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), Rome, 2009, pp. 1-12.
doi:10.1109/IPDPS.2009.5161035
334 ms
(Ver 3.3 (11022016))