{"title":"改进可重构纳米结构在线路由性能的方法","authors":"Mahtab Niknahad, M. Hübner, J. Becker","doi":"10.1109/SOCCON.2009.5398093","DOIUrl":null,"url":null,"abstract":"Online routing is the method, for connecting hardware resources on reconfigurable hardware while run-time. In this paper we show how to use the bipartite graph presentation of nano architectures to improve their performance during the online routing. We define the performance optimization problem in online routing and then, by defining a cost function based on the graph presentation, apply a semi simulated annealing to solve this optimization problem. The running order of the cost function computation algorithm is linear and easily applicable in runtime.","PeriodicalId":303505,"journal":{"name":"2009 IEEE International SOC Conference (SOCC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Method for improving performance in online routing of reconfigurable nano architectures\",\"authors\":\"Mahtab Niknahad, M. Hübner, J. Becker\",\"doi\":\"10.1109/SOCCON.2009.5398093\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online routing is the method, for connecting hardware resources on reconfigurable hardware while run-time. In this paper we show how to use the bipartite graph presentation of nano architectures to improve their performance during the online routing. We define the performance optimization problem in online routing and then, by defining a cost function based on the graph presentation, apply a semi simulated annealing to solve this optimization problem. The running order of the cost function computation algorithm is linear and easily applicable in runtime.\",\"PeriodicalId\":303505,\"journal\":{\"name\":\"2009 IEEE International SOC Conference (SOCC)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International SOC Conference (SOCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCCON.2009.5398093\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International SOC Conference (SOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCCON.2009.5398093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Method for improving performance in online routing of reconfigurable nano architectures
Online routing is the method, for connecting hardware resources on reconfigurable hardware while run-time. In this paper we show how to use the bipartite graph presentation of nano architectures to improve their performance during the online routing. We define the performance optimization problem in online routing and then, by defining a cost function based on the graph presentation, apply a semi simulated annealing to solve this optimization problem. The running order of the cost function computation algorithm is linear and easily applicable in runtime.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
