Geodesic
Mapping parallel programs onto multicore computers by recurrent neural networks
Prikladnaâ diskretnaâ matematika, no. 2 (2013), pp. 50-58
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of mapping a parallel program with weighted vertices (processes) and edges (interprocess exchanges) onto a weighted graph of the distributed computer system is considered. An algorithm for solving this problem based on the use of Hopfield networks is proposed. The algorithm has been tested on mapping a number of graphs of parallel programs onto multicore computer. Experiments have shown that the proposed algorithm provides well-balanced sub-optimal mappings.
Keywords: graphs of parallel programs, multicore systems, neural networks, Hopfield networks. 
@article{PDM_2013_2_a5,
     author = {M. S. Tarkov},
     title = {Mapping parallel programs onto multicore computers by recurrent neural networks},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {50--58},
     year = {2013},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2013_2_a5/}
}
TY  - JOUR
AU  - M. S. Tarkov
TI  - Mapping parallel programs onto multicore computers by recurrent neural networks
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2013
SP  - 50
EP  - 58
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/PDM_2013_2_a5/
LA  - ru
ID  - PDM_2013_2_a5
ER  - 
%0 Journal Article
%A M. S. Tarkov
%T Mapping parallel programs onto multicore computers by recurrent neural networks
%J Prikladnaâ diskretnaâ matematika
%D 2013
%P 50-58
%N 2
%U http://geodesic.mathdoc.fr/item/PDM_2013_2_a5/
%G ru
%F PDM_2013_2_a5
M. S. Tarkov. Mapping parallel programs onto multicore computers by recurrent neural networks. Prikladnaâ diskretnaâ matematika, no. 2 (2013), pp. 50-58. http://geodesic.mathdoc.fr/item/PDM_2013_2_a5/

[1] Korneev V. V., Parallelnye vychislitelnye sistemy, Nolidzh, M., 1999, 320 pp.

[2] Bokhari S. H., “On the mapping problem”, IEEE Trans. Comp., C-30:3 (1981), 207–214 | DOI | MR

[3] Tarkov M. S., “Vlozhenie struktur parallelnykh programm v struktury zhivuchikh raspredelennykh vychislitelnykh sistem”, Avtometriya, 39:3 (2003), 84–96

[4] Osovskii S., Neironnye seti dlya obrabotki informatsii, Finansy i statistika, M., 2002, 344 pp.

[5] Melamed I. I., “Neironnye seti i kombinatornaya optimizatsiya”, Avtomatika i telemekhanika, 1994, no. 11, 3–40 | MR | Zbl

[6] Smith K. A., “Neural networks for combinatorial optimization: a review of more than a decade of research”, INFORMS J. Computing, 11:1 (1999), 15–34 | DOI | MR | Zbl

[7] Hung D. L., Wang J., “Digital hardware realization of a recurrent neural network for solving the assignment problem”, Neurocomputing, 51 (2003), 447–461 | DOI

[8] Karypis G., Kumar V., “Multilevel $k$-way partitioning scheme for irregular graphs”, J. Parallel and Distributed Computing, 48 (1998), 96–129 | DOI