{"title":"运行时高效的fpga硬件软件分区技术","authors":"Kratika Garg, Y. Aung, S. Lam, T. Srikanthan","doi":"10.1109/SOCC.2015.7406912","DOIUrl":null,"url":null,"abstract":"FPGAs with integrated hard processors delivering a combination of performance, power savings and flexibility are becoming leading products in the market. Use of this platform calls for efficient hardware-software partitioning, which is crucial to the overall performance and reliability of these platforms. In this paper, we present a run-time efficient hardware-software partitioning technique for FPGAs called `KnapSim'. It employs two well-known heuristics - 0-1 Knapsack and Simulated Annealing algorithms, and provides near-optimal solutions. Experimental results show that performance of the proposed method is significantly better than Simulated Annealing in terms of quality of results and run-time.","PeriodicalId":329464,"journal":{"name":"2015 28th IEEE International System-on-Chip Conference (SOCC)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"KnapSim - Run-time efficient hardware-software partitioning technique for FPGAs\",\"authors\":\"Kratika Garg, Y. Aung, S. Lam, T. Srikanthan\",\"doi\":\"10.1109/SOCC.2015.7406912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"FPGAs with integrated hard processors delivering a combination of performance, power savings and flexibility are becoming leading products in the market. Use of this platform calls for efficient hardware-software partitioning, which is crucial to the overall performance and reliability of these platforms. In this paper, we present a run-time efficient hardware-software partitioning technique for FPGAs called `KnapSim'. It employs two well-known heuristics - 0-1 Knapsack and Simulated Annealing algorithms, and provides near-optimal solutions. Experimental results show that performance of the proposed method is significantly better than Simulated Annealing in terms of quality of results and run-time.\",\"PeriodicalId\":329464,\"journal\":{\"name\":\"2015 28th IEEE International System-on-Chip Conference (SOCC)\",\"volume\":\"292 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 28th IEEE International System-on-Chip Conference (SOCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCC.2015.7406912\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 28th IEEE International System-on-Chip Conference (SOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCC.2015.7406912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
KnapSim - Run-time efficient hardware-software partitioning technique for FPGAs
FPGAs with integrated hard processors delivering a combination of performance, power savings and flexibility are becoming leading products in the market. Use of this platform calls for efficient hardware-software partitioning, which is crucial to the overall performance and reliability of these platforms. In this paper, we present a run-time efficient hardware-software partitioning technique for FPGAs called `KnapSim'. It employs two well-known heuristics - 0-1 Knapsack and Simulated Annealing algorithms, and provides near-optimal solutions. Experimental results show that performance of the proposed method is significantly better than Simulated Annealing in terms of quality of results and run-time.