| 基于定向Ford-Fulkerson算法的NoC路径分配 |
| |
| 引用本文： | 夏晓梅,周干民.基于定向Ford-Fulkerson算法的NoC路径分配[J].合肥工业大学学报(自然科学版),2006,29(3):316-321. |
| |
| 作者姓名： | 夏晓梅 周干民 |
| |
| 作者单位： | 1. 上海理工大学,交通运输系统研究中心,上海,200093
2. 合肥工业大学,仪器仪表学院,安徽,合肥,230009 |
| |
| 摘 要： | 文章通过对NoC网络通讯的分析,以及对现有最短路径算法的研究,提出了一种定向Ford-Fulker-son算法,实现了NoC路径分配;在完成处理单元映射后,根据NoC网络的通讯状况,按照通讯任务的时间顺序分配传输路径,使得任意处理单元间的通讯时间最短,且整个系统的执行时间最优。
|
| 关 键 词： | 网络通讯 最短路径算法 定向Ford-Fulkerson算法 路径分配 |
| 文章编号： | 1003-5060(2006)03-0316-06 |
| 修稿时间： | 2005年3月30日 |
NoC routing path allocation based on the directed Ford-Fulkerson algorithm |
| |
| XIA Xiao-mei,ZHOU Gan-min.NoC routing path allocation based on the directed Ford-Fulkerson algorithm[J].Journal of Hefei University of Technology(Natural Science),2006,29(3):316-321. |
| |
| Authors: | XIA Xiao-mei ZHOU Gan-min |
| |
| Abstract: | Based on the thorough analysis of the network communication of the Network-on-Chip(NoC) and study of the shortest path algorithms, a directed Ford-Fulkerson algorithm is proposed in this paper.After having mapped the processing elements onto a NoC,it optimizes the overall executing time by performing routing path allocation based on the network traffic on the NoC. |
| |
| Keywords: | network communication shortest path algorithm directed Ford-Fulkerson algorithm routing path allocation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
