Geodesic
Optimizing processes mapping for tasks with non-uniform data exchange run on cluster with different interconnects
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 4 (2015) no. 2, pp. 5-19

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of mapping the parallel task to the nodes of computing cluster is considered. MPI software with non-uniform communication and heterogeneous interconnect of computing cluster require to appropriate parallel processes mapping for optimization of data exchange. The graph mapping algorithm is developed. It uses parallel program representation as a task graph and cluster topology representation as system graph. The proposed optimization technique is tested on synthetic benchmark and on real QBox software to study its efficiency on large number of computing cores. The positive results of optimization are achieved and the summary is presented in the paper. Speedup of 17-20
Keywords: task mapping, cluster, MPI.
Mots-clés : communication graph 
@article{VYURV_2015_4_2_a0,
     author = {V. V. Getmanskiy and V. S. Chalyshev and D. I. Kryzhanovskiy and E. I. Leksikov},
     title = {Optimizing processes mapping for tasks with non-uniform data exchange run on cluster with different interconnects},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a Vy\v{c}islitelʹna\^a matematika i informatika},
     pages = {5--19},
     publisher = {mathdoc},
     volume = {4},
     number = {2},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURV_2015_4_2_a0/}
}
TY  - JOUR
AU  - V. V. Getmanskiy
AU  - V. S. Chalyshev
AU  - D. I. Kryzhanovskiy
AU  - E. I. Leksikov
TI  - Optimizing processes mapping for tasks with non-uniform data exchange run on cluster with different interconnects
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
PY  - 2015
SP  - 5
EP  - 19
VL  - 4
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VYURV_2015_4_2_a0/
LA  - ru
ID  - VYURV_2015_4_2_a0
ER  - 
%0 Journal Article
%A V. V. Getmanskiy
%A V. S. Chalyshev
%A D. I. Kryzhanovskiy
%A E. I. Leksikov
%T Optimizing processes mapping for tasks with non-uniform data exchange run on cluster with different interconnects
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
%D 2015
%P 5-19
%V 4
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VYURV_2015_4_2_a0/
%G ru
%F VYURV_2015_4_2_a0
V. V. Getmanskiy; V. S. Chalyshev; D. I. Kryzhanovskiy; E. I. Leksikov. Optimizing processes mapping for tasks with non-uniform data exchange run on cluster with different interconnects. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 4 (2015) no. 2, pp. 5-19. http://geodesic.mathdoc.fr/item/VYURV_2015_4_2_a0/