Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Scalable Algorithms”

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 1,261 records · Page 70

An Asynchronous Task-based Fan-Both Sparse Cholesky Solver

Systems of linear equations arise at the heart of many scientific and engineering applications. Many of these linear systems are sparse; i.e., most of the elements in the coefficient matrix are zero. Direct methods based on matrix factorizations are sometimes needed to ensure accurate solutions. For example, accurate solution of sparse linear systems is needed in shift-invert Lanczos to compute interior eigenvalues. The performance and resource usage of sparse matrix factorizations are critical to time-to-solution and maximum problem size solvable on a given platform. In many applications, the coefficient matrices are symmetric, and exploiting symmetry will reduce both the amount of work and storage cost required for factorization. When the factorization is performed on large-scale distributed memory platforms, communication cost is critical to the performance of the algorithm. At the same time, network topologies have become increasingly complex, so that modern platforms exhibit a high level of performance variability. This makes scheduling of computations an intricate and performance-critical task. In this paper, we investigate the use of an asynchronous task paradigm, one-sided communication and dynamic scheduling in implementing sparse Cholesky factorization (symPACK) on large-scale distributed memory platforms. Our solver symPACK relies on efficient and flexible communication primitives provided by the UPC++ library. Performance evaluation shows good scalability and that symPACK outperforms state-of-the-art parallel distributed memory factorization packages, validating our approach on practical cases.

Jacquelin, Mathias↗

PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems

Preventing and slowing the spread of epidemics is achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach for intervention via maximizing the influence of vaccinated nodes on the network. We call this method \preempt. Next, we prove submodular properties associated with the objective function of our method so that it aids in construction of an efficient greedy approximation strategy. Consequently, we present a new parallel algorithm based on greedy hill climbing for \preempt, and present an efficient parallel implementation for distributed CPU-GPU heterogeneous platforms. Our results demonstrate that \preempt{} is able to achieve a significant reduction (up to 6.75$\times$) in the percentage of people infected on a city-scale network. We also show strong scaling results of \preempt{} on 128 nodes of the Summit supercomputer. Our parallel implementation is able to significantly reduce time to solution, from hours to minutes on large networks. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.

Minutoli, Marco↗

Achieving energy efficiency during collective communications

Energy consumption has become a major design constraint in modern computing systems. With the advent of petaflops architectures, power-efficient software stacks have become imperative for scalability. Techniques such as dynamic voltage and frequency scaling (called DVFS) and CPU clock modulation (called throttling) are often used to reduce the power consumption of the compute nodes. To avoid significant performance losses, these techniques should be used judiciously during parallel application execution. For example, its communication phases may be good candidates to apply the DVFS and CPU throttling without incurring a considerable performance loss. They are often considered as indivisible operations although little attention is being devoted to the energy saving potential of their algorithmic steps. In this work, two important collective communication operations, all-to-all and allgather, are investigated as to their augmentation with energy saving strategies on the per-call basis. The experiments prove the viability of such a fine-grain approach. They also validate a theoretical power consumption estimate for multicore nodes proposed here. While keeping the performance loss low, the obtained energy savings were always significantly higher than those achieved when DVFS or throttling were switched on across the entire application run

36 MATERIALS SCIENCE↗

Constant-pH Molecular Dynamics Simulations for Large Biomolecular Systems

We report that an increasingly important endeavor is to develop computational strategies that enable molecular dynamics (MD) simulations of biomolecular systems with spontaneous changes in protonation states under conditions of constant pH. The present work describes our efforts to implement the powerful constant-pH MD simulation method, based on a hybrid nonequilibrium MD/Monte Carlo (neMD/MC) technique within the highly scalable program NAMD. The constant-pH hybrid neMD/MC method has several appealing features; it samples the correct semigrand canonical ensemble rigorously, the computational cost increases linearly with the number of titratable sites, and it is applicable to explicit solvent simulations. The present implementation of the constant-pH hybrid neMD/MC in NAMD is designed to handle a wide range of biomolecular systems with no constraints on the choice of force field. Furthermore, the sampling efficiency can be adaptively improved on-the-fly by adjusting algorithmic parameters during the simulation. Finally, illustrative examples emphasizing medium- and large-scale applications on next-generation supercomputing architectures are provided.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sipros Ensemble improves database searching and filtering for complex metaproteomics

Complex microbial communities can be characterized by metagenomics and metaproteomics. However, metagenome assemblies often generate enormous, and yet incomplete, protein databases, which undermines the identification of peptides and proteins in metaproteomics. This challenge calls for increased discrimination of true identifications from false identifications by database searching and filtering algorithms in metaproteomics. Sipros Ensemble was developed here for metaproteomics using an ensemble approach. Three diverse scoring functions from MyriMatch, Comet and the original Sipros were incorporated within a single database searching engine. Supervised classification with logistic regression was used to filter database searching results. Benchmarking with soil and marine microbial communities demonstrated a higher number of peptide and protein identifications by Sipros Ensemble than MyriMatch/Percolator, Comet/Percolator, MS-GF+/Percolator, Comet & MyriMatch/iProphet and Comet & MyriMatch & MS-GF+/iProphet. Sipros Ensemble was computationally efficient and scalable on supercomputers. Freely available under the GNU GPL license at http://sipros.omicsbio.org.

59 BASIC BIOLOGICAL SCIENCES↗

A Generalized Framework for Service Restoration in a Resilient Power Distribution System

An electric power grid is one of the complex infrastructures, and because of its complex nature, there is simply no way that outages can be completely avoided. Thus, a modern society that depends on reliable electric supply requires a resilient electric system that can recover from disruptions while integrating emerging smart grid technologies. Here, this article presents a novel approach for service restoration in a modern power distribution system with controllable switches and distributed generation (DG) resources for any kind of outage. The proposed framework supports both the traditional service restoration using feeder reconfiguration and the grid-forming DG-assisted intentional islands that are dynamically sized using algorithms based on the fault scenario, available resources, and priority of loads. The problem is formulated as a mixed-integer linear program that incorporates critical system connectivity and operating constraints. Simulations are performed to demonstrate the effectiveness of the proposed approach using a large-scale four-feeder 1069-bus three-phase unbalanced distribution test system. It is demonstrated that the framework is effective in utilizing all available resources in quickly restoring the power supply to improve resiliency during extreme events and is scalable for a large-scale unbalanced power distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization

One of the most complicating factors in decentralized solution methods for a broad range of power system optimization problems is the modeling of power flow equations. Existing formulations for direct current power flows either have limited scalability or are very dense and unstructured, making them unsuitable for large-scale decentralized studies. Here, in this work, we present a novel sparsified variant of the injection shift factors formulation, which has a decomposable block-diagonal structure and scales well for large systems. We also propose a decentralized solution method, based on the alternating direction multiplier method, that efficiently handles transmission line outages in N-1 security requirements. Benchmarks on multizonal security-constrained unit commitment problems show that the proposed formulation and algorithm can reliably and efficiently solve interconnection-level test systems with up to 6,515 buses with no convergence or numerical issues.

Alternating-method of multipliers (ADMM)↗

Active Learning Guided Computational Discovery of Plant-Based Redoxmers for Organic Nonaqueous Redox Flow Batteries

Organic nonaqueous redox flow batteries (ONRFBs) are promising energy storage devices due to their scalability and reliance on sourceable materials. However, finding suitable redox-active organic molecules (redoxmers) for these batteries remains a challenge. Using plant-based compounds as precursors for these redoxmers can decrease their costs and environmental toxicity. In this computational study, flavonoid molecules have been examined as potential redoxmers for ONRFBs. Flavone and isoflavone derivatives were selected as catholyte (positive charge carrier) and anolyte (negative charge carrier) molecules, respectively. To drive their redox potentials to the opposite extremes, in silico derivatization was performed using a novel algorithm to generate a library of > 40000 candidate molecules that penalizes overly complex structures. A multiobjective Bayesian optimization based active learning algorithm was then used to identify best redoxmer candidates in these search spaces. Furthermore, our study provides methodologies for molecular design and optimization of natural scaffolds and highlights the need of incorporating expert chemistry awareness of the natural products and the basic rules of synthetic chemistry in machine learning.

25 ENERGY STORAGE↗

Smoothed particle hydrodynamics non-Newtonian model for ice-sheet and ice-shelf dynamics

Mathematical modeling of ice sheets is complicated by the non-linearity of the governing equations and boundary conditions. Standard grid-based methods require complex front tracking techniques and have limited capability to handle large material deformations and abrupt changes in bottom topography. As a consequence, numerical methods are usually restricted to shallow ice sheet and ice shelf approximations. We propose a new smoothed particle hydrodynamics (SPH) non-Newtonian model for coupled ice sheet and ice shelf dynamics. SPH, a fully Lagrangian particle method, is highly scalable and its Lagrangian nature and meshless discretization are well suited to the simulation of free surface flows, large material deformation, and material fragmentation. In this paper, SPH is used to study 3D ice sheet/ice shelf behavior, and the dynamics of the grounding line. The steady state position of the grounding line obtained from SPH simulations is in good agreement with laboratory observations for a wide range of simulated bedrock slopes, and density ratios, similar to those of ice and sea water. The numerical accuracy of the SPH algorithm is verif;ed by simulating Poiseuille flow, plane shear flow with free surface and the propagation of a blob of ice along a horizontal surface. In the laboratory experiment, the ice was represented with a viscous Newtonian fluid. In the present work, however, the ice is modeled as both viscous Newtonian fluid and non-Newtonian fluid, such that the effect of non-Newtonian rheology on the dynamics of grounding line was examined. The non-Newtonian constitutive relation is prescribed to be Glen’s law for the creep of polycrystalline ice. A V-shaped bedrock ramp is further introduced to model the real geometry of bedrock slope.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimal deployment of resources for maximizing impact in spreading processes

Significance Spreading processes play an increasingly important role in marketing, opinion setting, and epidemic modeling. Most existing algorithms for optimal resource allocation in spreading processes are based on topological characteristics of the underlying network and aim to maximize impact at infinite time. Clearly, realistic and efficient real-time allocation policies should consider both network properties and details of the dynamics; additionally, control may be applied only to a restricted set of accessible nodes, and impact should be maximized in a limited time window. We introduce a probabilistic targeting framework that incorporates the dynamics and encompasses previously considered optimization formulations. It is based on a scalable dynamic message-passing approach that allows for the solution of large real-world network instances.

60 APPLIED LIFE SCIENCES↗

Moment representation in the lattice Boltzmann method on massively parallel hardware

The widely-used lattice Boltzmann method (LBM) for computational fluid dynamics is highly scalable, but also significantly memory bandwidth-bound on current architectures. This paper presents a new regularized LBM implementation that reduces the memory footprint by only storing macroscopic, moment-based data. We show that the amount of data that must be stored in memory during a simulation is reduced by up to 47%. We also present a technique for cache-aware data re-utilization and show that optimizing cache utilization to limit data motion results in a similar improvement in time to solution. These new algorithms are implemented in the hemodynamics solver HARVEY and demonstrated using both idealized and realistic biological geometries. We develop a performance model for the moment representation algorithm and evaluate the performance on Summit.

Vardhan, Madhurima↗

A geometric initial guess for localized electronic orbitals in modular biological systems

Recent first-principles molecular dynamics algorithms using localized electronic orbitals have achieved O(N) complexity and controlled accuracy in simulating systems with finite band gaps. However, accurately deter- mining the centers of these localized orbitals during simulation setup may require O(N 3 ) operations, which is computationally infeasible for many biological systems. We present an O(N) approach for approximating orbital centers in proteins, DNA, and RNA which uses non-localized solutions for a set of fixed-size subproblems to create a set of geometric maps applicable to larger systems. This scalable approach, used as an initial guess in the O(N) first-principles molecular dynamics code MGmol, facilitates first-principles simulations in biological systems of sizes which were previously impossible.

59 BASIC BIOLOGICAL SCIENCES↗

A Smoothed Particle Hydrodynamics Model for Ice Sheet and Ice Shelf Dynamics

Mathematical modeling of ice sheets is complicated by the non-linearity of the governing equations and boundary conditions. Standard grid-based methods require complex front tracking techniques and have limited capability to handle large material deformations and abrupt changes in bottom topography. As a consequence, numerical methods are usually restricted to shallow ice sheet and ice shelf approximations. We propose a new smoothed particle hydrodynamics (SPH) model for coupled ice sheet and ice shelf dynamics. SPH is a fully Lagrangian particle method. It is highly scalable and its Lagrangian nature and meshless discretization are well suited to the simulation of free surface flows, large material deformation, and material fragmentation. In this paper SPH is used to study ice sheet/ice shelf behavior, and the dynamics of the grounding line. The steady state position of the grounding line obtained from the SPH simulations is in good agreement with laboratory observations for a wide range of simulated bedrock slopes, and density ratios similar to those of ice and sea water. The numerical accuracy of the SPH algorithm is further verified by simulating the plane shear flow of two immiscible fluids and the propagation of a highly viscous blob of fluid along a horizontal surface. In the experiment, the ice was represented with a viscous newtonian fluid. For consistency, in the described SPH model the ice is also modeled as a viscous newtonian fluid. Typically, ice sheets are modeled as a non-Newtonian fluid, accounting for the changes in the mechanical properties of ice. Implementation of a non-Newtonian rheology in the SPH model is the subject of our ongoing research.

54 ENVIRONMENTAL SCIENCES↗

A Comprehensive Solution for Managing TRU and LLW From Generation to Final Disposition - 13205

A LANL multi-disciplinary team faced the challenge of building and delivering a waste information system capable of managing radioactive, hazardous, and industrial waste from cradle to grave. The result is the Waste Compliance and Tracking System (WCATS) a flexible, adaptive system that has allowed LANL to consolidate its legacy applications into one system, and leverage the advantages of managing all waste types within a single scalable enterprise application. Key functionality required for robust waste operations, include: waste characterization, waste identification, transportation, inventory management, waste processing, and disposal. In order to maintain data quality, field operations such as waste identification, surveillance checklists, wall-to-wall inventory assessments, waste transfers, shipment pickup and receipt, and simple consolidation operations are captured by the operator or technician using mobile computers. Work flow is managed via end-user defined work paths, to ensure that unit operations are performed in the correct order. Regulatory compliance reports and algorithms are provided to support typical U.S. EPA, DOT, NRC, and DOE requirements, including the EPA hazardous waste manifest, NRC LLW manifest, DOE nuclear material at risk, RCRA TSDF inventory rules, and so forth. The WCATS application has allowed LANL to migrate and consolidate its disparate legacy applications. The design and implementation is generalized so that facility owners can customize the user interface, setup facilities and unit operations (i.e., treatment, storage, disposal, characterization, and administrative), define inventory compliance rules, and establish custom work flow requirements. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Scalable Nonlinear Compact Schemes

In this work, we focus on compact schemes resulting in tridiagonal systems of equations, specifically the fifth-order CRWENO scheme. We propose a scalable implementation of the nonlinear compact schemes by implementing a parallel tridiagonal solver based on the partitioning/substructuring approach. We use an iterative solver for the reduced system of equations; however, we solve this system to machine zero accuracy to ensure that no parallelization errors are introduced. It is possible to achieve machine-zero convergence with few iterations because of the diagonal dominance of the system. The number of iterations is specified a priori instead of a norm-based exit criterion, and collective communications are avoided. The overall algorithm thus involves only point-to-point communication between neighboring processors. Our implementation of the tridiagonal solver differs from and avoids the drawbacks of past efforts in the following ways: it introduces no parallelization-related approximations (multiprocessor solutions are exactly identical to uniprocessor ones), it involves minimal communication, the mathematical complexity is similar to that of the Thomas algorithm on a single processor, and it does not require any communication and computation scheduling.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Portable Acceleration Solutions for LArTPC Simulation Using Wire-Cell Toolkit

The Liquid Argon Time Projection Chamber (LArTPC) technology plays an essential role in many current and future neutrino experiments. Accurate and fast simulation is critical to developing efficient analysis algorithms and precise physics model projections. The speed of simulation becomes more important as Deep Learning algorithms are getting more widely used in LArTPC analysis and their training requires a large simulated dataset. Heterogeneous computing is an efficient way to delegate computationally intensive tasks to specialized hardware. However, as the landscape of compute accelerators quickly evolves, it becomes increasingly difficult to manually adapt the code to the latest hardware or software environments. A solution which is portable to multiple hardware architectures without substantially compromising performance would thus be very beneficial, especially for long-term projects such as the LArTPC simulations. In search of a portable, scalable and maintainable software solution for LArTPC simulations, we have started to explore high-level portable programming frameworks that support several hardware backends. In this paper, we present our experience porting the LArTPC simulation code in the Wire-Cell Toolkit to NVIDIA GPUs, first with the CUDA programming model and then with a portable library called Kokkos. Preliminary performance results on NVIDIA V100 GPUs and multi-core CPUs are presented, followed by a discussion of the factors affiecting the performance and plans for future improvements.

Yu, Haiwang↗

Development and validation of two-phase flow models and critical heat flux prediction for the highly-scalable CFD code NEK-2P

A project is underway to develop, verify and validate an advanced two-phase flow modeling capability for the highly-scalable high-performance CFD code NEK5000[1]. The goal of the project is to develop a new two-phase version of the NEK5000code, named NEK-2P, to simulate the two-phase flow and heat transfer phenomena that occur in a Boiling Water Reactor (BWR) fuel bundle under various operating conditions. The NEK-2P two-phase flow models follow the approach used for the Extended Boiling Framework [2-3] previously developed at Argonne, but include more fundamental physical models of boiling phenomena and advanced numerical algorithms for improved computational accuracy, robustness, and computational speed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Basic Research Needs in Quantum Computing and Networking

Employing quantum mechanical resources in computing, information processing, and networking opens the door to potential exponential advantages over classical counterparts. However, quantifying and realizing such advantages poses extensive scientific and engineering challenges. Department of Energy (DOE) investments have driven steady progress in addressing such challenges. Recently developed quantum algorithms offer asymptotic exponential advantages in speed or accuracy for fundamental scientific problems. These problems include simulating physical systems, solving systems of linear equations, differential equations, and optimization problems. Empirical demonstrations on nascent quantum hardware suggest better performance on contrived computational tasks than classical analogs. However, the requirements for a quantum computer or network to demonstrate an end-to-end rigorously quantifiable performance improvement over classical analogs remains a grand challenge, especially for problems of practical value. In particular, what will be required for quantum technology to ultimately exhibit scalable, rigorous, and transformative performance advantages for practical applications? In July 2023, DOE’s Advanced Scientific Computing Research program in the Office of Science convened the Workshop on Basic Research Needs in Quantum Computing and Networking, where major opportunities and grand challenges were identified. The following five priority research directions (PRDs) were identified as a result of the workshop.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗