In recent years, the SUite of Nonlinear and DIfferential/ALgebraic equation Solvers (SUNDIALS) has been redesigned to better enable the use of application-specific and third-party algebraic solvers and data structures. Throughout this work, we have adhered to specific guiding principles that minimized the impact to current users while providing maximum flexibility for later evolution of solvers and data structures. The redesign was done through the addition of new linear and nonlinear solvers classes, enhancements to the vector class, and the creation of modern Fortran interfaces. The vast majority of this work has been performed “behind-the-scenes,” with minimal changes to the user interface and no reduction in solver capabilities or performance. These changes allow SUNDIALS users to more easily utilize external solver libraries and create highly customized solvers, enabling greater flexibility on extreme-scale, heterogeneous computational architectures.
The machine learning explosion has created a prominent trend in modern computer hardware towards low precision floating-point operations. In response, there have been growing efforts to use low and mixed precision in general scientific computing. One important area that has received limited exploration is time integration methods, which are used for solving differential equations that are ubiquitous in science and engineering applications. In this work, we develop two new approaches for leveraging mixed precision in exponential time integration methods. The first approach is based on a reformulation of the exponential Rosenbrock-Euler method allowing for low precision computations in matrix exponentials independent of the particular algorithm for matrix exponentiation. The second approach is based on an inexact and incomplete Arnoldi pro-cedure in Krylov approximation methods for computing matrix exponentials and is agnostic to the chosen integration method. We show that both approaches improve accuracy compared to using purely low precision and offer better efficiency than using only double precision when solving an advection-diffusion-reaction partial differential equation.
4 October 2024 in The International Journal of High Performance Computing Applications
Many complex systems can be accurately modeled as a set of coupled time-dependent partial differential equations (PDEs). However, solving such equations can be prohibitively expensive, easily taxing the world’s largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This operator splitting approach is used ubiquitously across scientific domains, and in many cases leads to a set of ordinary differential equations (ODEs) that need to be solved as part of a larger “outer-loop” time-stepping approach. The SUNDIALS library provides a plethora of robust time integration algorithms for solving ODEs, and the U.S. Department of Energy Exascale Computing Project (ECP) has supported its extension to applications on exascale-capable computing hardware. In this paper, we highlight some SUNDIALS capabilities and its deployment in combustion and cosmology application codes (Pele and Nyx, respectively) where operator splitting gives rise to numerous, small ODE systems that must be solved concurrently.
We present an analytical model that matches scientific applications to effective Cloud instances for high application performance. The model constructs two vectors namely, the application vector and the Cloud vector. The application vector consists of application performance components such as the number of single-precision (SP) floating-point operations (FLOPs) and double-precision (DP) FLOPs, main memory accesses, and disk accesses. The Cloud vector comprises corresponding Cloud instance performance components such as the benchmarked SP and DP floating-point operations per second (FLOPS), memory bandwidth, and disk bandwidth. The model performs an inner product of the two vectors to produce an Application-to-Cloud (A2Cloud) score, which quantifies the application-to-Cloud match. We encapsulate the A2Cloud model in a user-friendly A2Cloud framework that inputs a test application and a target Cloud instance, profiles them, and executes the A2Cloud model to generate the A2Cloud score. We demonstrate the model by conducting 162 application executions across nine Cloud instances. Our tests yield an average A2Cloud matching rate of 6 for every 9 application-instance pairs with a mean absolute difference of ±1.08 ranks.