检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘凌云[1] 王琨[2] 邓植[1] 张碧霞[1] 顾华玺[1]
机构地区:[1]西安电子科技大学ISN国家重点实验室,西安710071 [2]西安电子科技大学计算机学院,西安710071
出 处:《计算机应用研究》2017年第7期1929-1934,共6页Application Research of Computers
基 金:国家自然科学基金资助项目(61472300)
摘 要:映射优化问题是片上网络关键技术之一,其模型的建立及求解影响着片上网络性能。映射问题被证明是NP问题,传统求解具有一定的难度,大多采用启发式算法完成。为了解当前映射优化问题研究现状及发展前景,针对片上网络IP核到网络节点的匹配优化问题进行建模和分类,并对当前研究中的一些典型映射算法在目标、约束条件、性能、采用拓扑结构等方面进行对比分析,最后给出片上网络中映射优化问题未来的研究方向。Mapping optimization problem is one of the key technologies of network-on-chip (NoC) and the solutions of the mapping modeling have important influence on the performance of NoC. Solving the mapping problem which has been proved to be a NP hard problem with traditional methods is difficult so that heuristic algorithms are adopted instead. To find out the present situation and future development in mapping optimization, this paper proposed a general mathematical optimization model and classified the mapping problem of intellectual property (IP) cores map to the nodes on NoC architecture. Then it proposed a number of the typical solution’s analysis and comparison about current mapping algorithms in the view of targets, constraints, performances and topologies. Finally, it presented the further research directions of mapping optimization on NoC.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15