Please use this identifier to cite or link to this item:
|Title:||Cellular automata simulations on a FPGA cluster||Authors:||Murtaza, S.
Hoekstra, Alfons G.
Sloot, Peter M. A.
|Issue Date:||2010||Source:||Murtaza, S., Hoekstra, A. G., & Sloot, P. M. A. (2010). Cellular Automata Simulations on a FPGA cluster. International Journal of High Performance Computing Applications, 25(2), 193-204.||Series/Report no.:||International journal of high performance computing applications||Abstract:||The emergence of multicore architectures and the chip industry’s plan to roll out hundreds of cores per die sometime in the near future might have triggered the evolution of von Neumann architectures towards a parallel processing paradigm. The capability to have hundreds of cores per die is exciting, but how optimally we are able to utilize such a resource remains a challenge. Since there are no straightforward solutions we seek inspiration from relevant scientific processes. Cellular automata which are inherently decentralized and spatially extended structures provide a potential candidate among parallel processing alternatives. The availability of spatial parallelism on field programmable gate arrays make them the ideal platform to investigate cellular automata systems as potential parallel processing paradigms on multicore architectures. This article presents a massively parallel implementation for a floating-point-based cellular automata using special purpose hardware such as Field Programmable Gate Array (FPGAs). The challenge is to best map an application to the underlying many-core architecture and address issues such as inter-core communication, scalability, and flexibility both in terms of hardware and software. Maxwell — a 64-node FPGA supercomputer, is used for accelerator implementations that range from a single to a multiple FPGA-enabled system. A performance model is proposed and demonstrated to closely reproduce measured execution times. The performance model enables identification of the main sources of overhead and suggests improvements to the architecture and implementation of the lattice Boltzmann method and compute-bound cellular automata in general. Further, a 2 million cell 2DQ9 lattice Boltzmann method lattice with periodic boundary conditions, simulated using a multiple FPGA chip accelerator implementation, is presented. The performance model shows how the FPGA-enabled PC cluster is the preferred multiple FPGA organization over the multiple FPGA-based PC setup. Latency hiding is fully exploited for PC cluster-based system implementations and demonstrated using system profiling.||URI:||https://hdl.handle.net/10356/95896
|DOI:||10.1177/1094342010383138||Rights:||© 2010 The Authors.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Updated on Jul 16, 2020
Web of ScienceTM
Updated on Mar 6, 2021
Page view(s) 10667
Updated on Sep 28, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.