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. © IEICE 2008.
CITATION STYLE
Mehran, A., Khademzadeh, A., & Saeidi, S. (2008). DSM: A heuristic dynamic spiral mapping algorithm for network on chip. IEICE Electronics Express, 5(13), 464–471. https://doi.org/10.1587/elex.5.464
Mendeley helps you to discover research relevant for your work.