Using Community Detection Algorithms to Identify Clusters of Ranks in an MPI Application Based on the Communication Matrix
Uloženo v:
| Autoři: | , |
|---|---|
| Médium: | artículo original |
| Stav: | Versión publicada |
| Datum vydání: | 2019 |
| Popis: | In the MPI parallel programming model, communication remains the bottleneck that prevents applications to achieve greater performance and scalability. Due to this problem it is important to know the behavior of this communication in each application. For this reason, we propose the use of community detection algorithms to identify from the communication matrix the clusters of ranks that maximize intracluster communication and minimize intercluster communication. The aim of this project is providing another tool to identify how you can improve the performance of a MPI application. |
| Země: | Portal de Revistas TEC |
| Instituce: | Instituto Tecnológico de Costa Rica |
| Repositorio: | Portal de Revistas TEC |
| Jazyk: | Español |
| OAI Identifier: | oai:ojs.pkp.sfu.ca:article/4518 |
| On-line přístup: | https://revistas.tec.ac.cr/index.php/memorias/article/view/4518 |