| 注册
首页|期刊导航|重庆邮电大学学报(自然科学版)|一种新的片上网络拥塞感知容错路由算法

一种新的片上网络拥塞感知容错路由算法

吴凤阳 刘勤让

重庆邮电大学学报(自然科学版)2017,Vol.29Issue(2):167-175,9.
重庆邮电大学学报(自然科学版)2017,Vol.29Issue(2):167-175,9.DOI:10.3979/j.issn.1673-825X.2017.02.005

一种新的片上网络拥塞感知容错路由算法

A new congestion-aware fault-tolerant routing algorithm for networks-on-chips

吴凤阳 1刘勤让1

作者信息

  • 1. 国家数字交换系统工程技术研究中心,河南 郑州 450002
  • 折叠

摘要

Abstract

We put forward an effective routing channel selection mechanism to realize the adaptive fault-tolerant routing algorithm with ability of congestion aware on NoC,called CAFR(congestion-aware adaptive fault-tolerant routing algorithm).CAFR algorithm gets the turning probability of each path from the source node to the destination node based on the Up*/Down* routing algorithm;secondly,it gets a weighted link according to the remaining memory time-slot of the endpoint router in each link;finally,the total weight value in each path from the source node to the destination node is calculated according to the weight value of each path and its path turning probability.Experimental results show that the algorithm can maintain a good level on the performance of average latency and average saturation throughput under the condition of trouble-free.Under fault conditions,the algorithm has greatly improved the attenuation of the throughput compared with other algorithms.Especially When the failure rate reach 20%,the algorithm only get 44.32% decay on the throughput,and other fault tolerant algorithms get 48%~70% decay.

关键词

片上网络/拥塞感知/Up*/Down*路由算法/加权链路

Key words

networks-on-chips/congestion aware/Up*/Down* routing algorithm/weighted link

分类

信息技术与安全科学

引用本文复制引用

吴凤阳,刘勤让..一种新的片上网络拥塞感知容错路由算法[J].重庆邮电大学学报(自然科学版),2017,29(2):167-175,9.

基金项目

国家自然科学基金(61572520) (61572520)

The National Nature Science Foundation of China(61572520) (61572520)

重庆邮电大学学报(自然科学版)

OA北大核心CSCDCSTPCD

1673-825X

访问量0
|
下载量0
段落导航相关论文