Show simple item record

dc.contributor.authorHu, Qi
dc.contributor.authorGumerov, Nail A.
dc.contributor.authorYokota, Rio
dc.contributor.authorBarba, Lorena A.
dc.contributor.authorDuraiswami, Ramani
dc.date.accessioned2015-08-04T07:05:22Z
dc.date.available2015-08-04T07:05:22Z
dc.date.issued2012-11
dc.identifier.citationQi Hu, Nail A. Gumerov, Rio Yokota, Lorena Barba, & Ramani Duraiswami. (2012). Abstract: Scalable Fast Multipole Methods for Vortex Element Methods. 2012 SC Companion: High Performance Computing, Networking Storage and Analysis. doi:10.1109/sc.companion.2012.221
dc.identifier.isbn9780769549569
dc.identifier.doi10.1109/SC.Companion.2012.221
dc.identifier.urihttp://hdl.handle.net/10754/564623
dc.description.abstractWe use a particle-based method to simulate incompressible flows, where the Fast Multipole Method (FMM) is used to accelerate the calculation of particle interactions. The most time-consuming kernelsâ'the Biot-Savart equation and stretching term of the vorticity equationâ'are mathematically reformulated so that only two Laplace scalar potentials are used instead of six, while automatically ensuring divergence-free far-field computation. Based on this formulation, and on our previous work for a scalar heterogeneous FMM algorithm, we develop a new FMM-based vortex method capable of simulating general flows including turbulence on heterogeneous architectures, which distributes the work between multi-core CPUs and GPUs to best utilize the hardware resources and achieve excellent scalability. The algorithm also uses new data structures which can dynamically manage inter-node communication and load balance efficiently but with only a small parallel construction overhead. This algorithm can scale to large-sized clusters showing both strong and weak scalability. Careful error and timing trade-off analysis are also performed for the cutoff functions induced by the vortex particle method. Our implementation can perform one time step of the velocity+stretching for one billion particles on 32 nodes in 55.9 seconds, which yields 49.12 Tflop/s. © 2012 IEEE.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectfast multipole method
dc.subjectheterogeneous algorithm
dc.subjectvortex methods
dc.subjectGPU
dc.titleScalable fast multipole methods for vortex element methods
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtreme Computing Research Center
dc.identifier.journal2012 SC Companion: High Performance Computing, Networking Storage and Analysis
dc.conference.date10 November 2012 through 16 November 2012
dc.conference.name2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012
dc.conference.locationSalt Lake City, UT
dc.contributor.institutionUniversity of Maryland Institute for Advanced Computer Studies (UMIACS), Fantalgo LLC, Elkridge, MD, United States
dc.contributor.institutionDepartment of Computer Science, University of Maryland, College Park, United States
dc.contributor.institutionFantalgo LLC, Elkridge, MD, United States
dc.contributor.institutionMechanical Engineering Department, Boston University, United States
kaust.personYokota, Rio


This item appears in the following Collection(s)

Show simple item record