Asynchronous AMR on Multi-GPUs

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Adaptive Mesh Refinement (AMR) is a computational and memory efficient technique for solving partial differential equations. As many of the supercomputers employ GPUs in their systems, AMR frameworks have to be evolved to adapt to large-scale heterogeneous systems. However, it is challenging to employ multiple GPUs and achieve good scalability in AMR because of its complex communication pattern. In this paper, we present our asynchronous AMR runtime system that simultaneously schedules tasks on both CPUs and GPUs and coordinates data movement between different processing units. Our runtime is adaptive to various machine configurations and uses a host resident data model. It helps facilitate using streams to overlap CPU-GPU data transfers with computation and increase device occupancy. We perform strong and weak scaling studies using an Advection solver on Piz Daint supercomputer and achieve high performance.

Cite

CITATION STYLE

APA

Farooqi, M. N., Nguyen, T., Zhang, W., Almgren, A. S., Shalf, J., & Unat, D. (2019). Asynchronous AMR on Multi-GPUs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11887 LNCS, pp. 113–123). Springer. https://doi.org/10.1007/978-3-030-34356-9_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free