Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based Heterogeneous MPSOCs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Computer Science Issues Année : 2013

Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based Heterogeneous MPSOCs

Résumé

This paper describes a new Spiral Dynamic Task Mapping heuristic for mapping applications onto NoC-based Heterogeneous MPSoC. The heuristic proposed in this paper attempts to map the tasks of an applications that are most related to each other in spiral manner and to find the best possible path load that minimizes the communication overhead. In this context, we have realized a simulation environment for experimental evaluations to map applications with varying number of tasks onto an 8x8 NoC-based Heterogeneous MPSoCs platform, we demonstrate that the new mapping heuristics with the new modified dijkstra routing algorithm proposed are capable of reducing the total execution time and energy consumption of applications when compared to state-of the-art run-time mapping heuristics reported in the literature.
Fichier non déposé

Dates et versions

hal-01198995 , version 1 (14-09-2015)

Identifiants

  • HAL Id : hal-01198995 , version 1

Citer

Abbou El Hassen Benyamina, Mohammed Kamel Benhaoua, Pierre Boulet. Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based Heterogeneous MPSOCs. International Journal of Computer Science Issues, 2013, 10 (4), pp.233--238. ⟨hal-01198995⟩
116 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More