检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海大学微电子研究与开发中心,上海200072 [2]吉林大学软件学院,长春130012
出 处:《计算机测量与控制》2017年第9期126-129,133,共5页Computer Measurement &Control
摘 要:随着芯片复杂度的不断增大,设计一个高效的片上网络容错路由算法面临着巨大的挑战;由于芯片面积开销的限制,拥有低面积开销的无虚通道片上网络路由器受到学术界的广泛关注;但目前对无虚通道片上网络容错路由算法的研究却停留在容错性能上,而忽略了容错路由算法的路由路径过于单一所造成的负载不均、数据包平均延迟较大等问题;文章在借鉴已有的奇偶转向容错路由算法的基础上,对算法的故障模型和故障绕行策略进行优化,并在算法中融入负载均衡策略,以形成新的容错算法缓解上述问题;在9x9的2D mesh网络中对新提出的算法和参考算法的仿真结果表明:与参考算法相比,新算法在降低数据延迟和吞吐量方面有着明显的优势,在最优情况下能减少8.92%数据延迟和增加10.46%的吞吐量。As structure of chip is becoming more complex, an efficient routing algorithm designed for Network on (;hip has became in creasingly challenging. Currently, the research of fault tolerant routing algorithm without virtual channels mainly focus on routing around fault, but neglects issues of load-balancing and latency caused by communication hotspot and single path between source and destination. To address the problems, a fault-tolerant routing algorithm based on Odd Even turn rules with load-balancing strategy is proposed based on existing OE fault tolerant strategy. The novel algorithm extend Odd Even fault model and Odd-Even fault-tolerant strategy to enhance capacity of fault tolerant and also fuse a load-balance strategy to relieve the issues. The simulation results demonstrate that the proposed algorithm outperforms in average package latency and throughout compared to reference algorithms in the 9×9 2D mesh NoC. In the best case, it reduces 8.92% average delay and increase 10. 46% throughout.
分 类 号:TP336[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3