Saved in:
Bibliographic Details
Main Authors: Sai, Ryuichi, Hamon, Francois P., Mellor-Crummey, John, Araya-Polo, Mauricio
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2408.03452
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929451244191744
author Sai, Ryuichi
Hamon, Francois P.
Mellor-Crummey, John
Araya-Polo, Mauricio
author_facet Sai, Ryuichi
Hamon, Francois P.
Mellor-Crummey, John
Araya-Polo, Mauricio
contents Fast and accurate numerical simulations are crucial for designing large-scale geological carbon storage projects ensuring safe long-term CO2 containment as a climate change mitigation strategy. These simulations involve solving numerous large and complex linear systems arising from the implicit Finite Volume (FV) discretization of PDEs governing subsurface fluid flow. Compounded with highly detailed geomodels, solving linear systems is computationally and memory expensive, and accounts for the majority of the simulation time. Modern memory hierarchies are insufficient to meet the latency and bandwidth needs of large-scale numerical simulations. Therefore, exploring algorithms that can leverage alternative and balanced paradigms, such as dataflow and in-memory computing is crucial. This work introduces a matrix-free algorithm to solve FV-based linear systems using a dataflow architecture to significantly minimize memory latency and bandwidth bottlenecks. Our implementation achieves two orders of magnitude speedup compared to a GPGPU-based reference implementation, and up to 1.2 PFlops on a single dataflow device.
format Preprint
id arxiv_https___arxiv_org_abs_2408_03452
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Matrix-Free Finite Volume Kernels on a Dataflow Architecture
Sai, Ryuichi
Hamon, Francois P.
Mellor-Crummey, John
Araya-Polo, Mauricio
Mathematical Software
Computational Physics
Fast and accurate numerical simulations are crucial for designing large-scale geological carbon storage projects ensuring safe long-term CO2 containment as a climate change mitigation strategy. These simulations involve solving numerous large and complex linear systems arising from the implicit Finite Volume (FV) discretization of PDEs governing subsurface fluid flow. Compounded with highly detailed geomodels, solving linear systems is computationally and memory expensive, and accounts for the majority of the simulation time. Modern memory hierarchies are insufficient to meet the latency and bandwidth needs of large-scale numerical simulations. Therefore, exploring algorithms that can leverage alternative and balanced paradigms, such as dataflow and in-memory computing is crucial. This work introduces a matrix-free algorithm to solve FV-based linear systems using a dataflow architecture to significantly minimize memory latency and bandwidth bottlenecks. Our implementation achieves two orders of magnitude speedup compared to a GPGPU-based reference implementation, and up to 1.2 PFlops on a single dataflow device.
title Matrix-Free Finite Volume Kernels on a Dataflow Architecture
topic Mathematical Software
Computational Physics
url https://arxiv.org/abs/2408.03452