{"title":"基于递归双分区的树状NoC体系结构能量感知映射","authors":"Zhengwei Chang, Guang-ze Xiong, Nan Sang","doi":"10.1109/ICESS.2008.50","DOIUrl":null,"url":null,"abstract":"In this paper, we present an approach to map intellectual property (IP) cores onto tree based network-on-chip (NoC) architecture such that the total communication energy is minimized. We first formulate the problem of energy-aware mapping, and then propose a recursive bipartitioning algorithm to solve it. The proposed technique is an efficient divide-and-conquer approach, based on the Kernighan-Lin mincut bisection heuristic. Experimental results show that the recursive bipartitioning method is very fast and effective, so it is suited to both quick design space exploration and producing excellent results.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Energy-aware Mapping for Tree-based NoC Architectures by Recursive Bipartitioning\",\"authors\":\"Zhengwei Chang, Guang-ze Xiong, Nan Sang\",\"doi\":\"10.1109/ICESS.2008.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an approach to map intellectual property (IP) cores onto tree based network-on-chip (NoC) architecture such that the total communication energy is minimized. We first formulate the problem of energy-aware mapping, and then propose a recursive bipartitioning algorithm to solve it. The proposed technique is an efficient divide-and-conquer approach, based on the Kernighan-Lin mincut bisection heuristic. Experimental results show that the recursive bipartitioning method is very fast and effective, so it is suited to both quick design space exploration and producing excellent results.\",\"PeriodicalId\":278372,\"journal\":{\"name\":\"2008 International Conference on Embedded Software and Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Embedded Software and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICESS.2008.50\",\"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 Conference on Embedded Software and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICESS.2008.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Energy-aware Mapping for Tree-based NoC Architectures by Recursive Bipartitioning
In this paper, we present an approach to map intellectual property (IP) cores onto tree based network-on-chip (NoC) architecture such that the total communication energy is minimized. We first formulate the problem of energy-aware mapping, and then propose a recursive bipartitioning algorithm to solve it. The proposed technique is an efficient divide-and-conquer approach, based on the Kernighan-Lin mincut bisection heuristic. Experimental results show that the recursive bipartitioning method is very fast and effective, so it is suited to both quick design space exploration and producing excellent results.