Crinkle: A heuristic mapping algorithm for network on chip

IEICE Electronics Express

Ahmad Khademzadeh¹  Fatemeh Vardi²  Samira Saeidi² 

[1] Iran Telecom Research Center;CE Department, Islamic Azad University, Science & Research Branch

关键词: network on chip;    task graph;    mapping algorithm;    energy consumption;    communication cost;   

DOI  :  10.1587/elex.6.1737

学科分类：电子、光学、磁材料

来源: Denshi Jouhou Tsuushin Gakkai

【 摘 要 】

References(8)Cited-By(3)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.

【 授权许可】

Unknown