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.

SourceResearch connectionFrom yearThrough year

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

At least 685 records · Page 38

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Fast Parallel Computation Of Manipulator Inverse Dynamics

Method for fast parallel computation of inverse dynamics problem, essential for real-time dynamic control and simulation of robot manipulators, undergoing development. Enables exploitation of high degree of parallelism and, achievement of significant computational efficiency, while minimizing various communication and synchronization overheads as well as complexity of required computer architecture. Universal real-time robotic controller and simulator (URRCS) consists of internal host processor and several SIMD processors with ring topology. Architecture modular and expandable: more SIMD processors added to match size of problem. Operate asynchronously and in MIMD fashion.

Fijany, Amir↗

DOE OSTI2015

TU-AB-303-03: CBCT-Based On-Site Simulation, Planning, and Delivery (OSPD) for Whole Brain Radiotherapy

Purpose: To demonstrate the feasibility of a CBCT-based on-site simulation, planning, and delivery (OSPD) for whole brain radiotherapy, in which all steps from imaging, planning to treatment delivery are performed at the treatment unit in one appointment time slot. This work serves as the proof of concept for future OSPD single fraction radiation therapy. Methods: An integrated on-site imaging, planning and delivery workflow was developed and tested for whole brain radiotherapy. An automated two-opposed-oblique-beam plan is created by utilizing the treatment planning system scripting and simple field-in-field IMRT. The IMRT plan is designed with maximum 8 control points to cover the target volume consisting of the brain to C1/C2 of the spinal cord, with dose homogeneity criteria from −5% to +7% of the prescription dose. Due to inaccuracy of reconstructed Hounsfield unit numbers in CBCT images, the dose distribution is calculated with non-heterogeneity correction introducing only clinically insignificant dose discrepancy. A coherent and synchronized workflow was designed for a team of attending physician, physicist, therapists, and dosimetrist to work closely with the ability to quickly modify, approve, and implement the treatment. Results: Thirty-one patients have been treated with this OSPD treatment, without compromising the plan quality compared to our regular clinically used parallel apposed 2D plans. The average time for these procedures are 48.02 ±11.55 minutes from the time patient entered the treatment room until s/he exited, and 35.09 ±10.35 minutes from starting CBCT until last beam delivered. This time duration is comparable to the net time when individual tasks are summed up during our regular CT- based whole brain planning and delivery. Conclusions: The OSPD whole brain treatment has been tested to be clinically feasible. The next step is to further improve the efficiency and to streamline the workflow. Other disease sites will be also tested with this new technology.

60 APPLIED LIFE SCIENCES↗

NASA NTRS1978

Studies in optical parallel processing

Threshold and A/D devices for converting a gray scale image into a binary one were investigated for all-optical and opto-electronic approaches to parallel processing. Integrated optical logic circuits (IOC) and optical parallel logic devices (OPA) were studied as an approach to processing optical binary signals. In the IOC logic scheme, a single row of an optical image is coupled into the IOC substrate at a time through an array of optical fibers. Parallel processing is carried out out, on each image element of these rows, in the IOC substrate and the resulting output exits via a second array of optical fibers. The OPAL system for parallel processing which uses a Fabry-Perot interferometer for image thresholding and analog-to-digital conversion, achieves a higher degree of parallel processing than is possible with IOC.

Lee, S. H.↗

NASA NTRS1992

An obstacle to building a time machine

Gott (1991) has shown that a spacetime with two infinite parallel cosmic strings passing each other with sufficient velocity contains closed timelike curves. An attempt to build such a time machine is discussed. Using the energy-momentum conservation laws in the equivalent (2 + 1)-dimensional theory, the spacetime representing the decay of one gravitating particle into two is explicitly constructed; there is never enough mass in an open universe to build the time machine from the products of decays of stationary particles. More generally, the Gott time machine cannot exist in any open (2 + 1)-dimensional universe for which the total momentum is timelike.

Carroll, Sean M.↗

DOE OSTI2020

Solving gyrokinetic systems with higher-order time dependence

We discuss theoretical and numerical aspects of gyrokinetics as a Lagrangian field theory when the field perturbation is introduced into the symplectic part. A consequence is that the field equations and particle equations of motion in general depend on the time derivatives of the field. The most well-known example is when the parallel vector potential is introduced as a perturbation, where a time derivative of the field arises only in the equations of motion, so an explicit equation for the fields may still be written. We will consider the conceptually more problematic case where the time-dependent fields appear in both the field equations and equations of motion, but where the additional term in the field equations is formally small. The conceptual issues were described by Burby (J. Plasma Phys., vol. 82 (3), 2016, 905820304): these terms lead to apparent additional degrees of freedom to the problem, so that the electric field now requires an initial condition, which is not required in low-frequency (Darwin) Vlasov–Maxwell equations. Also, the small terms in the Euler–Lagrange equations are a singular perturbation, and these two issues are interlinked. For well-behaved problems the apparent additional degrees of freedom are spurious, and the physically relevant solution may be directly identified. Because we needed to assume that the system is well behaved for small perturbations when deriving gyrokinetic theory, we must continue to assume that when solving it, and the physical solutions are thus the regular ones. The spurious nature of the singular degrees of freedom may also be seen by changing coordinate systems so the varying field appears only in the Hamiltonian. We then describe how methods appropriate for singular perturbation theory may be used to solve these asymptotic equations numerically. We then describe a proof-of-principle implementation of these methods for an electrostatic strong-flow gyrokinetic system; two basic test cases are presented to illustrate code functionality.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1989

A real time microcomputer implementation of sensor failure detection for turbofan engines

An algorithm was developed which detects, isolates, and accommodates sensor failures using analytical redundancy. The performance of this algorithm was demonstrated on a full-scale F100 turbofan engine. The algorithm was implemented in real-time on a microprocessor-based controls computer which includes parallel processing and high order language programming. Parallel processing was used to achieve the required computational power for the real-time implementation. High order language programming was used in order to reduce the programming and maintenance costs of the algorithm implementation software. The sensor failure algorithm was combined with an existing multivariable control algorithm to give a complete control implementation with sensor analytical redundancy. The real-time microprocessor implementation of the algorithm which resulted in the successful completion of the algorithm engine demonstration, is described.

Delaat, John C.↗

NASA NTRS1990

A real time microcomputer implementation of sensor failure detection for turbofan engines

An algorithm was developed that detects, isolates, and accommodates sensor failures using analytical redundancy. The performance of this algorithm has been demonstrated on a full-scale F100 turbofan engine. The algorithm was implemented in real-time on a microprocessor-based controls computer which includes parallel processing and high order language programming. Parallel processing was used to achieve the required computational power for the real-time implementation. High order language programming was used in order to reduce the programming and maintenance costs of the algorithm implementation software. The sensor failure algorithm was combined with an existing multivariable control algorithm to give a complete control implementation with sensor analytical redundancy. The real-time microprocessor implementation of the algorithm, which resulted in the successful completion of the algorithm engine demonstration, is described.

Delaat, John C.↗

DOE OSTI2020

Vertex Reordering for Real-world Graphs and Applications: An Empirical Evaluation

Vertex reordering is a way to improve locality in graph computations. Given an input (or ``natural'') order, reordering aims to compute an alternate permutation of the vertices that is aimed at maximizing a locality-based objective. Given decades of research on this topic, there are tens of graph reordering schemes, and there are also several linear arrangement ``gap'' measures for treatment as objectives. However, a comprehensive empirical analysis of the efficacy of the ordering schemes against the different gap measures, and against real-world applications is currently lacking. In this study, we present an extensive empirical evaluation of up to 11 ordering schemes, taken from different classes of approaches, on a set of 34 real-world graphs emerging from different application domains. Our study is presented in two parts: a) a thorough comparative evaluation of the different ordering schemes on their effectiveness to optimize different linear arrangement gap measures, relevant to preserving locality; and b) extensive evaluation of the impact of the ordering schemes on two real-world, parallel graph applications, namely, community detection and influence maximization. Our studies show a significant divergence among the ordering schemes (up to $40\times$ between the best and the poor) in their effectiveness to reduce the gap measures; and a wide ranging impact of the ordering schemes on various aspects including application runtime (up to $4\times$), memory and cache use, load balancing, and parallel work and efficiency. The comparative study also help reveal the nuances of a parallel environment (compared to serial) on the ordering schemes and their role in optimizing applications.

Barik, Reet↗

NASA NTRS1993

Boundary layer receptivity and control

Receptivity processes initiate natural instabilities in a boundary layer. The instabilities grow and eventually break down to turbulence. Consequently, receptivity questions are a critical element of the analysis of the transition process. Success in modeling the physics of receptivity processes thus has a direct bearing on technological issues of drag reduction. The means by which transitional flows can be controlled is also a major concern: questions of control are tied inevitably to those of receptivity. Adjoint systems provide a highly effective mathematical method for approaching many of the questions associated with both receptivity and control. The long term objective is to develop adjoint methods to handle increasingly complex receptivity questions, and to find systematic procedures for deducing effective control strategies. The most elementary receptivity problem is that in which a parallel boundary layer is forced by time-harmonic sources of various types. The characteristics of the response to such forcing form the building blocks for more complex receptivity mechanisms. The first objective of this year's research effort was to investigate how a parallel Blasius boundary layer responds to general direct forcing. Acoustic disturbances in the freestream can be scattered by flow non-uniformities to produce Tollmien-Schlichting waves. For example, scattering by surface roughness is known to provide an efficient receptivity path. The present effort is directed towards finding a solution by a simple adjoint analysis, because adjoint methods can be extended to more complex problems. In practice, flows are non-parallel and often three-dimensional. Compressibility may also be significant in some cases. Recent developments in the use of Parabolized Stability Equations (PSE) offer a promising possibility. By formulating and solving a set of adjoint parabolized equations, a method for mapping the efficiency with which external forcing excites the three-dimensional motions of a non-parallel boundary layer was developed. The method makes use of the same computationally efficient formulation that makes the PSE currently so appealing. In the area of flow control, adjoint systems offer a powerful insight into the effect of control forces. One of the simplest control strategies for boundary layers involves the application of localized mean wall suction.

Hill, D. C.↗

NASA NTRS2003

Software Aids Visualization of Computed Unsteady Flow

Unsteady Flow Analysis Toolkit (UFAT) is a computer program that synthesizes motions of time-dependent flows represented by very large sets of data generated in computational fluid dynamics simulations. Prior to the development of UFAT, it was necessary to rely on static, single-snapshot depictions of time-dependent flows generated by flow-visualization software designed for steady flows. Whereas it typically takes weeks to analyze the results of a largescale unsteady-flow simulation by use of steady-flow visualization software, the analysis time is reduced to hours when UFAT is used. UFAT can be used to generate graphical objects of flow visualization results using multi-block curvilinear grids in the format of a previously developed NASA data-visualization program, PLOT3D. These graphical objects can be rendered using FAST, another popular flow visualization software developed at NASA. Flow-visualization techniques that can be exploited by use of UFAT include time-dependent tracking of particles, detection of vortex cores, extractions of stream ribbons and surfaces, and tetrahedral decomposition for optimal particle tracking. Unique computational features of UFAT include capabilities for automatic (batch) processing, restart, memory mapping, and parallel processing. These capabilities significantly reduce analysis time and storage requirements, relative to those of prior flow-visualization software. UFAT can be executed on a variety of supercomputers.

Kao, David↗

DOE OSTI2018

Temporal Decompostion of a Distribution System Quasi-Static Time-Series Simulation

This paper documents the first phase of an investigation into reducing runtimes of complex OpenDSS models through parallelization. As the method seems promising, future work will quantify - and further mitigate - errors arising from this process. In this initial report, we demonstrate how, through the use of temporal decomposition, the run times of a complex distribution-system-level quasi-static time series simulation can be reduced roughly proportional to the level of parallelization. Using this method, the monolithic model runtime of 51 hours was reduced to a minimum of about 90 minutes. As expected, this comes at the expense of control- and voltage-errors at the time-slice boundaries. All evaluations were performed using a real distribution circuit model with the addition of 50 PV systems - representing a mock complex PV impact study. We are able to reduce induced transition errors through the addition of controls initialization, though small errors persist. The time savings with parallelization are so significant that we feel additional investigation to reduce control errors is warranted.

14 SOLAR ENERGY↗

NASA NTRS1992

SAPNEW: Parallel finite element code for thin shell structures on the Alliant FX-80

The finite element method has proven to be an invaluable tool for analysis and design of complex, high performance systems, such as bladed-disk assemblies in aircraft turbofan engines. However, as the problem size increase, the computation time required by conventional computers can be prohibitively high. Parallel processing computers provide the means to overcome these computation time limits. This report summarizes the results of a research activity aimed at providing a finite element capability for analyzing turbomachinery bladed-disk assemblies in a vector/parallel processing environment. A special purpose code, named with the acronym SAPNEW, has been developed to perform static and eigen analysis of multi-degree-of-freedom blade models built-up from flat thin shell elements. SAPNEW provides a stand alone capability for static and eigen analysis on the Alliant FX/80, a parallel processing computer. A preprocessor, named with the acronym NTOS, has been developed to accept NASTRAN input decks and convert them to the SAPNEW format to make SAPNEW more readily used by researchers at NASA Lewis Research Center.

Kamat, Manohar P.↗

DOE OSTI2019

Machine‐learning‐based predictive control of nonlinear processes. Part II: Computational implementation

Abstract Machine learning is receiving more attention in classical engineering fields, and in particular, recurrent neural networks (RNNs) coupled with ensemble regression tools have demonstrated the capability of modeling nonlinear dynamic processes. In Part I of this two‐article series, the Lyapunov‐based model predictive control (LMPC) method using a single RNN model and an ensemble of RNN models, respectively, was rigorously developed for a general class of nonlinear systems. In the present article, computational implementation issues of this new control method ranging from training of the RNN models, ensemble regression of the RNN models, and parallel computation for accelerating the real‐time model calculations are addressed. Furthermore, a chemical reactor example is used to demonstrate the implementation and effectiveness of these machine‐learning tools in LMPC as well as compare them with standard state‐space model identification tools.

Wu, Zhe↗

DOE OSTI2026

A worldwide climatology of extreme air masses

Extreme temperature events are among the most damaging weather phenomena. In a warming world, more heat extremes and fewer cold extremes are expected in most regions in the future, a trade-off that warrants further understanding of such events. Here, we track and analyze large, persistent areas of hot and cold extreme temperatures in parallel, relative to the location and time of year, to quantify overall regional exposure to extreme temperatures. To accomplish this, we compare the frequencies, movements, trends, and sources/sinks in each type of extreme air mass, calling them extreme cold or extreme hot air masses (ECAMs/EHAMs). For most land regions, ECAMs occur more often than EHAMs, and ECAMs are more common in each hemisphere’s winter, when cold-air advection is strongest and most widespread. Average movement of ECAMs has a stronger equatorward component in winter than in summer, while movement of EHAMs is eastward all year, with less meridional movement than ECAMs. EHAMs have become more common almost everywhere on land, and the reverse is true for ECAMs, with the strongest trends in the northern hemisphere occurring in autumn, especially in the Arctic. The number of EHAMs around the world is increasing at a higher rate (+ 2.32 events/year) than ECAM numbers are decreasing (-1.27 events/year), causing a net increase in extremes, especially in some midlatitude regions. These results help to document the different processes driving hot and cold extremes, and thus the asymmetric and regionally varying trends in frequency for extreme air masses.

Ryan, James M↗

DOE OSTI2018

High-order, linearly stable, partitioned solvers for general multiphysics problems based on implicit–explicit Runge–Kutta schemes

This work introduces a general framework for constructing high-order, linearly stable, partitioned solvers for multiphysics problems from a monolithic implicit–explicit Runge–Kutta (IMEX-RK) discretization of the semi-discrete equations. The generic multiphysics problem is modeled as a system of n systems of partial differential equations where the i th subsystem is coupled to the other subsystems through a coupling term that can depend on the state of all the other subsystems. This coupled system of partial differential equations reduces to a coupled system of ordinary differential equations via the method of lines where an appropriate spatial discretization is applied to each subsystem. The coupled system of ordinary differential equations is taken as a monolithic system and discretized using an IMEX-RK discretization with a specific implicit–explicit decomposition that introduces the concept of a predictor for the coupling term. We propose four coupling predictors that enable the monolithic system to be solved in a partitioned manner, i.e., subsystem-by-subsystem, and preserve the IMEX-RK structure and therefore the design order of accuracy of the monolithic scheme. The four partitioned solvers that result from these predictors are high-order accurate, allow for maximum re-use of existing single-physics software, and two of the four solvers allow the subsystems to be solved in parallel at a given stage and time step. We also analyze the stability of a coupled, linear model problem with a specific coupling structure and show that one of the partitioned solvers achieves unconditional linear stability for this problem, while the others are unconditionally stable only for certain values of the coupling strength. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems including a simple linear system of ODEs, advection–diffusion–reaction systems, fluid–structure interaction problems, and particle-laden flows, where we verify the design order of the IMEX schemes and study various stability properties.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Performance analysis and implementation details of the Energy Conserving Semi-Implicit Method code (ECsim)

We present in this work the implementation of the Energy Conserving Semi-Implicit Method in a parallel code called ECsim. This new code is a three-dimensional, fully electromagnetic particle in cell (PIC) code. It is written in C/C++ and uses MPI to allow massive parallelization. ECsim is unconditionally stable in time, eliminates the finite grid instability, and has the same cycle scheme as the explicit code with a computational cost comparable to other semi-implicit PIC codes. All these features make it a very valuable tool to address situations which have not been possible to analyze until now with other PIC codes. In this work, we show the details of the algorithm implementation and we study its performance in different systems. ECsim is compared with another semi-implicit PIC code with different time and spectral resolution, showing its ability to address situations where other codes fail.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

MFC 5.0: An exascale many-physics flow solver

Many problems of interest in engineering, medicine, and the fundamental sciences rely on high-fidelity flow simulation, making performant computational fluid dynamics solvers a mainstay of the open-source software community. Previous work MFC 3.0 was made a published, documented, and open-source solver via Bryngelson et al. Comp. Phys. Comm. (2021) with numerous physical features, numerical methods, and scalable infrastructure. MFC 5.0 is a significant update to MFC 3.0, featuring a broad set of well-established and novel physical models and numerical methods, as well as the introduction of GPU and APU (or superchip) acceleration. Here, we exhibit state-of-the-art performance and ideal scaling on the first two exascale supercomputers, OLCF Frontier and LLNL El Capitan. Combined with MFC’s single-accelerator performance, MFC achieves exascale computation in practice, and achieved the largest-to-date public CFD simulation at 200 trillion grid points as a 2025 ACM Gordon Bell Prize finalist. New physical features include the immersed boundary method, N-fluid phase change, Euler–Euler and Euler–Lagrange sub-grid bubble models, fluid-structure interaction, hypo- and hyper-elastic materials, chemically reacting flow, two-material surface tension, magnetohydrodynamics (MHD), and more. Numerical techniques now represent the current state-of-the-art, including general relaxation characteristic boundary conditions, WENO variants, Strang splitting for stiff sub-grid flow features, and low Mach number treatments. Weak scaling to tens of thousands of GPUs on OLCF Summit and Frontier and LLNL El Capitan achieves efficiencies within 5% of ideal to over 90% of their respective system sizes. Strong scaling results for a 16-times increase in device count show parallel efficiencies over 90% on OLCF Frontier. MFC’s software stack has undergone further improvements, including continuous integration, which ensures code resilience and correctness through over 300 regression tests; metaprogramming, which reduces code length while maintaining performance portability; and code generation for computing chemical reactions

Computational fluid dynamics↗

DOE OSTI2026

PyHydroGeophysX: An extensible open-source platform for integrating hydrological models with geophysical measurements

Hydrological models and geophysical measurements are widely used tools for understanding subsurface hydrological processes relevant to water resource management, yet they typically remain disconnected due to technical barriers. We present PyHydroGeophysX, an open-source Python platform bridging this gap by providing standardized interfaces between hydrological modeling software (MODFLOW, ParFlow) and geophysical simulation tools (PyGIMLi, SimPEG). The platform implements bidirectional workflows: translating hydrological outputs into simulated geophysical responses through petrophysical models, and extracting hydrological information from geophysical inversions. Key features include bidirectional workflow modules, configurable petrophysical models, time-lapse inversion with temporal regularization, parallel computing, and mesh utilities for property transfer between geophysical and hydrological grids. The modular architecture of PyHydroGeophysX enables researchers to incorporate additional models and methods, fostering broader adoption of integrated hydrogeophysical approaches. The software is freely available on GitHub and is intended for researchers and practitioners working at the intersection of hydrology and geophysics.

Hydrogeophysics↗