On accelerating the neighbours lists generation process using field programmable gate arrays

Authors:
Ali M. Al-haj
Affiliations:
Department of Computer Engineering, College of Electrical Engineering, Princess Sumaya University for Technology, Amman, Jordan
Venue:
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Year:
2005

Citing 4
Cited 0

Comparison of two different tree algorithms

Journal of Computational Physics
Tree Data Structures for N-Body Simulation

SIAM Journal on Computing
A performance comparison of tree data structures for N-body simulation

Journal of Computational Physics
Data Search and Reorganization Using FPGAs: Application to Spatial Pointer-based Data Structures

FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

The smoothed particle hydrodynamics (SPH) is an efficient method used in the simulation of astrophysical systems. The most computation-intensive part of SPH is the process of generating neighbours lists for all particles in the simulated astrophysical system. In this paper, we propose two computation-efficient approaches to generate neighbours lists. We also outline their implementations on a hardware platform based on field programmable gate arrays. The FPGA platform will accelerate the neighbours list generation process, eventually leading to high speed simulation of astrophysical systems.