{"title":"A Performance-Enhancing Fault-Tolerant Routing Algorithm for Network-on-Chip in Uniform Traffic","authors":"Arshin Rezazadeh, M. Fathy, Amin Hassanzadeh","doi":"10.1109/AMS.2009.86","DOIUrl":null,"url":null,"abstract":"This paper proposes a performance-enhancing fault-tolerant routing algorithm based on f-cube3 as a new solution for increasing the rate of switched and routed packets in NoCs. The f-cube3 algorithm is a wormhole-switched routing for 2-D mesh networks and has been used for block faults such as f-ring and f-chain. We have enhanced the use of virtual channels per each physical link without adding new extra virtual channel. It is proposed that when a message is not blocked by fault, all virtual channels could be used. We have simulated both f-cube3 and our algorithm for the same conditions; message length, network size, traffic etc. As the simulation results show, our algorithm has a higher saturation point than f-cube3 algorithm. The results also show that our algorithm has more utilization of links and less blocked messages rate than f-cube3.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"15 1","pages":"614-619"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third Asia International Conference on Modelling & Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2009.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper proposes a performance-enhancing fault-tolerant routing algorithm based on f-cube3 as a new solution for increasing the rate of switched and routed packets in NoCs. The f-cube3 algorithm is a wormhole-switched routing for 2-D mesh networks and has been used for block faults such as f-ring and f-chain. We have enhanced the use of virtual channels per each physical link without adding new extra virtual channel. It is proposed that when a message is not blocked by fault, all virtual channels could be used. We have simulated both f-cube3 and our algorithm for the same conditions; message length, network size, traffic etc. As the simulation results show, our algorithm has a higher saturation point than f-cube3 algorithm. The results also show that our algorithm has more utilization of links and less blocked messages rate than f-cube3.