RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikl. Diskr. Mat., 2010, Number 4(10), Pages 33–40 (Mi pdm258)  

Mathematical Foundations of Informatics and Programming

On mapping graphs of parallel programs onto graphs of distributed computer systems by recurrent neural networks

M. S. Tarkov

A. V. Rzhanov Institute of Semiconductor Physics of SB RAS, Novosibirsk, Russia

Abstract: A problem of mapping graphs of parallel programs onto graphs of distributed computer systems by recurrent neural networks is formulated. The network parameters providing the absence of incorrect solutions are experimentally determined. By introduction of a penalty coefficient into the Lyapunov function for the program graph edges non-coincided with the edges of the computer system, the optimal solutions are computed for mapping the “line” program graph onto a two-dimensional torus. To increase the optimal solution probability a method of the mapping decomposition is proposed. The method essence is a reduction of the solution matrix to a block-diagonal shape. For exclusion of incorrect solutions in mapping the line onto three-dimensional torus, a recurrent Wang network is used because it is converged more rapidly than the Hopfield network.

Keywords: mapping, graphs of parallel programs, distributed computer systems, Hopfield network, recurrent Wang network.

Full text: PDF file (616 kB)
References: PDF file   HTML file

UDC: 004.032.26(06)

Citation: M. S. Tarkov, “On mapping graphs of parallel programs onto graphs of distributed computer systems by recurrent neural networks”, Prikl. Diskr. Mat., 2010, no. 4(10), 33–40

Citation in format AMSBIB
\Bibitem{Tar10}
\by M.~S.~Tarkov
\paper On mapping graphs of parallel programs onto graphs of distributed computer systems by recurrent neural networks
\jour Prikl. Diskr. Mat.
\yr 2010
\issue 4(10)
\pages 33--40
\mathnet{http://mi.mathnet.ru/pdm258}


Linking options:
  • http://mi.mathnet.ru/eng/pdm258
  • http://mi.mathnet.ru/eng/pdm/y2010/i4/p33

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Прикладная дискретная математика
    Number of views:
    This page:93
    Full text:32
    References:8
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017