{"title":"片上网络系统中基于aco的死锁感知全自适应路由","authors":"Kuan-Yu Su, Hsien-Kai Hsin, En-Jui Chang, A. Wu","doi":"10.1109/SiPS.2012.14","DOIUrl":null,"url":null,"abstract":"Ant Colony Optimization (ACO) is a problem-solving technique inspired by the behavior of real-world ant colony. ACO-based routing also has high potential on balancing the traffic load in the domain of Network-on-Chip (NoC), where the performance is generally dominated by traffic distribution and routing. Since the pheromone in ACO provides both spatial and temporal network information, we find ACO-based routing suitable for reducing the probability of deadlock and its penalty. With the three schemes inspired by the behavior of ants and named as ACO-based Deadlock-Aware Routing (ACO-DAR), our simulation shows that the occurrence of deadlock can be greatly suppressed and the network performance also improves as a consequence. Moreover, ACO-DAR makes use of the existing hardware of the original ACO-based routing, so the area overhead is minor and ACO-DAR is thus cost-effective.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"ACO-Based Deadlock-Aware Fully-Adaptive Routing in Network-on-Chip Systems\",\"authors\":\"Kuan-Yu Su, Hsien-Kai Hsin, En-Jui Chang, A. Wu\",\"doi\":\"10.1109/SiPS.2012.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ant Colony Optimization (ACO) is a problem-solving technique inspired by the behavior of real-world ant colony. ACO-based routing also has high potential on balancing the traffic load in the domain of Network-on-Chip (NoC), where the performance is generally dominated by traffic distribution and routing. Since the pheromone in ACO provides both spatial and temporal network information, we find ACO-based routing suitable for reducing the probability of deadlock and its penalty. With the three schemes inspired by the behavior of ants and named as ACO-based Deadlock-Aware Routing (ACO-DAR), our simulation shows that the occurrence of deadlock can be greatly suppressed and the network performance also improves as a consequence. Moreover, ACO-DAR makes use of the existing hardware of the original ACO-based routing, so the area overhead is minor and ACO-DAR is thus cost-effective.\",\"PeriodicalId\":286060,\"journal\":{\"name\":\"2012 IEEE Workshop on Signal Processing Systems\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Workshop on Signal Processing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SiPS.2012.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Workshop on Signal Processing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SiPS.2012.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ACO-Based Deadlock-Aware Fully-Adaptive Routing in Network-on-Chip Systems
Ant Colony Optimization (ACO) is a problem-solving technique inspired by the behavior of real-world ant colony. ACO-based routing also has high potential on balancing the traffic load in the domain of Network-on-Chip (NoC), where the performance is generally dominated by traffic distribution and routing. Since the pheromone in ACO provides both spatial and temporal network information, we find ACO-based routing suitable for reducing the probability of deadlock and its penalty. With the three schemes inspired by the behavior of ants and named as ACO-based Deadlock-Aware Routing (ACO-DAR), our simulation shows that the occurrence of deadlock can be greatly suppressed and the network performance also improves as a consequence. Moreover, ACO-DAR makes use of the existing hardware of the original ACO-based routing, so the area overhead is minor and ACO-DAR is thus cost-effective.