Linhuai Tang, Gang Cai, Tao Yin, Yong Zheng, Jiamin Chen
{"title":"fpga上的资源消耗和性能开销优化降低电路","authors":"Linhuai Tang, Gang Cai, Tao Yin, Yong Zheng, Jiamin Chen","doi":"10.1109/ICFPT47387.2019.00049","DOIUrl":null,"url":null,"abstract":"Many scientific and engineering applications involve massive vector operations (such as dot product and matrix multiplication) which can be calculated efficiently by using reduction circuit. However, the low performance and large resource consumption of the reduction circuit limit the ability of the system. In this paper, an optimized reduction circuit with high performance and low resource consumption is proposed, which can handle multiple sets of arbitrary size without pipeline stalling. A new reduction scheduling algorithm is proposed, which consumes fewer cycles and buffer size compared with other methods. Moreover, in order to achieve a high clock frequency, the reduction circuit implements novel status and buffer management modules. The proposed design using a deeply pipelined double-precision floating-point adder as reduction operator is implemented on FPGAs, which achieves at least 1.59 times improvement on area-time product compared with the reported methods.","PeriodicalId":241340,"journal":{"name":"2019 International Conference on Field-Programmable Technology (ICFPT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Resource Consumption and Performance Overhead Optimized Reduction Circuit on FPGAs\",\"authors\":\"Linhuai Tang, Gang Cai, Tao Yin, Yong Zheng, Jiamin Chen\",\"doi\":\"10.1109/ICFPT47387.2019.00049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many scientific and engineering applications involve massive vector operations (such as dot product and matrix multiplication) which can be calculated efficiently by using reduction circuit. However, the low performance and large resource consumption of the reduction circuit limit the ability of the system. In this paper, an optimized reduction circuit with high performance and low resource consumption is proposed, which can handle multiple sets of arbitrary size without pipeline stalling. A new reduction scheduling algorithm is proposed, which consumes fewer cycles and buffer size compared with other methods. Moreover, in order to achieve a high clock frequency, the reduction circuit implements novel status and buffer management modules. The proposed design using a deeply pipelined double-precision floating-point adder as reduction operator is implemented on FPGAs, which achieves at least 1.59 times improvement on area-time product compared with the reported methods.\",\"PeriodicalId\":241340,\"journal\":{\"name\":\"2019 International Conference on Field-Programmable Technology (ICFPT)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Field-Programmable Technology (ICFPT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFPT47387.2019.00049\",\"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 International Conference on Field-Programmable Technology (ICFPT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFPT47387.2019.00049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Resource Consumption and Performance Overhead Optimized Reduction Circuit on FPGAs
Many scientific and engineering applications involve massive vector operations (such as dot product and matrix multiplication) which can be calculated efficiently by using reduction circuit. However, the low performance and large resource consumption of the reduction circuit limit the ability of the system. In this paper, an optimized reduction circuit with high performance and low resource consumption is proposed, which can handle multiple sets of arbitrary size without pipeline stalling. A new reduction scheduling algorithm is proposed, which consumes fewer cycles and buffer size compared with other methods. Moreover, in order to achieve a high clock frequency, the reduction circuit implements novel status and buffer management modules. The proposed design using a deeply pipelined double-precision floating-point adder as reduction operator is implemented on FPGAs, which achieves at least 1.59 times improvement on area-time product compared with the reported methods.