Mapping parallel programs onto multicore computers by recurrent neural networks

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