Parallel framework for Dynamic Domain Decomposition of Data Assimilation problems a case study on Kalman Filter algorithm
Rosalba Cacciapuoti, Luisa D'Amore

TL;DR
This paper introduces DyDD, a dynamic load balancing algorithm for parallel domain decomposition in data assimilation problems, improving efficiency when observations are sparse or nonuniform, validated on Kalman filter-based models.
Contribution
The paper presents DyDD, a novel adaptive load balancing method for parallel domain decomposition in PDE-based data assimilation, enhancing computational efficiency.
Findings
DyDD effectively balances workload in nonuniform data scenarios.
Improved parallel efficiency demonstrated on Kalman filter-based models.
Validation across multiple data assimilation scenarios.
Abstract
We focus on Partial Differential Equation (PDE) based Data Assimilatio problems (DA) solved by means of variational approaches and Kalman filter algorithm. Recently, we presented a Domain Decomposition framework (we call it DD-DA, for short) performing a decomposition of the whole physical domain along space and time directions, and joining the idea of Schwarz' methods and parallel in time approaches. For effective parallelization of DD-DA algorithms, the computational load assigned to subdomains must be equally distributed. Usually computational cost is proportional to the amount of data entities assigned to partitions. Good quality partitioning also requires the volume of communication during calculation to be kept at its minimum. In order to deal with DD-DA problems where the observations are nonuniformly distributed and general sparse, in the present work we employ a parallel load…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
