%0 Journal Article
%T Research on delay-aware NoC mapping method<br>面向时延的NoC映射技术研究
%A YI Hong-bo
%A LUO Xing-guo
%A CHEN Tao
%A LIU Jing
%A SANG Xiao-dan
%A <br>易宏波
%A 罗兴国
%A 陈　韬
%A 刘　静
%A 桑晓丹
%J 计算机应用研究
%D 2012
%I 
%X Due to the delay in NoC task mapping is difficult to predict,and the low efficiency in heuristic algorithm.This paper proposed an improved delay model and nearest-neighbor random genetic algorithm(NNRGA).It constructed the NoC mapping delay model from the macroscopic link load distribution and the single node queue latency.Different mapping schemes influenced the performance of delay through importing delay factor and weight coefficient,the model avoided the difficulty to model communicating delay in NoC accurately.This paper proposed a method to construct initial population of genetic algorithm based on the thought of nearest neighbor and random.It used NNRGA to realize the delay-aware NoC mapping.And the efficiency increased by nearly 20% compared with the classical genetic algorithm when achieving the global optimum situation.the experimental results show that the algorithm is better than the classical genetic algorithm and random mapping algorithm.
%K NoC
%K mapping
%K delay model
%K nearest neighbor and random
%K genetic algorithm<br>片上网络
%K 映射
%K 时延模型
%K 近邻随机
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=924F7D591EA7595E60351620855DF2DB&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=B31275AF3241DB2D&sid=DE0AF300CE67E651&eid=B74F270320BE8FD5&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11