|
Computational nanotechnology, 2015, Issue 4, Pages 18–25
(Mi cn48)
|
|
|
|
TECHNOLOGY COMPUTATIONAL PROCESSING
A comparison of MPI and Charm++ parallel programming technologies on the minimum spanning tree problem
A. V. Mazeev, A. S. Semenov, A. S. Frolov JSC SRCECT
Abstract:
The paper presents implementations of the GHS minimum spanning tree algorithm developed using message passing model (MPI library), message-driven model (Charm++ language), and vertex-centric model in Charm++. The optimized GHS implementations using MPI and Charm++ have approximately the same performance on 32-node cluster, the performance degradation of the implementation in Charm++ vertex-centric model is of 1-2 orders of magnitude.
Keywords:
graphs, supercomputers, MPI, Charm++, MST, GHS.
Citation:
A. V. Mazeev, A. S. Semenov, A. S. Frolov, “A comparison of MPI and Charm++ parallel programming technologies on the minimum spanning tree problem”, Comp. nanotechnol., 2015, no. 4, 18–25
Linking options:
https://www.mathnet.ru/eng/cn48 https://www.mathnet.ru/eng/cn/y2015/i4/p18
|
Statistics & downloads: |
Abstract page: | 349 | Full-text PDF : | 227 | References: | 32 |
|