Zhe Zheng, Yongxin Zhu, Xu Wang, Zhiqiang Que, Tian Huang, X. Yin, Hui Wang, G. Rong, Meikang Qiu
{"title":"揭示FMM在ASIC上的可行性:n体问题在FPGA上的高效实现","authors":"Zhe Zheng, Yongxin Zhu, Xu Wang, Zhiqiang Que, Tian Huang, X. Yin, Hui Wang, G. Rong, Meikang Qiu","doi":"10.1109/CSE.2010.25","DOIUrl":null,"url":null,"abstract":"FPGAs have been improved significantly in terms of performance and capacity over the last 20 years. The scale of FPGA based design also sparked off the demands for high-level synthesis to handle complicated applications. A well known intricate application is the FMM (Fast Multipole Method) algorithm of N-body problem, which is so complicated that it was not implemented on FPGA as reported in literature. In this paper, we take high level modeling and design tools, i.e. Simulink and System Generator to implement major modules in FMM algorithm to solve the N-Body problem on FPGA. Besides the impressive performance speedup on FPGA, we improve the efficiency by merging the circuits for the common logic among modules in the algorithm. Our experience in efficiently implementing the FMM algorithm will be taken as a useful reference for researchers working on FPGA applications as well as high performance computing.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Revealing Feasibility of FMM on ASIC: Efficient Implementation of N-Body Problem on FPGA\",\"authors\":\"Zhe Zheng, Yongxin Zhu, Xu Wang, Zhiqiang Que, Tian Huang, X. Yin, Hui Wang, G. Rong, Meikang Qiu\",\"doi\":\"10.1109/CSE.2010.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"FPGAs have been improved significantly in terms of performance and capacity over the last 20 years. The scale of FPGA based design also sparked off the demands for high-level synthesis to handle complicated applications. A well known intricate application is the FMM (Fast Multipole Method) algorithm of N-body problem, which is so complicated that it was not implemented on FPGA as reported in literature. In this paper, we take high level modeling and design tools, i.e. Simulink and System Generator to implement major modules in FMM algorithm to solve the N-Body problem on FPGA. Besides the impressive performance speedup on FPGA, we improve the efficiency by merging the circuits for the common logic among modules in the algorithm. Our experience in efficiently implementing the FMM algorithm will be taken as a useful reference for researchers working on FPGA applications as well as high performance computing.\",\"PeriodicalId\":342688,\"journal\":{\"name\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSE.2010.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th IEEE International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2010.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Revealing Feasibility of FMM on ASIC: Efficient Implementation of N-Body Problem on FPGA
FPGAs have been improved significantly in terms of performance and capacity over the last 20 years. The scale of FPGA based design also sparked off the demands for high-level synthesis to handle complicated applications. A well known intricate application is the FMM (Fast Multipole Method) algorithm of N-body problem, which is so complicated that it was not implemented on FPGA as reported in literature. In this paper, we take high level modeling and design tools, i.e. Simulink and System Generator to implement major modules in FMM algorithm to solve the N-Body problem on FPGA. Besides the impressive performance speedup on FPGA, we improve the efficiency by merging the circuits for the common logic among modules in the algorithm. Our experience in efficiently implementing the FMM algorithm will be taken as a useful reference for researchers working on FPGA applications as well as high performance computing.