Abstract
The optimization problem of mapping program graphs to parallel distributed memory computers is considered. An algorithm which is based on the self-organizing neural networks is proposed. We tried to apply the ability of Kohonen neural networks to compute a neighbourhood preserving mapping to complicated topologies of program and processor graphs. The goal of the algorithm is to produce an allocation with the minimal communication cost and the computational load balance of processors.
This work is supported by RFBR project N96-01-01632
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monakhov, O.G., Chunikhin, O.Y. (1996). Parallel mapping of program graphs into parallel computers by self-organization algorithm. In: Waśniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds) Applied Parallel Computing Industrial Computation and Optimization. PARA 1996. Lecture Notes in Computer Science, vol 1184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62095-8_56
Download citation
DOI: https://doi.org/10.1007/3-540-62095-8_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62095-2
Online ISBN: 978-3-540-49643-4
eBook Packages: Springer Book Archive