Please use this identifier to cite or link to this item:
|Title:||Floating point based cellular automata simulations using a dual FPGA-enabled system||Authors:||Murtaza, S.
Hoekstra, Alfons G.
Sloot, Peter M. A.
|Issue Date:||2008||Source:||Murtaza, S., Hoekstra, A. G., & Sloot, Peter M. A. (2008). Floating Point based Cellular Automata Simulations using a dual FPGA-enabled system. 2008 Second International Workshop on High-Performance Reconfigurable Computing Technology and Applications, 1-8.||Abstract:||With the recent emergence of multicore architectures, the age of multicore computing might have already dawned upon us. This shift might have triggered the evolution of von Neumann architecture towards a parallel processing paradigm. Cellular Automata- inherently decentralized spatially extended systems consisting of large numbers of simple and identical components with local connectivity, also proposed by von Neumann in 1950s, is the potential candidate among the parallel processing alternatives. The spatial parallelism available on field programmable gate arrays make them the ideal platform to investigate the cellular automata systems as potential parallel processing paradigm on multicore architectures. The authors have been experimenting with this idea for quite some time now and report their progress from a single to a dual FPGA chip based cellular automata accelerator implementation. For D2Q9 Lattice Boltzmann method implementation, we were able to achieve an overall speed-up of 2.3 by moving our Fortran implementation to our single FPGA-based implementations. Further, with our dual FPGA-based implementation, we achieved a speed-up close to 1.8 compared to our single FPGA-based implementation.||URI:||https://hdl.handle.net/10356/83923
|DOI:||10.1109/HPRCTA.2008.4745686||Rights:||© 2008 IEEE.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Conference Papers|
Updated on Dec 4, 2022
Page view(s) 20667
Updated on Dec 8, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.