{"title":"片上网络中网格和环面拓扑自适应路由算法的实现及性能分析","authors":"Ajey Amtange, Aditya Hegde, B. Sahana","doi":"10.1109/RTEICT46194.2019.9016386","DOIUrl":null,"url":null,"abstract":"This paper proposes implementation of adaptive West-First and North-Last routing algorithms for torus topology of Network on Chip. A comparative study has been done between Torus and Mesh topology after implementing these algorithms. These live lock and dead lock free turn model algorithms prove to be more efficient in terms of average packet latency for a given injection rate. These turn model algorithms are adaptive in nature as they check for the availability of the free virtual channel in the next router before sending packet to it. If the free channel is not available then the packet is re-routed to another router. They are minimal routing algorithms. The simulation is carried for a 4×4 Torus as well as Mesh topology under similar traffic conditions or injection ratio. It is observed that average hop count for torus got reduced to 3.076 when North-Last or West-First routing algorithm was used, as compared to 3.493 in mesh topology. Saturation injection rate increased by 19.101% in torus when compared with mesh for the same algorithm.","PeriodicalId":269385,"journal":{"name":"2019 4th International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implementation and Performance Analysis of Adaptive Routing Algorithms for Mesh and Torus Topology in Network on Chip\",\"authors\":\"Ajey Amtange, Aditya Hegde, B. Sahana\",\"doi\":\"10.1109/RTEICT46194.2019.9016386\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes implementation of adaptive West-First and North-Last routing algorithms for torus topology of Network on Chip. A comparative study has been done between Torus and Mesh topology after implementing these algorithms. These live lock and dead lock free turn model algorithms prove to be more efficient in terms of average packet latency for a given injection rate. These turn model algorithms are adaptive in nature as they check for the availability of the free virtual channel in the next router before sending packet to it. If the free channel is not available then the packet is re-routed to another router. They are minimal routing algorithms. The simulation is carried for a 4×4 Torus as well as Mesh topology under similar traffic conditions or injection ratio. It is observed that average hop count for torus got reduced to 3.076 when North-Last or West-First routing algorithm was used, as compared to 3.493 in mesh topology. Saturation injection rate increased by 19.101% in torus when compared with mesh for the same algorithm.\",\"PeriodicalId\":269385,\"journal\":{\"name\":\"2019 4th International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 4th International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTEICT46194.2019.9016386\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 4th International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTEICT46194.2019.9016386","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Implementation and Performance Analysis of Adaptive Routing Algorithms for Mesh and Torus Topology in Network on Chip
This paper proposes implementation of adaptive West-First and North-Last routing algorithms for torus topology of Network on Chip. A comparative study has been done between Torus and Mesh topology after implementing these algorithms. These live lock and dead lock free turn model algorithms prove to be more efficient in terms of average packet latency for a given injection rate. These turn model algorithms are adaptive in nature as they check for the availability of the free virtual channel in the next router before sending packet to it. If the free channel is not available then the packet is re-routed to another router. They are minimal routing algorithms. The simulation is carried for a 4×4 Torus as well as Mesh topology under similar traffic conditions or injection ratio. It is observed that average hop count for torus got reduced to 3.076 when North-Last or West-First routing algorithm was used, as compared to 3.493 in mesh topology. Saturation injection rate increased by 19.101% in torus when compared with mesh for the same algorithm.