Mapping parallel programs onto multicore computer systems by Hopfield networks
Mikhail S. Tarkov · Optical Memory and Neural Networks · 2013
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.