An approach for matching communication patterns in parallel applications

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).

[1]  Kiyoko F. Aoki-Kinoshita,et al.  Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees , 2003, ISAAC.

[2]  Horst Bunke,et al.  A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs , 2002, SSPR/SPR.

[3]  David J. Lilja,et al.  Characterization of Communication Patterns in Message-Passing Parallel Scientific Application Programs , 1998, CANPC.

[4]  Andy C. Downton,et al.  Performance of parallel communication and spawning primitives on a Linux cluster , 2006, Cluster Computing.

[5]  Reza Zamani,et al.  Communication Characteristics of Message-Passing Scientific and Engineering Applications , 2005, IASTED PDCS.

[6]  Geoffrey C. Fox,et al.  A Low-Level Communication Library for Java HPC , 2005, ICA3PP.

[7]  Jeffrey S. Vetter,et al.  Statistical scalability analysis of communication operations in distributed applications , 2001, PPoPP '01.

[8]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[9]  Jeffrey S. Vetter,et al.  An Empirical Performance Evaluation of Scalable Scientific Applications , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[10]  Peter Willett,et al.  Use of a maximum common subgraph algorithm in the automatic identification of ostensible bond changes occurring in chemical reactions , 1981, J. Chem. Inf. Comput. Sci..

[11]  Jeffrey S. Vetter,et al.  Communication characteristics of large-scale scientific applications for contemporary cluster architectures , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[12]  Nikitas J. Dimopoulos,et al.  Efficient communication using message prediction for clusters of multiprocessors , 2002, Concurr. Comput. Pract. Exp..

[13]  Marcello Pelillo,et al.  Matching graphs by pivoting , 2003, Pattern Recognit. Lett..

[14]  Charles E. Heckler,et al.  Applied Multivariate Statistical Analysis , 2005, Technometrics.

[15]  David H. Bailey,et al.  The Nas Parallel Benchmarks , 1991, Int. J. High Perform. Comput. Appl..

[16]  J. Shalf,et al.  Understanding ultra-scale application communication requirements , 2005, IEEE International. 2005 Proceedings of the IEEE Workload Characterization Symposium, 2005..

[17]  Leonid Oliker,et al.  Analyzing Ultra-Scale Application Communication Requirements for a Reconfigurable Hybrid Interconnect , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[18]  Nikitas J. Dimopoulos,et al.  Efficient Communication Using Message Prediction for Cluster Multiprocessors , 2000, CANPC.

[19]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[20]  Leonid Oliker,et al.  Science-driven system architecture: A new process for leadership class computing , 2004 .

[21]  Peter Willett,et al.  Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..

[22]  Shi-Jinn Horng,et al.  Auditing Causal Relationships of Group Multicast Communications in Group-Oriented Distributed Systems , 2004, The Journal of Supercomputing.