Spiral: A heuristic mapping algorithm for network on chip
A Mehran, S Saeidi, A Khademzadeh… - IEICE Electronics …, 2007 - jstage.jst.go.jp
A Mehran, S Saeidi, A Khademzadeh, A Afzali-Kusha
IEICE Electronics Express, 2007•jstage.jst.go.jpIn this paper, a heuristic core mapping algorithm for 2-D mesh topologies called Spiral is
proposed. To compare the efficacy of the algorithm, the results of the proposed algorithm are
compared with those of the genetic and random mapping algorithms. The experimental
results of synthetic traffic profiles reveal that the Spiral algorithm improves the reduction in
the energy consumption as well as the speed of performing application compared to those of
the genetic algorithm mapping.
proposed. To compare the efficacy of the algorithm, the results of the proposed algorithm are
compared with those of the genetic and random mapping algorithms. The experimental
results of synthetic traffic profiles reveal that the Spiral algorithm improves the reduction in
the energy consumption as well as the speed of performing application compared to those of
the genetic algorithm mapping.
Abstract
In this paper, a heuristic core mapping algorithm for 2-D mesh topologies called Spiral is proposed. To compare the efficacy of the algorithm, the results of the proposed algorithm are compared with those of the genetic and random mapping algorithms. The experimental results of synthetic traffic profiles reveal that the Spiral algorithm improves the reduction in the energy consumption as well as the speed of performing application compared to those of the genetic algorithm mapping.
jstage.jst.go.jp