Mapping parallel programs onto multicore computer systems by Hopfield networks

Authors:
M. S. Tarkov
Affiliations:
A.V. Rzhanov's Institute of Semiconductor Physics, Siberian branch, Russian Academy of Sciences, Novosibirsk, Russia
Venue:
Optical Memory and Neural Networks
Year:
2013

Citing 5
Cited 0

Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Neural Networks: A Comprehensive Foundation

Neural Networks: A Comprehensive Foundation
Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research

INFORMS Journal on Computing
On the Mapping Problem

IEEE Transactions on Computers
Encyclopedia of Parallel Computing

Encyclopedia of Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

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.