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.

No abstract

Abstract:In this paper, a heuristic Dynamic Spiral Mapping (DSM) algorithm for 2-D mesh topologies is proposed. Based on the DSM we have presented two different approaches: the Full Dynamic Spiral Mapping (FDSM) and the Partial Dynamic Spiral Mapping (PDSM). To compare the efficacy of the algorithm, the reconfiguration time of the FDSM and PDSM are compared. The experimental results of almost 100 simple and complex scenarios with synthetic traffic profiles reveal that in 82% of simulation cases, the PDSM has less reconfiguration time comparing to the FDSM.

Abstract:In this paper, a heuristic mapping algorithm which maps tasks, using priority lists and the crinkle moving pattern is proposed. To evaluate this algorithm, a set of real (i.e. Video Object Plan Decoder) and random applications have been used and the results have been compared. By reducing the number of hops between IP cores, the energy consumption and the completion time of the application (time which all tasks in the task graph execute wholly) have been optimized. Compared to other mapping algorithms, the algorithm execution time (due to its low complexity) is considerably lower.