{"title":"虫洞交换片上网络无死锁动态路由","authors":"Li-Wei Wang","doi":"10.1109/ICCCAS.2010.5581858","DOIUrl":null,"url":null,"abstract":"A new deadlock-free dynamic routing algorithm is proposed for wormhole-switched network-on-chip. Introducing the concept of multilevel congestion-aware mechanism which conveys more accurate feedback information about network congestion status than the DyAD routing, the proposed algorithm adopt proper routing algorithm to forward packets according to the current congestion level. Simulation results show that the proposed algorithm outperforms DyAD and other routing algorithms in average packet latency and saturation point, especially under heavy traffic loads.","PeriodicalId":199950,"journal":{"name":"2010 International Conference on Communications, Circuits and Systems (ICCCAS)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Deadlock-free dynamic routing in wormhole-switched network-on-chip\",\"authors\":\"Li-Wei Wang\",\"doi\":\"10.1109/ICCCAS.2010.5581858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new deadlock-free dynamic routing algorithm is proposed for wormhole-switched network-on-chip. Introducing the concept of multilevel congestion-aware mechanism which conveys more accurate feedback information about network congestion status than the DyAD routing, the proposed algorithm adopt proper routing algorithm to forward packets according to the current congestion level. Simulation results show that the proposed algorithm outperforms DyAD and other routing algorithms in average packet latency and saturation point, especially under heavy traffic loads.\",\"PeriodicalId\":199950,\"journal\":{\"name\":\"2010 International Conference on Communications, Circuits and Systems (ICCCAS)\",\"volume\":\"2014 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Communications, Circuits and Systems (ICCCAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCAS.2010.5581858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Communications, Circuits and Systems (ICCCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCAS.2010.5581858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Deadlock-free dynamic routing in wormhole-switched network-on-chip
A new deadlock-free dynamic routing algorithm is proposed for wormhole-switched network-on-chip. Introducing the concept of multilevel congestion-aware mechanism which conveys more accurate feedback information about network congestion status than the DyAD routing, the proposed algorithm adopt proper routing algorithm to forward packets according to the current congestion level. Simulation results show that the proposed algorithm outperforms DyAD and other routing algorithms in average packet latency and saturation point, especially under heavy traffic loads.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
