Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse direct method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗

Experimental study of multiple-orientation muon tomography with image optimization in sparse data environments

Due to the high penetrating power of cosmic-ray muons, they can be used to probe very thick and dense objects. As muons are charged particles, they can be tracked by ionization detectors, determining the position and direction of the muons. With detectors on either side of an object to measure particle direction change, scattering information within the object can be found. This can be used to produce a scattering-intensity image within the object related to density and atomic number. Such imaging is typically performed with a single detector-object orientation, taking advantage of the more intense downward flux of muons, producing planar imaging with some depth-of-field information in the third dimension. Several simulation studies were published with multiorientation tomography, which can form a three-dimensional representation faster than a single-orientation view. In this study, experimental muon-scatter-based tomography was performed using a concrete filled steel drum with several different metal wedges inside, with the drum between detector planes. Data were collected from different detector-object orientations by rotating the steel drum. The data collected from each orientation were combined using two different tomographic methods. A traditional inverse Radon transform approach used for computed tomography and a combination of multiple depth-of-field reconstructions were applied to the data. As cosmic-ray muon flux imaging is rate limited, the imaging techniques were compared for sparse data. Using the combined depth-of-field reconstruction technique, fewer detector-object orientations were needed to reconstruct images that could be used to differentiate the metal wedges.

47 OTHER INSTRUMENTATION↗

GenAI4UQ: A software for forward and inverse uncertainty quantification using conditional generative AI

We introduce GenAI4UQ, a software package for forward and inverse uncertainty quantification in model calibration, parameter estimation, and ensemble forecasting. GenAI4UQ leverages a generative AI-based conditional modeling framework to address limitations of traditional inverse modeling techniques, such as Markov Chain Monte Carlo (MCMC) methods. By replacing computationally intensive iterative processes with a direct, learned mapping, GenAI4UQ enables efficient calibration of input parameters and generation of predictions directly from observations. The software supports rapid ensemble forecasting with robust uncertainty quantification while maintaining computational and storage efficiency. Built-in auto-tuning of hyperparameters simplifies model training, ensuring accessibility for users with varying expertise. Its versatile conditional generative framework is applicable across diverse scientific domains. While GenAI4UQ offers significant advantages in flexibility and efficiency, users should interpret its uncertainty estimates with caution in data-sparse scenarios, as the model may overestimate uncertainty—an effect common to all surrogate-based approaches including MCMC with surrogate models. Despite this, GenAI4UQ transforms inverse modeling by providing a fast, reliable, and user-friendly solution. It empowers researchers and practitioners to quickly estimate parameter distributions and generate model predictions for new observations, facilitating efficient decision-making and advancing the state of uncertainty quantification in computational modeling.

97 MATHEMATICS AND COMPUTING↗

Utilizing Multiple Datasets for Snow Cover Mapping

Snow-cover maps generated from surface data are based on direct measurements, however they are prone to interpolation errors where climate stations are sparsely distributed. Snow cover is clearly discernable using satellite-attained optical data because of the high albedo of snow, yet the surface is often obscured by cloud cover. Passive microwave (PM) data is unaffected by clouds, however, the snow-cover signature is significantly affected by melting snow and the microwaves may be transparent to thin snow (less than 3cm). Both optical and microwave sensors have problems discerning snow beneath forest canopies. This paper describes a method that combines ground and satellite data to produce a Multiple-Dataset Snow-Cover Product (MDSCP). Comparisons with current snow-cover products show that the MDSCP draws together the advantages of each of its component products while minimizing their potential errors. Improved estimates of the snow-covered area are derived through the addition of two snow-cover classes ("thin or patchy" and "high elevation" snow cover) and from the analysis of the climate station data within each class. The compatibility of this method for use with Moderate Resolution Imaging Spectroradiometer (MODIS) data, which will be available in 2000, is also discussed. With the assimilation of these data, the resolution of the MDSCP would be improved both spatially and temporally and the analysis would become completely automated.

Tait, Andrew B.↗

Improved Variable-Transformation Algorithm for the Hexagonal Variational Nodal Method

Hexagonal Variational Nodal Method (VNM) has been widely employed in fast reactor core calculation codes. It provides the weak form solution of the second order transport equation. It employs a direct three-dimensional expansion instead of the transverse integration technique, with the singular term caused by transverse integration over the hexagonal nodal avoided. However, as the increasing Pn expansion order in angle, the number of moments increases dramatically, which significantly increases the requirements in both memory and computational time. As a consequence, Yang proposed the Variable-Transformation Algorithm. It firstly used the reverse Cuthill-McKee (RCMK) reordering method to transform the response matrices into block-diagonal. Then, for the unreducible matrices, orthogonal transformation was applied, after which the matrices were sparse enough to be reduced by using the RCMK reordering once more. In this summary, based on a newly developed hexagonal VNM code NECP-VioletHex, the Variable Transformation Algorithm was investigated and improved by adopting more constraints to the basis functions to further take advantage of the symmetric properties of the hexagonal-z nodes. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Searches for New Physics With Muon Conversion at Fermilab and Triboson Production at the LHC

We report on several efforts to search for physics beyond the standard model of particle physics at broad energy scales. The Mu2e experiment at Fermilab will search for charged lepton flavor violation via the muon to electron conversion process, which is suppressed in the Standard Model. Mu2e will be operated at a low energy, yet can probe New Physics at very high mass scales (O(1e3 - 1e4 ) TeV). At high energies, the CMS experiment at the CERN LHC continues to deliver an impressive suite of Standard Model measurements and limits on a variety of New Physics signatures. Mu2e is under construction and slated to collect its first physics data in the coming years. This thesis describes work done during the construction phase of Mu2e and focuses on two critical areas: magnetic field modeling and statistical analysis. We describe a novel method for field modeling which we validate using a simulated dataset representing the expected magnetic field in the Detector Solenoid. This method blends a standard least-squares fitting technique that utilizes physically motivated analytical model functions with a novel physics informed network that is constructed to obey Maxwell’s equations. We show the technique can model the field with an accuracy of 10−7 despite the presence of injected noise in the pseudo-measurements at the 10−5 level. We then present preliminary results of the calibration of 3D Hall probes at the sub-10−4 level. These probes will be used to directly measure the Mu2e Detector Solenoid magnetic field on a sparse grid; these measurements serve as the input to the field model fitting. Finally, we describe the first implementation of both an unbinned shape analysis and a Bayesian interpretation applied to Mu2e pseudo-data. Up to 20% tighter limits can be set by the shape analysis compared to a standard cut & count analysis. The AlCap experiment collected data at PSI in 2015 to measure several important quantities related to nuclear muon capture on an aluminum target, which is a significant background process for Mu2e. The neutron emission from muon capture can introduce background hits in the Mu2e detectors and can increase radiation damage in various elements of the apparatus. We present measurements of the neutron group fluence and mean neutron multiplicity for muon capture on aluminum nuclei. Finally, we discuss an analysis of triboson production at CMS using an Effective Field Theory framework. Standard Model triboson production, which was first observed at CMS in 2020, has a relatively small cross section and provides direct access to both anomalous triple gauge couplings and quartic gauge couplings. These couplings, interpreted in the Standard Model Effective Field Theory, are studied in the present work. We target the boosted regime where the background rate is low and yields are enhanced when dimension-6 and dimension-8 Wilson coefficients are non-zero. We do not observe an excess in the data and therefore set bounds on the Wilson coefficients. For dimension-6 coefficients the tightest observed (expected) bounds are set on cW /Λ2 where Λ is the mass scale of new physics; the bounds are [−0.13, 0.12] TeV−2 ([−0.12, 0.12] TeV−2 ) at 95% CL. The tightest bounds in dimension-8 are set on fT,0 / Λ4 ; the observed (expected) bounds at 95% CL are [−0.63, 0.69] TeV−4 ([−0.54, 0.62] TeV−4 ). Additional results are presented which include scenarios where multiple Wilson coefficients are non-zero, the application of signal model clipping to address unitarity violation in Effective Field Theories, and a novel template fit developed for easier reinterpretation of our results.

Kampa, Cole Erik [Northwestern U. (main)] (ORCID:0↗

First experimental study of multiple orientation muon tomography, with image optimization in sparse data environments

Due to the high penetrating power of cosmic ray muons, they can be used to probe very thick and dense objects. As charged particles, they can be tracked by ionization detectors, determining the position and direction of the muons. With detectors on either side of an object, particle direction changes can be used to extract scattering information within an object. This can be used to produce a scattering intensity image within the object related to density and atomic number. Such imaging is typically performed with a single detector-object orientation, taking advantage of the more intense downward flux of muons, producing planar imaging with some depth-of-field information in the third dimension. Several simulation studies have been published with multi-orientation tomography, which can form a three-dimensional representation faster than a single orientation view. In this work we present the first experimental multiple orientation muon tomography study. Experimental muon-scatter based tomography was performed using a concrete filled steel drum with several different metal wedges inside, between detector planes. Data was collected from different detector-object orientations by rotating the steel drum. The data collected from each orientation were then combined using two different tomographic methods. Results showed that using a combination of multiple depth-of-field reconstructions, rather than a traditional inverse Radon transform approach used for CT, resulted in more useful images for sparser data. As cosmic ray muon flux imaging is rate limited, the imaging techniques were compared for sparse data. Using the combined depth-of-field reconstruction technique, fewer detector-object orientations were needed to reconstruct images that could be used to differentiate the metal wedge compositions.

Applied Physics (physics.app-ph)↗

Minimal multi-element stochastic collocation for uncertainty quantification of discontinuous functions

We propose a multi-element stochastic collocation method that can be applied in high-dimensional parameter space for functions with discontinuities lying along manifolds of general geometries. The key feature of the method is that the parameter space is decomposed into multiple elements defined by the discontinuities and thus only the minimal number of elements are utilized. On each of the resulting elements the function is smooth and can be approximated using high-order methods with fast convergence properties. The decomposition strategy is in direct contrast to the traditional multi-element approaches which define the sub-domains by repeated splitting of the axes in the parameter space. Such methods are more prone to the curse-of-dimensionality because of the fast growth of the number of elements caused by the axis based splitting. The present method is a two-step approach. Firstly a discontinuity detector is used to partition parameter space into disjoint elements in each of which the function is smooth. The detector uses an efficient combination of the high-order polynomial annihilation technique along with adaptive sparse grids, and this allows resolution of general discontinuities with a smaller number of points when the discontinuity manifold is low-dimensional. After partitioning, an adaptive technique based on the least orthogonal interpolant is used to construct a generalized Polynomial Chaos surrogate on each element. The adaptive technique reuses all information from the partitioning and is variance-suppressing. We present numerous numerical examples that illustrate the accuracy, efficiency, and generality of the method. When compared against standard locally-adaptive sparse grid methods, the present method uses many fewer number of collocation samples and is more accurate.

97 MATHEMATICS AND COMPUTING↗

Quantifying and reducing model-form uncertainties in Reynolds-averaged Navier–Stokes simulations: A data-driven, physics-informed Bayesian approach

Despite their well-known limitations, Reynolds-Averaged Navier–Stokes (RANS) models are still the workhorse tools for turbulent flow simulations in today's engineering analysis, design and optimization. While the predictive capability of RANS models depends on many factors, for many practical flows the turbulence models are by far the largest source of uncertainty. As RANS models are used in the design and safety evaluation of many mission-critical systems such as airplanes and nuclear power plants, quantifying their model-form uncertainties has significant implications in enabling risk-informed decision-making. In this work we develop a data-driven, physics-informed Bayesian framework for quantifying model-form uncertainties in RANS simulations. Uncertainties are introduced directly to the Reynolds stresses and are represented with compact parameterization accounting for empirical prior knowledge and physical constraints (e.g., realizability, smoothness, and symmetry). An iterative ensemble Kalman method is used to assimilate the prior knowledge and observation data in a Bayesian framework, and to propagate them to posterior distributions of velocities and other Quantities of Interest (QoIs). We use two representative cases, the flow over periodic hills and the flow in a square duct, to evaluate the performance of the proposed framework. Both cases are challenging for standard RANS turbulence models. Simulation results suggest that, even with very sparse observations, the obtained posterior mean velocities and other QoIs have significantly better agreement with the benchmark data compared to the baseline results. At most locations the posterior distribution adequately captures the true model error within the developed model form uncertainty bounds. The framework is a major improvement over existing black-box, physics-neutral methods for model-form uncertainty quantification, where prior knowledge and details of the models are not exploited. This approach has potential implications in many fields in which the governing equations are well understood but the model uncertainty comes from unresolved physical processes. - Highlights: • Proposed a physics–informed framework to quantify uncertainty in RANS simulations. • Framework incorporates physical prior knowledge and observation data. • Based on a rigorous Bayesian framework yet fully utilizes physical model. • Applicable for many complex physical systems beyond turbulent flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using MODIS and GLAS Data to Develop Timber Volume Estimates in Central Siberia

The boreal forest is the Earth's largest terrestrial biome, covering some 12 million km2 and accounting for about one third of this planet's total forest area. Mapping of boreal forest's type, structure parameters and biomass are critical for understanding the boreal forest's significance in the carbon cycle, its response to and impact on global climate change. Ground based forest inventories, have much uncertainty in the inventory data, particularly in remote areas of Siberia where sampling is sparse and/or lacking. In addition, many of the forest inventories that do exist for Siberia are now a decade or more old. Thus, available forest inventories fail to capture the current conditions. Changes in forest structure in a particular forest-type and region can change significantly due to changing environment conditions, and natural and anthropogenic disturbance. Remote sensing methods can potentially overcome these problems. Multispectral sensors can be used to provide vegetation cover maps that show a timely and accurate geographic distribution of vegetation types rather than decade old ground based maps. Lidar sensors can be used to directly obtain measurements that can be used to derive critical forest structure information (e.g., height, density, and volume). These in turn can used to estimate biomass components using allometric equations without having to use out dated forest inventory. Finally, remote sensing data is ideally suited to provide a sampling basis for a rigorous statistical estimate of the variance and error bound on forest structure measures. In this study, new remote sensing methods were applied to develop estimates timber volume using NASA's MODerate resolution Imaging Spectroradiometer (MODIS) and unique waveform data of the geoscience laser altimeter system (GLAS) for a 10 deg x 10 deg area in central Siberia. Using MODIS and GLAS data, maps were produced for cover type and timber volume for 2003, and a realistic variance (error bound) for timber volume was calculated for the study area. In this 'study we used only GLAS footprints that had a slope value of less than 10 deg. This was done to avoid large errors due to the effect of slope on the GLAS models. The method requires the integration of new remote sensing methods with available ground studies of forest timber volume conducted in Russian forests. The results were compared to traditional ground forest inventory methods reported in the literature and to ground truth collected in the study area.

Ranson, K. Jon↗

MFiX: Fractional-Step Method Implementation

A comprehensive, multiphase computational fluid dynamics (CFD) simulation solves several coupled transport equations including continuity, momentum, species, and energy. Chemical reactions further couple these equations through heats of reaction and rates of formation of products and rates of destruction of reactants. A fractional-step method separates changes attributed to chemical reactions from transport phenomena like convection and diffusion. When the governing equations are split into the transport and reacting components, efficient and independent methodologies can be exploited to solve the different systems. Specifically, discretization of field variable transport equations results in large, sparse matrices which are loosely coupled. These systems are solved in succession using iterative techniques that take advantage of the matrix structure. In contrast, chemical reactions tightly couple field variables locally within the domain (e.g., within a single computational cell) resulting in low dimensional but dense, nonlinear systems that are better solved using direct integration techniques.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Co-benefits of global and regional greenhouse gas mitigation for US air quality in 2050

Policies to mitigate greenhouse gas (GHG) emissions will not only slow climate change but can also have ancillary benefits of improved air quality. Here we examine the co-benefits of both global and regional GHG mitigation for US air quality in 2050 at fine resolution, using dynamical downscaling methods, building on a previous global co-benefits study (West et al., 2013). The co-benefits for US air quality are quantified via two mechanisms: through reductions in co-emitted air pollutants from the same sources and by slowing climate change and its influence on air quality, following West et al. (2013). Additionally, we separate the total co-benefits into contributions from domestic GHG mitigation vs. mitigation in foreign countries. We use the Weather Research and Forecasting (WRF) model to dynamically downscale future global climate to the regional scale and the Sparse Matrix Operator Kernel Emissions (SMOKE) program to directly process global anthropogenic emissions to the regional domain, and we provide dynamical boundary conditions from global simulations to the regional Community Multi-scale Air Quality (CMAQ) model. The total co-benefits of global GHG mitigation from the RCP4.5 scenario compared with its reference are estimated to be higher in the eastern US (ranging from 0.6 to 1.0 µg m -3 ) than the west (0–0.4 µg m -3 ) for fine particulate matter (PM 2.5 ), with an average of 0.47 µg m -3 over the US; for O 3 , the total co-benefits are more uniform at 2–5 ppb, with a US average of 3.55 ppb. Comparing the two mechanisms of co-benefits, we find that reductions in co-emitted air pollutants have a much greater influence on both PM 2.5 (96 % of the total co-benefits) and O 3 (89 % of the total) than the second co-benefits mechanism via slowing climate change, consistent with West et al. (2013). GHG mitigation from foreign countries contributes more to the US O 3 reduction (76 % of the total) than that from domestic GHG mitigation only (24 %), highlighting the importance of global methane reductions and the intercontinental transport of air pollutants. For PM 2.5 , the benefits of domestic GHG control are greater (74 % of total). Since foreign contributions to co-benefits can be substantial, with foreign O 3 benefits much larger than those from domestic reductions, previous studies that focus on local or regional co-benefits may greatly underestimate the total co-benefits of global GHG reductions. We conclude that the US can gain significantly greater domestic air quality co-benefits by engaging with other nations to control GHGs.

54 ENVIRONMENTAL SCIENCES↗

A Segregated Approach for Modeling the Electrochemistry in the 3-D Microstructure of Li-Ion Batteries and Its Acceleration Using Block Preconditioners

Abstract Battery performance is strongly correlated with electrode microstructure. Electrode materials for lithium-ion batteries have complex microstructure geometries that require millions of degrees of freedom to solve the electrochemical system at the microstructure scale. A fast-iterative solver with an appropriate preconditioner is then required to simulate large representative volume in a reasonable time. In this work, a finite element electrochemical model is developed to resolve the concentration and potential within the electrode active materials and the electrolyte domains at the microstructure scale, with an emphasis on numerical stability and scaling performances. The block Gauss-Seidel (BGS) numerical method is implemented because the system of equations within the electrodes is coupled only through the nonlinear Butler–Volmer equation, which governs the electrochemical reaction at the interface between the domains. The best solution strategy found in this work consists of splitting the system into two blocks—one for the concentration and one for the potential field—and then performing block generalized minimal residual preconditioned with algebraic multigrid, using the FEniCS and the Portable, Extensible Toolkit for Scientific Computation libraries. Significant improvements in terms of time to solution (six times faster) and memory usage (halving) are achieved compared with the MUltifrontal Massively Parallel sparse direct Solver. Additionally, BGS experiences decent strong parallel scaling within the electrode domains. Last, the system of equations is modified to specifically address numerical instability induced by electrolyte depletion, which is particularly valuable for simulating fast-charge scenarios relevant for automotive application.

25 ENERGY STORAGE↗

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.

97 MATHEMATICS AND COMPUTING↗

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

Analytically differentiable metrics for phase stability

Here, in this work, a long-established but sparsely documented method of obtaining semi-analytic derivatives of thermodynamic properties with respect to equilibrium conditions is briefly reviewed and rigorously derived. This procedure is then leveraged to construct general forms of derivatives of the residual driving force, a metric for measuring phase stability used in CALPHAD model optimization, with respect to overall system and individual phase compositions. Applied examples – calculating heat capacity in the Al-Fe system, thermodynamic factors in the Nb-V-W system, and residual driving force derivatives in the Ni-Ti system – demonstrate the versatility, accuracy, and extensibility of this method. Using the developed method, residual driving force gradients can be applied directly in CALPHAD model optimizers, as well as in materials design frameworks, to identify regions of phase stability with an efficient, gradient-based approach.

36 MATERIALS SCIENCE↗

Optimizing Irregular Communication with Neighborhood Collectives and Locality-Aware Parallelism

Irregular communication often limits both the performance and scalability of parallel applications. Typically, applications individually implement irregular communication as point-to-point, and any optimizations are integrated directly into the application. As a result, these optimizations lack portability. It is difficult to optimize point-to-point messages within MPI, as the interface for single messages provides no information on the collection of all communication to be performed. However, the persistent neighbor collective API, released in the MPI 4 standard, provides an interface for portable optimizations of irregular communication within MPI libraries. This paper presents methods for implementing existing optimizations for irregular communication within neighborhood collectives, analyzes the impact of replacing point-to-point communication in existing codebases such as Hypre BoomerAMG with neighborhood collectives, and finally shows up to a 1.38x speedup on sparse matrix-vector multiplication communication within a BoomerAMG solve through the use of our optimized neighbor collectives. Here, the authors analyze three implementations of persistent neighborhood collectives for Alltoallv: an unoptimized wrapper of standard point-to-point communication, and two locality-aware aggregating methods. The second locality-aware implementation exposes an non-standard interface to perform additional optimization, and the authors present the additional 0.07x speedup from the extended interface. All optimizations are available in an open-source codebase, MPI Advance, which sits on top of MPI, allowing for optimizations to be added into existing codebases regardless of the system MPI install.

AMG↗