Scalability analysis of tightly-coupled FPGA-cluster for lattice Boltzmann computation

Yoshiaki Kono, Kentaro Sano, Satoru Yamamoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

This paper presents a performance model of an LBM accelerator to be implemented on a tightly-coupled FPGA cluster. In strong scaling, each accelerator node has a smaller computation as the nodes increase, and consequently communication overhead becomes apparent and limits the scalability. Our tightly-coupled FPGA cluster has the 1D ring of the accelerator-domain network (ADN) which allows FPGAs to send and receive data with low communication overhead. We propose the LBM accelerator architecture and its stream computation appropriate to use ADN. We formulate a sustained-performance model of the accelerator, which consists of three cases depending on one of the resource availability, the network bandwidth and the size of shift-registers. With the model, we show that the network bandwidth is much more important than the memory bandwidth. The wider the network bandwidth is, the more FPGAs can scale the sustained performance in computing a constant size of a lattice. This result demonstrates the importance of ADN in the tightly-coupled FPGA cluster.

Original languageEnglish
Title of host publicationProceedings - 22nd International Conference on Field Programmable Logic and Applications, FPL 2012
Pages120-127
Number of pages8
DOIs
Publication statusPublished - 2012
Event22nd International Conference on Field Programmable Logic and Applications, FPL 2012 - Oslo, Norway
Duration: 2012 Aug 292012 Aug 31

Publication series

NameProceedings - 22nd International Conference on Field Programmable Logic and Applications, FPL 2012

Other

Other22nd International Conference on Field Programmable Logic and Applications, FPL 2012
CountryNorway
CityOslo
Period12/8/2912/8/31

ASJC Scopus subject areas

  • Computer Science Applications

Fingerprint Dive into the research topics of 'Scalability analysis of tightly-coupled FPGA-cluster for lattice Boltzmann computation'. Together they form a unique fingerprint.

Cite this