{"title":"一种基于noc的高性能死锁避免路由算法","authors":"Zhaohui Song, Guangsheng Ma, Dalei Song","doi":"10.1109/IMSCCS.2008.39","DOIUrl":null,"url":null,"abstract":"To help optimize Network-on-Chip (NoC) communication performance while ensuring deadlock avoidance routing, a high performance deadlock avoidance routing algorithm in routing table based NoC routers is presented, a cycle in channel dependency graph expressing NoCpsilas routing communication can be broken by restricting the routing function of some node while ensuring destination reachability of each communication pair to avoid the deadlock. Performance evaluation is demonstrated that the proposed deadlock avoidance routing algorithm have higher performance.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A NoC-Based High Performance Deadlock Avoidance Routing Algorithm\",\"authors\":\"Zhaohui Song, Guangsheng Ma, Dalei Song\",\"doi\":\"10.1109/IMSCCS.2008.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To help optimize Network-on-Chip (NoC) communication performance while ensuring deadlock avoidance routing, a high performance deadlock avoidance routing algorithm in routing table based NoC routers is presented, a cycle in channel dependency graph expressing NoCpsilas routing communication can be broken by restricting the routing function of some node while ensuring destination reachability of each communication pair to avoid the deadlock. Performance evaluation is demonstrated that the proposed deadlock avoidance routing algorithm have higher performance.\",\"PeriodicalId\":122953,\"journal\":{\"name\":\"2008 International Multi-symposiums on Computer and Computational Sciences\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Multi-symposiums on Computer and Computational Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2008.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Multi-symposiums on Computer and Computational Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2008.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A NoC-Based High Performance Deadlock Avoidance Routing Algorithm
To help optimize Network-on-Chip (NoC) communication performance while ensuring deadlock avoidance routing, a high performance deadlock avoidance routing algorithm in routing table based NoC routers is presented, a cycle in channel dependency graph expressing NoCpsilas routing communication can be broken by restricting the routing function of some node while ensuring destination reachability of each communication pair to avoid the deadlock. Performance evaluation is demonstrated that the proposed deadlock avoidance routing algorithm have higher performance.