Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel methods”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

RAPID

Parallel computer code for the simulator for dynamics of power systems which has the capability to initiate the system and create different faults for the dynamic analysis. The code is based on time-parallel method (Parareal) with Adaptive Method Reduction (AMR). The coarse solvers for the Parareal algorithm include several Semi Analytical Solution methods. Also, Integrated simulation of coupled transmission and distribution systems can be studied.

Simunovic, Srdjan [Oak Ridge National Lab. (ORNL),↗
DOE OSTI2015

A Brief Summary on Formalizing Parallel Tensor Distributions, Redistributions, and Algorithm Derivations

Large-scale datasets in computational chemistry typically require distributed-memory parallel methods to perform a special operation known as tensor contraction. Tensors are multidimensional arrays, and a tensor contraction is akin to matrix multiplication with special types of permutations. Creating an efficient algorithm and optimized implementation in this domain is complex, tedious, and error-prone. To address this, we develop a notation to express data distributions so that we can apply use automated methods to find optimized implementations for tensor contractions. We consider the spin-adapted coupled cluster singles and doubles method from computational chemistry and use our methodology to produce an efficient implementation. Experiments per- formed on the IBM Blue Gene/Q and Cray XC30 demonstrate impact both improved performance and reduced memory consumption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Efficacy of the SU(3) scheme for ab initio large-scale calculations beyond the lightest nuclei

We report on the computational characteristics of ab initio nuclear structure calculations in a symmetry-adapted no-core shell model (SA-NCSM) framework. We examine the computational complexity of the current implementation of the SA-NCSM approach, dubbed LSU3shell, by analyzing ab initio results for 6 Li and 12 C in large harmonic oscillator model spaces and SU(3)-selected subspaces. We demonstrate LSU3shell's strong-scaling properties achieved with highly-parallel methods for computing the many-body matrix elements. Results compare favorably with complete model space calculations and signi cant memory savings are achieved in physically important applications. In particular, a well-chosen symmetry-adapted basis a ords memory savings in calculations of states with a fixed total angular momentum in large model spaces while exactly preserving translational invariance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Production of FR Tubing from Advanced ODS Alloys

Significant research is underway to develop LWR nuclear fuels with improved accident tolerance. One of the leading candidate materials for cladding are the FeCrAl alloys. New alloys produced at ORNL called Gen I and Gen II FeCrAl alloys possess excellent oxidation resistance in steam up to 1400°C and in parallel methods are being developed to produce tubing from these alloys. Century tubing continues to produce excellent tubing from FeCrAl alloys. This memo reports receipt of ~21 feet of Gen I FeCrAl alloy tubing. This tubing will be used for future tests including burst testing, mechanical testing and irradiation testing.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Development of a Library for Conducting Monte Carlo Tallies on Heterogeneous Systems

A library is introduced that enables users to conduct Monte Carlo tallies on heterogeneous computing systems. The library can be built with or linked to a Monte Carlo transport code to provide tally capabilities for the project. The library provides a set of tools and an interface for constructing tallies that can be computed on CPUs or GPUs regardless of where the sample data was generated. The library can be incorporated into existing Monte Carlo transport codes at both the research and production level with minimal intrusion into the transport code. The tally library is capable of computing a variety of tallies including track-length histogram (mesh) tallies, collisionbased kernel density estimators, functional expansion tallies, eigenvalue sensitivity coefficients via iterated fission probability, and sensitivities of reaction rates or adjoint-weighted quantities via differential operator sampling. The parallelization methods are discussed and speedups are shown for 2-D and 3-D problems with comparisons to both the tally library CPU implementations as well as the tally capabilities in the host transport code. Performance results and examples are shown for MCNP, MCATK, and OpenMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Smoothed aggregation adaptive spectral element-based algebraic multigrid

SAAMGE provides parallel methods for building multilevel hierarchies and solvers that can be used for elliptic equations with highly heterogeneous coefficients. Additionally, hierarchy adaptation is implemented allowing solving multiple problems with close coefficients without rebuilding the hierarchy.

Source record↗
DOE OSTI2016

Parallel Evolutionary Optimization for Neuromorphic Network Training

One of the key impediments to the success of current neuromorphic computing architectures is the issue of how best to program them. Evolutionary optimization (EO) is one promising programming technique; in particular, its wide applicability makes it especially attractive for neuromorphic architectures, which can have many different characteristics. In this paper, we explore different facets of EO on a spiking neuromorphic computing model called DANNA. We focus on the performance of EO in the design of our DANNA simulator, and on how to structure EO on both multicore and massively parallel computing systems. We evaluate how our parallel methods impact the performance of EO on Titan, the U.S.'s largest open science supercomputer, and BOB, a Beowulf-style cluster of Raspberry Pi's. We also focus on how to improve the EO by evaluating commonality in higher performing neural networks, and present the result of a study that evaluates the EO performed by Titan.

Schuman, Catherine D↗
DOE OSTI2023

Automated methods for scalable, parallelized enzymatic biopolymer synthesis and modification using microfluidic devices

Methods for the automated template-free synthesis of user-defined sequence controlled biopolymers using microfluidic devices are described. The methods facilitate simultaneous synthesis of up to thousands of uniquely addressed biopolymers from the controlled movement and combination of regents as fluid droplets using microfluidic and EWOD-based systems. In some forms, biopolymers including nucleic acids, peptides, carbohydrates, and lipids are synthesized from step-wise assembly of building blocks based on a user-defined sequence of droplet movements. In some forms, the methods synthesize uniquely addressed nucleic acids of up to 1,000 nucleotides in length. Methods for adding, removing and changing barcodes on biopolymers are also provided. Biopolymers synthesized according to the methods, and libraries and databases thereof are also described. Modified biopolymers, including chemically modified nucleotides and biopolymers conjugated to other molecules are described.

Banal, James↗
DOE OSTI2016

A survey on software methods to improve the energy efficiency of parallel computing

Energy consumption is one of the top challenges for achieving the next generation of supercomputing. Codesign of hardware and software is critical for improving energy efficiency (EE) for future large-scale systems. Many architectural power-saving techniques have been developed, and most hardware components are approaching physical limits. Accordingly, parallel computing software, including both applications and systems, should exploit power-saving hardware innovations and manage efficient energy use. In addition, new power-aware parallel computing methods are essential to decrease energy usage further. This article surveys software-based methods that aim to improve EE for parallel computing. It reviews the methods that exploit the characteristics of parallel scientific applications, including load imbalance and mixed precision of floating-point (FP) calculations, to improve EE. In addition, this article summarizes widely used methods to improve power usage at different granularities, such as the whole system and per application. In particular, it describes the most important techniques to measure and to achieve energy-efficient usage of various parallel computing facilities, including processors, memories, and networks. Overall, this article reviews the state-of-the-art of energy-efficient methods for parallel computing to motivate researchers to achieve optimal parallel computing under a power budget constraint.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Real-time fault detection and transient identification using extended Kalman filters - 254

In this paper, real-time fault detection and transient identification are studied with adaptive estimation methods, in particular parallel processing methods by implementing a bank of extended Kalman filters. Adaptive estimation is combined with probabilistic risk assessment to allow for real-time continuous monitoring of initiating events. The approach provides a probability of an initiating event happening. Real-time monitoring of initiating events can reduce labor demand. Each extended Kalman filter is configured to operate at a single configuration, either at normal operation or a faulted state. Fault detection is based on calculating a likelihood function for each extended Kalman filter to determine the posteriori conditional probability that the system configuration is the true configuration. The transient identification is determined by performing a multivariate statistical analysis on each extended Kalman filter to provide a posterior probability assessment that the reactor states and its dynamics are within the allowable limits. The probability distribution being outside the allowable limits indicate a transient has occurred. The combination of parallel processing methods with the multivariate statistical analysis for transient identification allows for the operator to perform transient identification with having a high level of certainty of the current system configuration. We demonstrate the real-time fault detection and transient identification on a simple reactor example to determine the reactor power, reactor temperature, and coolant temperature in the presence of various faults. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

A calibration method for overconstrained spatial translational parallel manipulators

A calibration method for overconstrained spatial translational parallel mechanisms is proposed. The calibration of a Tri-pyramid overconstrained parallel robot is used as a vehicle to demonstrate the methodology and verify its feasibility. The proposed methodology consists of transforming the overconstrained mechanism of the robot into a non-overconstrained mechanism by replacing its redundant constraints with generalized forces (couples). The kinematic model of the non-overconstrained mechanism is derived using vector loops while its mechanical model is established by the energy method. An integrated kinematic model of the original overconstrained parallel robot is subsequently established by expressing the actual position of the end effector as the sum of the position derived by the kinematic model of the non-overconstrained mechanism and of the force-induced deformations at the end effector derived from the mechanical model. To assess the feasibility and the attainable improvements in accuracy through calibration, the positions of the end effector of the Tri-pyramid robot were measured by a method that uses a Double Ball Bar (DBB) and a 3-axes linear stage with micrometers. Based on the integrated kinematic model of the robot and the measured data, its structural parameters were identified by the Newton–Raphson iteration and least squares methods to complete the calibration. The calibration result shows that accuracy improvements on the order of 90% are achievable.

42 ENGINEERING↗
DOE OSTI2024

Parallel-in-Time Methods for Method-of-Lines Discretizations of Nonlinear Hyperbolic PDEs and Systems (Final Report)

The work for the subcontract is situated in the area of parallel-in-time integration for hyperbolic partial differential equations (PDEs). Parallel-in-time integration is an active area of research due to its ability to enable faster numerical simulations for applications throughout many areas of science. The work in this subcontract builds on a variety of results that were obtained, as part of the work performed for Subcontract No. B648355, for the Multigrid Reduction-in-Time (MGRIT) method from [1] applied to hyperbolic PDEs. This subcontract extends these results further to more efficient methods and to the case of method-of-lines discretizations for nonlinear hyperbolic PDES and systems of PDEs. The following is a summary of the research performed and results achieved during milestone periods 1, 2 and 3 by the PI (Hans De Sterck) and Postdoctoral Research Associate (Oliver Krzysik), for required tasks 1-4 (as listed in the Statement of Work): Research over the previous year has been split into three main projects: (i) solution of acoustic equation system; (ii) solution of nonlinear scalar hyperbolic PDEs; (iii) solution of nonlinear hyperbolic systems of PDEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A massively-parallel, unstructured overset method to simulate moving bodies in turbulent flows

An unstructured overset method capable of performing direct numerical simulation (DNS) and large eddy simulation (LES) of many (O(10 5 )) moving bodies, utilizing many computational cores (O(10 5 )), in turbulent, incompressible fluid flow is presented. Unstructured meshes are attached to bodies and placed within a fixed background domain. Body meshes are allowed to arbitrarily overlap and move throughout the domain. Within each mesh a high resolution, unstructured, non-dissipative finite volume method is used to solve for the flow field. Boundary conditions for each mesh are provided by interpolation from flow solutions on overlapping meshes. When many unstructured meshes of different resolution overlap, care is required in the connection between the different flow solutions. An interpolant is created which seeks to preserve volume conservation of flow quantities between meshes regardless of overlapping mesh differences. An implicit fractional step method is used for time advancement, requiring the calculation of a predicted fluid velocity and corrector pressure field. For the predictor step, the resulting interpolation is directly introduced into the implicit equations for the predicted flow field. For the corrected pressure field, the continuity between meshes is weakly enforced using a penalty formulation. The pressure formulation is symmetric, positive-definite and non-singular resulting in a formulation which is readily solvable using traditional iterative matrix inversion techniques. An Arbitrary Euler-Lagrangian (ALE) method coupled to a 6 degrees of freedom rigid body equation system (6-DOF) is used for body motion. For rotation, a quaternion representation is used to solve Euler's equations of rigid body motion. A linear spring damper model, which uses geometry information readily available from the overset assembly process, is used for collisions. Validation of the method for canonical flow fields is presented including assessment of order of accuracy and kinetic energy conservation properties. Particle-resolved direct numerical simulation (PR-DNS) of single particles in various flow fields are presented for validation. PR-DNS results of 50,000 spherical particles freely moving within turbulent channel flow are shown as a demonstration of the method at full scale. LES results of a marine propeller under crashback conditions are shown to demonstrate the ability to simulate highly unsteady turbulent flows over complex, moving geometries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

A parallel adaptive numerical method with generalized curvilinear coordinate transformation for compressible Navier–Stokes equations

A fourth-order finite-volume method for solving the Navier–Stokes equations on a mapped grid with adaptive mesh refinement is proposed, implemented, and demonstrated for the prediction of unsteady compressible viscous flows. The method employs fourth-order quadrature rules for evaluating face-averaged fluxes. Our approach is freestream preserving, guaranteed by the way of computing the averages of the metric terms on the faces of cells. The standard Runge–Kutta marching method is used for time discretization. Solutions of a smooth flow are obtained in order to verify that the method is formally fourth-order accurate when applying the nonlinear viscous operators on mapped grids. Solutions of a shock tube problem are obtained to demonstrate the effectiveness of adaptive mesh refinement in resolving discontinuities. A Mach reflection problem is solved to demonstrate the mapped algorithm on a non-rectangular physical domain. The simulation is compared against experimental results. Future work will consider mapped multiblock grids for practical engineering geometries.

97 MATHEMATICS AND COMPUTING↗