Show simple item record

Using Community Detection Algorithms to Identify Clusters of Ranks in an MPI Application Based on the Communication Matrix

dc.creatorCalvo-Sánchez, Manfred
dc.creatorMeneses, Esteban
dc.date2019-08-16
dc.date.accessioned2021-06-11T01:32:48Z
dc.date.available2021-06-11T01:32:48Z
dc.identifierhttps://revistas.tec.ac.cr/index.php/memorias/article/view/4518
dc.identifier10.18845/mct.v0i0.4518
dc.identifier.urihttp://hdl.handle.net/2238/13111
dc.descriptionIn 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.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherInstituto Tecnológico de Costa Ricaes-ES
dc.relationhttps://revistas.tec.ac.cr/index.php/memorias/article/view/4518/4090
dc.sourceMemorias de congresos TEC; 2017: III Jornadas Costarricenses de Investigación en Computación e Informáticaes-ES
dc.source9978-9930
dc.source10.18845/mct.2017.0
dc.titleUsing Community Detection Algorithms to Identify Clusters of Ranks in an MPI Application Based on the Communication Matrixes-ES
dc.typeartículo original


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Portal de Memorias de Congresos [68]
    Aquí se publican las memorias de actividades académicas (congresos, conferencias, simposios, etc.) organizadas por alguna dependencia del Instituto Tecnológico de Costa Rica.

Show simple item record