Cloud-native alternating directions solver for isogeometric analysis

Computer simulations with isogeometric analysis (IGA) have multiple applications, from phase-field modeling to tumor-growth simulations. We focus on the alternating-directions solver (ADS) algorithm, in which the matrix equation representing a computational problem is decomposed into parallel tasks...

Full description

Saved in:

Bibliographic Details
Published in:	Future generation computer systems Vol. 140; pp. 151 - 172
Main Authors:	Gurgul, Grzegorz, Baliś, Bartosz, Paszyński, Maciej
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2023
Subjects:	Alternating-direction implicit solver (ADI) Apache Giraph framework Cloud computing Isogeometric analysis (IGA) Parallel programming paradigm Pregel Think like a vertex (TLAV) paradigm Cloud computing Alternating-direction implicit solver (ADI) Parallel programming paradigm Pregel Isogeometric analysis (IGA) Think like a vertex (TLAV) paradigm Apache Giraph framework
ISSN:	0167-739X, 1872-7115
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Computer simulations with isogeometric analysis (IGA) have multiple applications, from phase-field modeling to tumor-growth simulations. We focus on the alternating-directions solver (ADS) algorithm, in which the matrix equation representing a computational problem is decomposed into parallel tasks following the binary and balanced structure of an elimination tree. In this paper, we explore the possibility of running large-scale IGA simulations using linear computational cost alternating direction solvers on top of modern data-parallel cloud computing frameworks. To this end, we propose a new way of decomposition of the elimination tree which makes the IGA alternating-direction solver effectively a large graph problem suitable for modern cloud-computing frameworks. On this basis, we propose a new algorithm for isogeometric analysis alternating-directions solver based on the Pregel computational model, used for large-scale graph-processing in the cloud. We implement a cloud-native solver using this algorithm in the Apache Giraph framework, and show that it can be applied for solution of challenging higher-order PDEs. We evaluate the solver in terms of various scalability models and run configurations. The results indicate linear scalability of the proposed algorithm with respect to the number of elements in the mesh. •We consider isogeometric analysis alternating-directions (IGA-ADI) transient solver.•The IGA-ADI decomposes multi-frontal solvers into tasks of multiple right-hand sides.•The IGA-ADI is a complex, iterative graph algorithm with strong data locality.•We implement IGA-ADI as a Pregel graph algorithm with the Giraph framework.•We show phase-field simulations on a cloud and perform parallel scalability tests.
ISSN:	0167-739X 1872-7115
DOI:	10.1016/j.future.2022.10.017