Please use this identifier to cite or link to this item:
|Title:||An approach for matching communication patterns in parallel applications||Authors:||Ma, C.
|Issue Date:||2009||Citation:||Ma, C.,Teo, Y.M.,March, V.,Xiongy, N.,Pop, I.R.,He, Y.X.,See, S. (2009). An approach for matching communication patterns in parallel applications. IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium. ScholarBank@NUS Repository. https://doi.org/10.1109/IPDPS.2009.5161035||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). © 2009 IEEE.||Source Title:||IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium||URI:||http://scholarbank.nus.edu.sg/handle/10635/41904||ISBN:||9781424437504||DOI:||10.1109/IPDPS.2009.5161035|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 14, 2019
checked on Mar 31, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.