Task‐based FMM for heterogeneous architectures. (12th December 2015)

• Record Type: Journal Article
• Authors: Agullo, Emmanuel; Bramas, Berenger; Coulaud, Olivier; Darve, Eric; Messner, Matthias; Takahashi, Toru
• Is Part Of: Concurrency and computation. Volume 28:Number 9(2016)
• Page Start: 2608
• Page End: 2629
• Publication Date: 2015-12-12
• Subjects: fast multipole methods -- graphics processing unit -- heterogeneous architectures -- runtime system -- scheduling -- pipeline; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3723
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: High performance fast multipole method is crucial for the numerical simulation of many physical problems. In a previous study, we have shown that task‐based fast multipole method provides the flexibility required to process a wide spectrum of particle distributions efficiently on multicore architectures. In this paper, we now show how such an approach can be extended to fully exploit heterogeneous platforms. For that, we design highly tuned graphics processing unit (GPU) versions of the two dominant operators P2P and M2L) as well as a scheduling strategy that dynamically decides which proportion of subsequent tasks is processed on regular CPU cores and on GPU accelerators. We assess our method with the StarPU runtime system for executing the resulting task flow on an Intel X5650 Nehalem multicore processor possibly enhanced with one, two, or three Nvidia Fermi M2070 or M2090 GPUs (Santa Clara, CA, USA). A detailed experimental study on two 30 million particle distributions (a cube and an ellipsoid) shows that the resulting software consistently achieves high performance across architectures. Copyright © 2015 John Wiley & Sons, Ltd.