Revealing Feasibility of FMM on ASIC: Efficient Implementation of N-Body Problem on FPGA

Computational Science and Engineering(2010)

引用 6|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
efficient implementation,asic,fmm algorithm,revealing feasibility,system generator,application specific integrated circuits,design tool,design tools,high performance computing,fpga based design,computational complexity,fast multipole method algorithm,logic design,n-body problem,impressive performance speedup,common logic,high level modeling,fast multipole method,field programmable gate arrays,simulink,high-level synthesis,fpga application,high level synthesis,performance speedup,complicated application,pipelines,resource management,registers,algorithm design and analysis,hardware,force,n body problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要