[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Mapping parallel programs onto multicore computer systems by Hopfield networks

  • Published:
Optical Memory and Neural Networks Aims and scope Submit manuscript

Abstract

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 is tested on mapping a number of graphs of parallel programs onto multicore computer. Experiments have shown that the proposed algorithm provides a well-balanced sub-optimal mappings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Encyclopedia of Parallel Computing, Padua, D., Ed., Springer, 2011, p. 2176.

    MATH  Google Scholar 

  2. Bokhari, S.H., On the mapping problem, IEEE Trans. Comp., Ser. C, 1981, vol. 30, no. 3, pp. 207–214.

    Article  MathSciNet  Google Scholar 

  3. Tarkov, M.S., Mapping parallel program structures onto structures of distributed computer systems, Optoelectron., Instrument. Data Processing, 2003, vol. 39, no. 3, pp. 72–83.

    Google Scholar 

  4. Haykin, S., Neural Networks. A Comprehensive Foundation, Prentice Hall Inc., 1999, p. 1104.

    MATH  Google Scholar 

  5. Smith, K.A., Neural networks for combinatorial optimization: a review of more than a decade of research, INFORMS J. Comput., 1999, vol. 11, no. 1, pp. 15–34.

    Article  MathSciNet  MATH  Google Scholar 

  6. Tarkov, M.S., The construction of Hamiltonian cycles in graphs of distributed computer systems by recurrent neural networks, Numerical Analysis Appl., 2010, vol. 3, no. 4, pp. 381–388.

    Article  Google Scholar 

  7. Wang, J., Analysis and design of a recurrent neural network for linear programming, IEEE Trans. Circuits Systems, Ser. I, 1993, vol. 40, no. 9, pp. 613–618.

    Article  MATH  Google Scholar 

  8. Hung, D.L. and Wang, J., Digital hardware realization of a recurrent neural network for solving the assignment problem, Neurocomputing, 2003, vol. 51, pp. 447–461.

    Article  Google Scholar 

  9. Karypis, G. and Kumar, V., Multilevel k-way partitioning scheme for irregular graphs, J. Parallel Distributed Comput., 1998, vol. 48, pp. 96–129.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.V. Rzhanov’s Institute of Semiconductor Physics, Siberian branch, Russian Academy of Sciences, Novosibirsk, Russia

    M. S. Tarkov

Authors
  1. M. S. Tarkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. S. Tarkov.

About this article

Cite this article

Tarkov, M.S. Mapping parallel programs onto multicore computer systems by Hopfield networks. Opt. Mem. Neural Networks 22, 148–155 (2013). https://doi.org/10.3103/S1060992X13030053

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1060992X13030053

Keywords

Search

Navigation