Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel performance”

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 973 records · Page 54

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗

A Scaling Study for Incompressible Multispecies Solver in Vertex-CFD

Multispecies incompressible flows occur widely in engineering and environmental applications, such as chemical reactors, fuel cells, ocean mixing, and biomedical systems. However, accurately resolving the complex transport and mixing phenomena associated with multiple interacting species remains computationally challenging, especially for large-scale problems. In this study, we present a robust, high-performance computing--enabled multispecies incompressible Navier–Stokes solver integrated within the Vertex-CFD framework. Our solver employs a fully coupled, implicit, finite element--based formulation that accurately captures the advection, diffusion, and interaction of multiple species in incompressible flows by leveraging the Kokkos library for parallel computing to achieve high computational efficiency. For pressure coupling, the entropically damped artificial compressibility method is utilized. We validated the solver against canonical test cases, including multispecies advection, diffusion, and Bateman systems; the results demonstrate second- and third-order spatial accuracy and consistent convergence. Additionally, we demonstrated the strong and weak scaling study results obtained on the leadership-class high-performance computing system, Frontier at Oak Ridge National Laboratory.

Oz, Furkan [ORNL] (ORCID:0000000265831724)↗

Performance Improvements for the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. Griffin includes a variety of deterministic radiation transport solvers for fixed source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. A code assessment performed in FY-20 identified two significant issues with the transport solvers in Griffin: first, the primary heterogeneous SN (discrete ordinates) transport solver based on continuous finite element methods required significant mesh refinement and higher memory usage compared to solvers based on the method of characteristic for equivalent accuracy. Second, the homogeneous PN (spherical harmonics expansion) transport solver did not adequately support polynomial refinement, which is a feature usually required for problems with spatial homogenization and pronounced streaming, typical in fast or gas-cooled reactor systems. To address the first issue, the development effort focused on the more promising discontinuous finite element method (DFEM)-based SN transport solver in Griffin. The addition of an asynchronous parallel transport sweeper and coarse mesh finite difference (CMFD) acceleration have rendered a superior heterogeneous SN transport capability for multiphysics problems that requires far less computing resources in terms of both CPU time and memory usage. This is demonstrated with typical thermal- and fast-spectrum reactor benchmark problems, including 2D Transient Reactor Test, 3D Advanced Burner Test Reactor (ABTR), and 2D and 3D Empire microreactor. For the second issue, the development effort focused on a new transport solver based on the hybrid finite element PN method (HFEM-PN), equivalent to the variational nodal method, as well as a new diffusion solver based on HFEM-Diffusion. This solver is intended for homogenized domains with multiphysics coupling (i.e., supports mesh displacement, seamless temperature feedback, etc.). Initial calculations with the HFEM-Diffusion implementation show very good parallel efficiency for the residual evaluations with the 2D ABTR benchmark. A future development effort will be centered on further improvements to the CMFD, HFEM-PN, and DFEM diffusion solvers to ensure Griffin meets performance and software quality assurance requirements for advanced reactor design and analysis.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Advocating for view and daylight in buildings: Next steps

With the exponential growth in population and commensurate increased density in urban cities, access to daylight and views to nature is being severely curtailed in buildings. In parallel, increasingly urgent demands to sharply reduce building energy use and associated greenhouse gas emissions are being made to mitigate climate change. There are many challenges and performance tradeoffs associated with the building facade (i.e., daylight and view versus solar and glare control); increased prioritization of health and well-being as a fundamental human requirement could adversely affect building energy-efficiency. Given the current state of knowledge on the effects of daylight and view on health and well-being in buildings, we identify critical needs in research, tools and technologies that if satisfied may enable more effective use of daylight and view in buildings within the constraints of climate change. Lack of knowledge regarding the complex causal mechanisms of window views on human factors is a severely limiting factor in forward progress. Current models and methods to derive bidirectional scattering distribution functions (BSDFs) will need to be modified. Developers of energy-efficient window technologies will need more guidance to shape product development. Advanced window technologies and integrated design can enable attainment of both health and well-being and net zero energy goals, but considerable work will be needed to make such options turnkey and broadly available.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Fine-grained Asynchronous Bulk Synchronous parallelism model for PGAS applications

The Partitioned Global Address Space (PGAS) model is well suited for executing irregular applications on cluster-based systems, due to its efficient support for short, one-sided messages. Separately, the actor model has been gaining popularity as a productive asynchronous message-passing approach for distributed objects in enterprise and cloud computing platforms, typically implemented in languages such as Erlang, Scala or Rust. To the best of our knowledge, there has been no past work on using the actor model to deliver both productivity and scalability to irregular PGAS applications with large number of small messages. In this paper, we introduce a new programming system for PGAS applications, in which point-to-point remote operations can be expressed as fine-grained asynchronous actor messages. In our approach, the programmer does not need to worry about programming complexities related to message aggregation and termination detection. Our approach can be viewed as extending the classical Bulk Synchronous Parallelism model with fine-grained asynchronous communications within a phase or superstep. Here, we believe that our approach offers a desirable point in the productivity-performance space for PGAS applications, with more scalable performance and higher productivity relative to past approaches. Specifically, for seven irregular mini-applications from the Bale Kernels and three graph kernels executed using 2048 cores in the NERSC Cori system, our approach shows geometric mean performance improvements of ≥ 20X relative to standard PGAS versions (UPC and OpenSHMEM) while maintaining comparable productivity to those versions.

97 MATHEMATICS AND COMPUTING↗

High field magnetization of FePS 3

High field magnetization measurements in pulsed fields up to 65 T have been performed on FePS 3 , which is nominally a good example of a two-dimensional Ising-like antiferromagnet on a honeycomb lattice. Measurements with the field parallel to the moment direction confirm the presence of two first-order transitions above 35 T, to M/M sat = 1/2 and M/M sat = 1, respectively, at 4 K. The measurements are in contradiction with published estimates for the magnetic exchange parameters, but the contradiction can be resolved by allowing for anisotropic exchange parameters in the Hamiltonian. Furthermore, the magnetization with the field perpendicular to the moment direction is anisotropic, with no transitions observed for fields along the a axis while a cascade of first-order transitions is observed for fields above 50 T along the b axis, the latter case also showing a strong degradation of the sample after repeated pulses. The results indicate a strong magnetolattice coupling in FePS 3 . Temperature-dependent measurements hint at a possible tricritical point.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

In-beam γ-ray spectroscopy of 32 Mg via direct reactions

Background: The nucleus 32 Mg (N=20 and Z=12) plays a central role in the so-called “island of inversion,” where in the ground states sd-shell neutrons are promoted to the fp-shell orbitals across the shell gap, resulting in the disappearance of the canonical neutron magic number N=20. Purpose: The primary goals of this work are to extend the level scheme of 32Mg, provide spin-parity assignments to excited states, and discuss the microscopic structure of each state through comparisons with theoretical calculations. Method: In-beam γ-ray spectroscopy of 32 Mg was performed using two direct-reaction probes: one-neutron (two-proton) knockout reactions on 33 Mg ( 34 Si). Final-state exclusive cross sections and parallel momentum distributions were extracted from the experimental data and compared with eikonal-based reaction model calculations combined with shell-model overlap functions. Results: Owing to the remarkable selectivity of the one-neutron and two-proton knockout reactions, a significantly updated level scheme for 32 Mg, which exhibits negative-parity intruder and positive-parity normal states, was constructed. The experimental results were confronted with four different nuclear structure models. Conclusions: In some of these models, different aspects of 32 Mg and the transition into the island of inversion are well described. However, unexplained discrepancies remain, and, even with the help of these state-of-the-art theoretical approaches, the structure of this key nucleus is not yet fully captured.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Trigger-based Incremental Data Processing with Unified Sync and Async Model

In recent years, more and more applications in the cloud have needs to process large-scale on-line datasets, which evolve over time as new entries are added and existing entries are modified. Several programming frameworks, such as Percolator and Oolong, are proposed for such incremental data processing and can achieve efficient processing with an event-driven abstraction. However, these frameworks are inherently asynchronous, leaving the heavy burden of managing synchronization to applications' developers, which further significantly restricts their usabilities. In this study, we propose a trigger-based incremental computing framework in the cloud, called Domino, with both synchronous and asynchronous mechanisms to coordinate parallel triggers. With this new framework, both synchronous and asynchronous applications can be seamlessly developed. Use cases and extensive evaluation results confirm that it can deliver sufficient performance, and also is easy to use for incremental applications in large-scale distributed computing.

97 MATHEMATICS AND COMPUTING↗

Intensity Modulated Fiber Optic Sensor: A Novel Grid Measurement Unit

This paper presents a novel approach to physical displacement-based power grid measuring via an Intensity Modulated Fiber Optic Sensor (IMFOS). An IMFOS utilizes one fiber to transmit the intensity modulation light from its Electro-Optic controller to a fiber optic probe. The power grid voltage and current can induce physical displacements in transducers via the piezoelectric effect and the Lorentz law, respectively, which then result in a distance change between the optical probe and the reflective surface of the transducers. In parallel, multiple fibers are used to collect the reflective light for electro-optic conversion. Furthermore, a National Instruments-based characterization platform is set up for performance evaluation. Here, the testing result demonstrates that the IMFOS is immune to the inherent DC and low-frequency saturation issues prevalent in conventional potential and current transformers. Finally, the IMFOS is implemented in a Universal Grid Analyzer to illustrate its applicability for phasor estimation in actual power grids.

42 ENGINEERING↗

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗

TEAM Project Review, Year 2

This report summarizes our research activities within the TEAM project between December 2020 and December 2021, funded by the ASCR Advanced Research in Quantum Computing program. During the reporting period the LLNL-MSU team has made progress on several fronts. An overarching goal of the team is to provide a comprehensive suite of software tools that can be used for the Characterize-Optimize-Compute loop needed to implement and execute algorithms on quantum devices. We are concurrently developing lightweight solvers that can be used on desktop computers to find optimal control pulses and to characterize small quantum systems (consisting of a few transmons and cavities). However, desktop computers are insufficient for simulating and characterizing larger quantum systems. We have therefore also developed parallel, distributed memory, simulators and optimization solvers, both for open and closed quantum systems. These parallel solvers have, for example, been used to study quantum optimal control for pure-state preparation, utilizing 1000’s of cores on a modern high-performance computing (HPC) platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GnarlyX: Eulerian multi-material hydrodynamics coupled to equation of state and hyperelastic, plastic constitutive models

GnarlyX is a new hydrocode for direct numerical simulations of the microstructural behavior of high explosives at the mesoscale. We summarize the computational framework for multidimensional, Eulerian multi-material hydrodynamics coupled to EOS and hyperelastic, plastic constitutive models. We present 1D verification tests of multi-material only and combined multimaterial and strength capabilities with comparisons to exact solutions of shock states resulting from an incident shock impacting the material interface of PBX9502 and aluminum. We show that GnarlyX performs well in capturing the resulting shock waves in examining numerical convergence with exact solutions. In later work, we will summarize the thermomechanics and multi-dimensional, parallel computing capabilities in GnarlyX with multi-dimensional verification tests.

42 ENGINEERING↗

LHC Event Generation in the Exascale Era

MCFM is a dedicated Monte-Carlo simulation program for collider phenomenology at highest energies. Designed during the Tevatron era, it has successfully incorporated the latest developments needed for LHC precision calculations and remained on the forefront of collider phenomenology. The Fortran code includes interfaces to modern PDF and loop reduction libraries but has been unchanged structurally compared to the earlier versions. Parallel computing has been enabled using OpenMP and MPI. MCFM provides numerically highly stable one-loop amplitudes and superior phase-space efficiency, leading to excellent performance in NXLO calculations using jettiness or qT subtraction techniques for IR regularization.

Campbell, John [Fermilab]↗

Robust Decentralized Secondary Control Scheme for Inverter-based Power Networks

Inverter-dominated microgrids are quickly becoming a key building block of future power systems. They rely on centralized controllers that can provide reliability and resiliency in extreme events. Nonetheless, communication failures due to cyber-physical attacks or natural disasters can make autonomous operation of islanded microgrids challenging. This paper examines a unified decentralized secondary control scheme that is robust to inverter clock synchronization errors and can be seamlessly applied to grid-following or grid-forming control architectures. The proposed scheme overcomes the well-known stability problem that arises from parallel operation of local integral controllers. Theoretical guarantees for stability are provided along with criteria to appropriately tune the secondary control gains to achieve good frequency regulation performance while ensuring fair power sharing. The efficacy of our approach is demonstrated through simulations on a 5-bus microgrid with four grid-forming inverters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Source-to-Source Automatic Differentiation of OpenMP Parallel Loops

This article presents our work toward correct and efficient automatic differentiation of OpenMP parallel worksharing loops in forward and reverse mode. Automatic differentiation is a method to obtain gradients of numerical programs, which are crucial in optimization, uncertainty quantification, and machine learning. The computational cost to compute gradients is a common bottleneck in practice. For applications that are parallelized for multicore CPUs or GPUs using OpenMP, one also wishes to compute the gradients in parallel. Here, we propose a framework to reason about the correctness of the generated derivative code, from which we justify our OpenMP extension to the differentiation model. We implement this model in the automatic differentiation tool Tapenade and present test cases that are differentiated following our extended differentiation procedure. Performance of the generated derivative programs in forward and reverse mode is better than sequential, although our reverse mode often scales worse than the input programs.

97 MATHEMATICS AND COMPUTING↗

Improved Organic Electrochemical Transistors via Directed Crystallizable Small Molecule Templating

Organic electrochemical transistors (OECTs) are of great interest as biosensors and for flexible electronics applications. Historically, processing techniques have been widely used to improve the performance of polymers in organic electronics but have been underutilized in the field of OECTs. Here, in this work, we study the effects of a crystallizable small molecule template for improving the performance of poly(3-hexylthiophene-2,5-diyl) (P3HT)-based OECTs. We utilize 1,3,5-trichlorobenzene (TCB) as a crystallizable additive to induce directional crystallization during blade coating. This procedure results in an aligned, highly ordered, and moderately porous layer of the semiconducting polymer. We find that compared to neat P3HT solutions, films cast with TCB additive show a greater than 8× improvement in the steady state figure of merit for OECTs. Additionally, the optimum TCB loading produces anisotropic OECTs where the polymer chain aligned parallel to the current outperforms the perpendicular alignment by more than a factor of 10. We investigated the mechanism of this improvement and found that polymer alignment, polymer ordering, and film porosity all play a role in improving the device performance. Overall, these results demonstrate the importance of processing on the optimization of polymers for OECTs and suggest a route to greatly improve the performance of commercially available hydrophobic polymers.

36 MATERIALS SCIENCE↗