Search NASA⌕ Search

SEARCH · Search NASA

Results for “Time parallelization”

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 415 records · Page 23

Parallel Unsteady Turbopump Flow Simulations for Reusable Launch Vehicles

An efficient solution procedure for time-accurate solutions of Incompressible Navier-Stokes equation is obtained. Artificial compressibility method requires a fast convergence scheme. Pressure projection method is efficient when small time-step is required. The number of sub-iteration is reduced significantly when Poisson solver employed with the continuity equation. Both computing time and memory usage are reduced (at least 3 times). Other work includes Multi Level Parallelism (MLP) of INS3D, overset connectivity for the validation case, experimental measurements, and computational model for boost pump.

Kiris, Cetin↗

Predicting Flows of Rarefied Gases

DSMC Analysis Code (DAC) is a flexible, highly automated, easy-to-use computer program for predicting flows of rarefied gases -- especially flows of upper-atmospheric, propulsion, and vented gases impinging on spacecraft surfaces. DAC implements the direct simulation Monte Carlo (DSMC) method, which is widely recognized as standard for simulating flows at densities so low that the continuum-based equations of computational fluid dynamics are invalid. DAC enables users to model complex surface shapes and boundary conditions quickly and easily. The discretization of a flow field into computational grids is automated, thereby relieving the user of a traditionally time-consuming task while ensuring (1) appropriate refinement of grids throughout the computational domain, (2) determination of optimal settings for temporal discretization and other simulation parameters, and (3) satisfaction of the fundamental constraints of the method. In so doing, DAC ensures an accurate and efficient simulation. In addition, DAC can utilize parallel processing to reduce computation time. The domain decomposition needed for parallel processing is completely automated, and the software employs a dynamic load-balancing mechanism to ensure optimal parallel efficiency throughout the simulation.

LeBeau, Gerald J.↗

Scalability of high-performance PDE solvers

Performance tests and analyses are critical to effective high-performance computing software development and are central components in the design and implementation of computational algorithms for achieving faster simulations on existing and future computing architectures for large-scale application problems. In this article, we explore performance and space-time trade-offs for important compute-intensive kernels of large-scale numerical solvers for partial differential equations (PDEs) that govern a wide range of physical applications. We consider a sequence of PDE-motivated bake-off problems designed to establish best practices for efficient high-order simulations across a variety of codes and platforms. We measure peak performance (degrees of freedom per second) on a fixed number of nodes and identify effective code optimization strategies for each architecture. In addition to peak performance, we identify the minimum time to solution at 80% parallel efficiency. The performance analysis is based on spectral and p-type finite elements but is equally applicable to a broad spectrum of numerical PDE discretizations, including finite difference, finite volume, and h-type finite elements.

97 MATHEMATICS AND COMPUTING↗

Stimulus configuration determines the detectability of motion signals in noise

We measured the detectability of moving signal dots in dynamic noise to determine whether local motion signals are preferentially combined along an axis parallel to the direction of motion. Observers were asked to detect a signal composed of three dots moving in a linear trajectory among dynamic noise dots. The signal dots were collinear and equally spaced in a configuration that was either parallel to or perpendicular to their trajectory. The probability of detecting the signal was measured as a function of noise density, over a range of signal dot spacings from 0.5 degrees to 5.0 degrees. At any given noise density, the signal in the parallel configuration was more detectable than that in the perpendicular configuration. Our four observers could tolerate 1.5-2.5 times more noise in the parallel configuration. This improvement is not due merely to temporal summation between consecutive dots in the parallel trajectory. Temporal summation functions measured on our observers indicate that the benefit from spatial coincidence of the dots lasts for no more than 50 ms, whereas the increased detectability of the parallel configuration is observed up to the largest temporal separations tested (210 ms). These results demonstrate that dots arranged parallel to the signal trajectory are more easily detected than those arranged perpendicularly. Moreover, this enhancement points to the existence of visual mechanisms that preferentially organize motion information parallel to the direction of motion.

Non-NASA Center↗

Parallel Finite Element Domain Decomposition for Structural/Acoustic Analysis

A domain decomposition (DD) formulation for solving sparse linear systems of equations resulting from finite element analysis is presented. The formulation incorporates mixed direct and iterative equation solving strategics and other novel algorithmic ideas that are optimized to take advantage of sparsity and exploit modern computer architecture, such as memory and parallel computing. The most time consuming part of the formulation is identified and the critical roles of direct sparse and iterative solvers within the framework of the formulation are discussed. Experiments on several computer platforms using several complex test matrices are conducted using software based on the formulation. Small-scale structural examples are used to validate thc steps in the formulation and large-scale (l,000,000+ unknowns) duct acoustic examples are used to evaluate the ORIGIN 2000 processors, and a duster of 6 PCs (running under the Windows environment). Statistics show that the formulation is efficient in both sequential and parallel computing environmental and that the formulation is significantly faster and consumes less memory than that based on one of the best available commercialized parallel sparse solvers.

Nguyen, Duc T.↗

Combining machine-learned and empirical force fields with the parareal algorithm: application to the diffusion of atomistic defects

We numerically investigate an adaptive version of the parareal algorithm in the context of molecular dynamics. This adaptive variant has been originally introduced in [1]. We focus here on test cases of physical interest where the dynamics of the system is modelled by the Langevin equation and is simulated using the molecular dynamics software LAMMPS. In this work, the parareal algorithm uses a family of machine-learning spectral neighbor analysis potentials (SNAP) as fine, reference, potentials and embedded-atom method potentials (EAM) as coarse potentials. We consider a self-interstitial atom in a tungsten lattice and compute the average residence time of the system in metastable states. Our numerical results demonstrate significant computational gains using the adaptive parareal algorithm in comparison to a sequential integration of the Langevin dynamics. We also identify a large regime of numerical parameters for which statistical accuracy is reached without being a consequence of trajectorial accuracy.

36 MATERIALS SCIENCE↗

Monitoring and Acquisition Real-time System (MARS)

MARS is a graphical user interface (GUI) written in MATLAB and Java, allowing the user to configure and control the Scalable Parallel Architecture for Real-Time Acquisition and Analysis (SPARTAA) data acquisition system. SPARTAA not only acquires data, but also allows for complex algorithms to be applied to the acquired data in real time. The MARS client allows the user to set up and configure all settings regarding the data channels attached to the system, as well as have complete control over starting and stopping data acquisition. It provides a unique "Test" programming environment, allowing the user to create tests consisting of a series of alarms, each of which contains any number of data channels. Each alarm is configured with a particular algorithm, determining the type of processing that will be applied on each data channel and tested against a defined threshold. Tests can be uploaded to SPARTAA, thereby teaching it how to process the data. The uniqueness of MARS is in its capability to be adaptable easily to many test configurations. MARS sends and receives protocols via TCP/IP, which allows for quick integration into almost any test environment. The use of MATLAB and Java as the programming languages allows for developers to integrate the software across multiple operating platforms.

Holland, Corbin↗

Performance of a plasma fluid code on the Intel parallel computers

One approach to improving the real-time efficiency of plasma turbulence calculations is to use a parallel algorithm. A parallel algorithm for plasma turbulence calculations was tested on the Intel iPSC/860 hypercube and the Touchtone Delta machine. Using the 128 processors of the Intel iPSC/860 hypercube, a factor of 5 improvement over a single-processor CRAY-2 is obtained. For the Touchtone Delta machine, the corresponding improvement factor is 16. For plasma edge turbulence calculations, an extrapolation of the present results to the Intel (sigma) machine gives an improvement factor close to 64 over the single-processor CRAY-2.

Lynch, V. E.↗

Code Parallelization with CAPO: A User Manual

A software tool has been developed to assist the parallelization of scientific codes. This tool, CAPO, extends an existing parallelization toolkit, CAPTools developed at the University of Greenwich, to generate OpenMP parallel codes for shared memory architectures. This is an interactive toolkit to transform a serial Fortran application code to an equivalent parallel version of the software - in a small fraction of the time normally required for a manual parallelization. We first discuss the way in which loop types are categorized and how efficient OpenMP directives can be defined and inserted into the existing code using the in-depth interprocedural analysis. The use of the toolkit on a number of application codes ranging from benchmark to real-world application codes is presented. This will demonstrate the great potential of using the toolkit to quickly parallelize serial programs as well as the good performance achievable on a large number of toolkit to quickly parallelize serial programs as well as the good performance achievable on a large number of processors. The second part of the document gives references to the parameters and the graphic user interface implemented in the toolkit. Finally a set of tutorials is included for hands-on experiences with this toolkit.

Jin, Hao-Qiang↗

Cross-field and parallel dynamics of SOL filaments in TCV

Using recently installed scrape-off layer diagnostics on the tokamak à configuration variable, we characterise the poloidal and parallel properties of turbulent filaments. We access both attached and detached divertor conditions across a wide range of core densities (f G ϵ [0.09, 0.66]) in diverted L-mode plasma configurations. With a gas puff imaging (GPI) diagnostic at the outer midplane we observed filaments with a monotonic increase in radial velocity (from 390 m s –1 to 800 m s –1 ) and cross-field radii (from 8.5 mm to 13.4 mm) with increasing core density. Interpreting the filament behaviour in the context of the two-region model, we find that they populate the ideal-interchange regime (C i ) in discharges at very low densities, and the resistive X (RX)-point regime for all other discharges. The scaling of filament velocity versus size shows good agreement with this interpretation. These results are discussed and compared with previous probe-based measurements for similar conditions, which mostly placed filaments in TCV in the resistive ballooning (RB) regime. In addition, for the first time in TCV, the parallel filament extension is studied by magnetically aligning the GPI measurements at the outboard midplane with a reciprocating probe in the divertor. In agreement with the filaments being in the ideal-interchange and the RX-point regimes, they are found to extend beyond the X-point into the outer divertor leg.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Self-consistent formation of parallel electric fields in the auroral zone

This paper presents results from a fully self-consistent kinetic particle simulation of the time-dependent formation of large scale parallel electric fields in the auroral zone. The results show that magnetic mirroring of the hot plasma that streams earthward from the magnetotail leads to a charge separation potential drop of many kilovolts, over an altitude range of a few thousand kilometers. Once the potential drop is formed, it remains relatively static and is maintained in time by the constant input of hot plasma from the tail; the parallel electric field accelerates ions away from Earth and ionospheric electrons towards the Earth. At altitudes above where the ions are mirror reflected and accelerated by the parallel electric field, low frequency waves are generated, possibly due to an ion/ion two-stream interaction.

Schriver, David↗

Toward active disruption avoidance via real-time estimation of the safe operating region and disruption proximity in tokamaks

This paper describes a real-time capable algorithm for identifying the safe operating region around a tokamak operating point. The region is defined by a convex set of linear constraints, from which the distance of a point from a disruptive boundary can be calculated. The disruptivity of points is calculated from an empirical machine learning predictor that generates the likelihood of disruption. While the likelihood generated by such empirical models can be compared to a threshold to trigger a disruption mitigation system, the safe operating region calculation enables active optimization of the operating point to maintain a safe margin from disruptive boundaries. The proposed algorithm is tested using a random forest disruption predictor fit on data from DIII-D. The safe operating region identification algorithm is applied to historical data from DIII-D showing the evolution of disruptive boundaries and the potential impact of optimization of the operating point. Real-time relevant execution times are made possible by parallelizing many of the calculation steps and implementing the algorithm on a graphics processing unit. Lastly, a real-time capable algorithm for optimizing the target operating point within the identified constraints is also proposed and simulated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

OpenMP Parallelization and Optimization of Graph-Based Machine Learning Algorithms

In this paper, we investigate the OpenMP parallelization and optimization of two novel data classification algorithms. The new algorithms are based on graph and PDE solution techniques and provide significant accuracy and performance advantages over traditional data classification algorithms in serial mode. The methods leverage the Nystrom extension to calculate eigenvalue/eigenvectors of the graph Laplacian and this is a self-contained module that can be used in conjunction with other graph-Laplacian based methods such as spectral clustering. We use performance tools to collect the hotspots and memory access of the serial codes and use OpenMP as the parallelization language to parallelize the most time-consuming parts. Where possible, we also use library routines. We then optimize the OpenMP implementations and detail the performance on traditional supercomputer nodes (in our case a Cray XC30), and test the optimization steps on emerging testbed systems based on Intel’s Knights Corner and Landing processors. We show both performance improvement and strong scaling behavior. Finally, a large number of optimization techniques and analyses are necessary before the algorithm reaches almost ideal scaling.

97 MATHEMATICS AND COMPUTING↗

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗

Shifting modes of iron sulfidization at the onset of OAE-2 drive regional shifts in pyrite δ 34 S records

We report total reduced inorganic S isotope ratios (δ 34 S CRS ) shift toward more negative values across much of the southern North Atlantic just before the onset of the Cenomanian-Turonian Ocean Anoxic Event (OAE-2). At the same time, there is no parallel isotopic change in the significantly larger pool of kerogen (organic) S, which indicates that the distribution and S-isotope composition of sulfide in the environment likely did not drive the change in δ 34 S CRS . Here, we investigate possible explanations for the negative shift in δ 34 S CRS values and their divergence from organic S by isolating iron sulfides for morphological identification and grain-specific isotopic analysis using secondary ion mass spectrometry (SIMS). In pre- and syn-OAE-2 sedimentary rocks from Demerara Rise, we find four distinct morphologies of iron sulfides: pyrite framboids (1–20 μm diameter), irregular pyrite aggregates (1–38 μm diameter), large cemented pyrite aggregates (~60 μm diameter), and irregular and cemented aggregates of the pyrite polymorph marcasite (1–45 μm diameter). These different textural groups have distinct S-isotopic compositions that are largely consistent through the onset of OAE-2. As such, the secular change in bulk δ 34 S CRS values likely reflects the changing proportions of these phases stratigraphically across OAE-2. All textural groups feature resolvable intra-grain δ 34 S variability, suggesting that the environments in which they formed were characterized by dynamic sulfide δ 34 S values and/or by partial closed-system distillation. We use grain-specific δ 34 S distributions to rule out shoaling of the chemocline within the sediments as a mechanism for the observed decrease in δ 34 S CRS . Instead, we propose that changes in the reactivity of the iron species delivered to Demerara Rise over the ~200 kyr leading up to the onset of OAE-2 impacted the relative contributions of pyrite with S-isotope signatures reflecting the water column, shallow sediments, and deeper sediments to the bulk sedimentary δ 34 S CRS value. Specifically, the change in iron reactivity at the onset of OAE-2 favored the production of 34 S-depleted large, cemented aggregates and framboids at the expense of more 34 S-enriched irregular aggregates. Our results underscore that bulk δ 34 S CRS measurements integrate multiple reduced phases that form via distinct reaction mechanisms and potentially in different parts of the depositional environment. Grain-specific SIMS analyses dramatically enrich our ability to interpret pyrite isotopic patterns in the geologic record.

58 GEOSCIENCES↗

Sparse, iterative simulation methods for one-dimensional laminar flames

Sparse, iterative simulation methods for one-dimensional laminar flames are proposed. The resulting steady and unsteady flame solvers exploit approximate Jacobians to greatly reduce the computational cost associated with matrix operations. The constant, non-unity Lewis number assumption is introduced to further reduce the computational cost. The solvers are also parallelized to reduce time-to-solution on distributed memory computer systems. Computed laminar flame speeds and species profiles for a range of chemical mechanisms (from 10 to 2878 species) are compared against a well-validated commercial code and are found to be consistent within solver tolerances. The computation times of both the unsteady and steady solutions increase only linearly with the number of species, which is a significant improvement over the quadratic or cubic scaling of existing steady-state flame solvers. For the largest mechanism tested, the steady-state flame solver is two orders of magnitude faster than commonly-used codes. The use of an approximate Jacobian is shown to reduce the rate of convergence for the steady-state solver, but does not significantly affect the domain of convergence. The steady-state solver with approximate Jacobian is thus well suited for computationally efficient laminar flame speed sweeps with large kinetic mechanisms.

42 ENGINEERING↗

Advancing specialized biofoundries via automated adaptive laboratory evolution

Adaptive laboratory evolution (ALE) is a powerful strategy for improving microbial phenotypes by harnessing natural selection under defined environmental conditions. Through applying selection regimes, beneficial mutations accumulate, enabling the generation of strains with enhanced properties. However, conventional ALE is labor-intensive and difficult to scale, limiting reproducibility and broader discovery of evolutionary principles. Recent advances in robotics, automation, and computational infrastructure are transforming ALE into a scalable, data-rich experimental paradigm. Automated platforms enable standardized and complex protocols, real-time monitoring, and highly parallel evolution campaigns, improving consistency while generating longitudinal datasets that reveal convergent adaptive mechanisms. Here, we discuss the role of specialized biofoundries in advancing automated ALE and enabling large-scale evolutionary engineering. We review major automated ALE formats and outline key design principles for effective ALE biofoundries, highlighting how automated ALE can support autonomous experimentation and AI-guided strain engineering.

59 BASIC BIOLOGICAL SCIENCES↗

Domain decomposition in time for PDE-constrained optimization

Here, PDE-constrained optimization problems have a wide range of applications, but they lead to very large and ill-conditioned linear systems, especially if the problems are time dependent. In this paper we outline an approach for dealing with such problems by decomposing them in time and applying an additive Schwarz preconditioner in time, so that we can take advantage of parallel computers to deal with the very large linear systems. We then illustrate the performance of our method on a variety of problems.

97 MATHEMATICS AND COMPUTING↗