SEARCH · Search NASA

Results for “Parallel in time”

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 433 records · Page 24

All sources NASA NTRS DOE OSTI

NASA NTRS2017

Cyclotron Resonant Scattering Feature Simulations II. Description of the CRSF Simulation Process

Context. Cyclotron resonant scattering features (CRSFs) are formed by scattering of X-ray photons o_ quantized plasma electrons in the strong magnetic field (of the order 1012 G) close to the surface of an accreting X-ray pulsar. Due to the complex scattering cross-sections, the line profiles of CRSFs cannot be described by an analytic expression. Numerical methods, such as Monte Carlo (MC) simulations of the scattering processes, are required in order to predict precise line shapes for a given physical setup, which can be compared to observations to gain information about the underlying physics in these systems.Aims. A versatile simulation code is needed for the generation of synthetic cyclotron lines. Sophisticated geometries should be investigatable by making their simulation possible for the first time.Methods. The simulation utilizes the mean free path tables described in the first paper of this series for the fast interpolation of propagation lengths. The code is parallelized to make the very time-consuming simulations possible on convenient time scales. Furthermore, it can generate responses to monoenergetic photon injections, producing Green's functions, which can be used later to generate spectra for arbitrary continua.Results. We develop a new simulation code to generate synthetic cyclotron lines for complex scenarios, allowing for unprecedented physical interpretation of the observed data. An associated XSPEC model implementation is used to fit synthetic line profiles to NuSTAR data of Cep X-4. The code has been developed with the main goal of overcoming previous geometrical constraints in MC simulations of CRSFs. By applying this code also to more simple, classic geometries used in previous works, we furthermore address issues of code verification and cross-comparison of various models. The XSPEC model and the Green's function tables are available online (see link in footnote, page 1).

Schwarm, F.-W.↗

NASA NTRS1996

LTI Representations of Adaptive Systems with Tap Delay-Line Regressors under Sinusoidal Excitation

It is shown that and adaptive system whose regressor is formed by tap delay-line (TDL) filtering of a multitone sinusoidal signal is representable as a parallel connection of a linear time-invariant (LTI) block and a linear time-varying (LTV) block. Furthermore, a norm-bound (induced 2-norm) is computed explicity on the LTV block and is shown to decrease as N -1 where N is the number of taps.

adaptive↗

NASA NTRSDate not supplied

Ray Tracing Techniques for the Characterization of Lunar Communication Architectures

This paper provides an overview of the computational techniques used to characterize the viability of different lunar architectures and their ability to provide communication services to the lunar surface. This analysis was done with modern ray tracing techniques that allow for the computations to be done on Graphics Processing Unit (GPU) clusters for a high level of parallelism and severe reduction in computation time. The ray tracing computations were done with the GPU platform Compute Unified Device Architecture (CUDA) provided by NVIDIA which utilizes general-purpose computing on graphics processing units (GPGPU). This new method provides the advantage of being able to characterize a much larger portion of the lunar surface due to its computational efficiency as well as providing a more accurate representation of elevation angle limits instead of the typical and often inaccurate elevation angle mask. The Lunar surface can now be characterized with metrics such as contact time, outage time, and received data rate. With these metrics, different proposed Lunar architectures can be rapidly evaluated. This reduction in computation time not only leads to more accurate results but allows these results to be obtained in a time frame that allows for the complete characterization of the trade space. It is expected that these different architecture comparisons will lead to a conclusive determination of the optimal Lunar architecture and will allow for future Lunar missions to operate as close to real time as possible. In addition, this computation method can be used to recreate visibility figures generated by previous methods but with an increased level of accuracy.

Thomas Montano↗

NASA NTRS2022

Statistical Properties of the Population of the Galactic Center Filaments II: The Spacing between Filaments

We carry out a population study of magnetized radio filaments in the Galactic centre using MeerKAT data by focusing on the spacing between the filaments that are grouped. The morphology of a sample of 43 groupings containing 174 magnetized radio filaments are presented. Many grouped filaments show harp-like, fragmented cometary tail-like, or loop-like structures in contrast to many straight filaments running mainly perpendicular to the Galactic plane. There are many striking examples of a single filament splitting into two prongs at a junction, suggestive of a flow of plasma along the filaments. Spatial variations in spectral index, brightness, bending, and sharpening along the filaments indicate that they are evolving on a 105−6-yr time-scale. The mean spacings between parallel filaments in a given grouping peaks at ∼16 arcsec. We argue by modeling that the filaments in a grouping all lie on the same plane and that the groupings are isotropically oriented in 3D space. One candidate for the origin of filamentation is interaction with an obstacle, which could be a compact radio source, before a filament splits and bends into multiple filaments. In this picture, the obstacle or sets the length scale of the separation between the filaments. Another possibility is synchrotron cooling instability occurring in cometary tails formed as a result of the interaction of cosmic ray driven Galactic centre outflow with obstacles such as stellar winds. In this picture, the mean spacing and the mean width of the filaments are expected to be a fraction of a parsec, consistent with observed spacing.

plasmas↗

NASA NTRSDate not supplied

Gigatraj: An Atmospheric Trajectory Model

Atmospheric trajectory models have a long history of success in tracking air motions in the lower stratosphere and upper troposphere over periods of up to a few days. Parcels have been traced backwards from observations to identify whatever phenomena (strong convection, volcanic eruptions, rocket launches, etc.) put their signature on them. Parcels have also been initialized at a known event and traced forward to examine their subsequent physical and chemical evolution. We describe a new trajectory model, "gigatraj," that aims to increase exibility by (a) making it straightforward to use new meteorological data sources, including those not based on regular latitude-longitude grids; (b) enabling a run-time choice of vertical coordinate system for kinematic and/or quasi-isentropic calculations; (c) allowing for the output of arbitrary meteorological products, selectable by the user and interpolated to the parcels' locations and times. The model can be run in a serial or parallel processing environment, so that large numbers of parcels can be traced in a reasonable time. Information is presented on model accuracy and performance. The former is demonstrated by runs using both test-pattern winds (comparing expected paths with actual output) and real-world winds (comparing forward and backward runs to characterize how well parcels retrace their paths). Sample cases are also shown, including a reverse domain lling (RDF) calculation illustrating a tropopause fold event. Model output can be displayed using the new Visualization And Lagrangian dynamics Immersive eXtended Reality (VALIXR) system, and an example will be shown. In addition, we describe work to incorporate a version of gigatraj into the Goddard Earth Observing System (GEOS) of NASA's Global Modeling and Assimilation O ce (GMAO) at Goddard Space Flight Center. This enables trajectory calculations to be performed within the running GEOS model at the latter's native time resolution, instead of using the winds from every few hours. It also provides access to all of GEOS's internal variables as they are calculated. This module may be useful, for example, for tracking rapid chemical changes in a Lagrangian framework.

dynamics↗

NASA NTRS1991

Parallel processing and expert systems

Whether it be monitoring the thermal subsystem of Space Station Freedom, or controlling the navigation of the autonomous rover on Mars, NASA missions in the 1990s cannot enjoy an increased level of autonomy without the efficient implementation of expert systems. Merely increasing the computational speed of uniprocessors may not be able to guarantee that real-time demands are met for larger systems. Speedup via parallel processing must be pursued alongside the optimization of sequential implementations. Prototypes of parallel expert systems have been built at universities and industrial laboratories in the U.S. and Japan. The state-of-the-art research in progress related to parallel execution of expert systems is surveyed. The survey discusses multiprocessors for expert systems, parallel languages for symbolic computations, and mapping expert systems to multiprocessors. Results to date indicate that the parallelism achieved for these systems is small. The main reasons are (1) the body of knowledge applicable in any given situation and the amount of computation executed by each rule firing are small, (2) dividing the problem solving process into relatively independent partitions is difficult, and (3) implementation decisions that enable expert systems to be incrementally refined hamper compile-time optimization. In order to obtain greater speedups, data parallelism and application parallelism must be exploited.

Lau, Sonie↗

NASA NTRS1972

Lunar electromagnetic scattering. 1: Propagation parallel to the diamagnetic cavity axis

An analytic theory is developed for the time dependent magnetic fields inside the Moon and the diamagnetic cavity when the interplanetary electromagnetic field fluctuation propagates parallel to the cavity axis. The Moon model has an electrical conductivity which is an arbitrary function of radius. The lunar cavity is modelled by a nonconducting cylinder extending infinitely far downstream. For frequencies less than about 50 Hz, the cavity is a cylindrical waveguide below cutoff. Thus, cavity field perturbations due to the Moon do not propagate down the cavity, but are instead attenuated with distance downstream from the Moon.

Schwartz, K.↗

NASA NTRS2004

Reducing Design Cycle Time and Cost Through Process Resequencing

In today's competitive environment, companies are under enormous pressure to reduce the time and cost of their design cycle. One method for reducing both time and cost is to develop an understanding of the flow of the design processes and the effects of the iterative subcycles that are found in complex design projects. Once these aspects are understood, the design manager can make decisions that take advantage of decomposition, concurrent engineering, and parallel processing techniques to reduce the total time and the total cost of the design cycle. One software tool that can aid in this decision-making process is the Design Manager's Aid for Intelligent Decomposition (DeMAID). The DeMAID software minimizes the feedback couplings that create iterative subcycles, groups processes into iterative subcycles, and decomposes the subcycles into a hierarchical structure. The real benefits of producing the best design in the least time and at a minimum cost are obtained from sequencing the processes in the subcycles.

Rogers, James L.↗

NASA NTRS2003

TOMS and SBUV Data: Comparison to 3D Chemical-Transport Model Results

We have updated our merged ozone data (MOD) set using the TOMS data from the new version 8 algorithm. We then analyzed these data for contributions from solar cycle, volcanoes, QBO, and halogens using a standard statistical time series model. We have recently completed a hindcast run of our 3D chemical-transport model for the same years. This model uses off-line winds from the finite-volume GCM, a full stratospheric photochemistry package, and time-varying forcing due to halogens, solar uv, and volcanic aerosols. We will report on a parallel analysis of these model results using the same statistical time series technique as used for the MOD data.

Stolarski, Richard S.↗

NASA NTRS2016

Utilizing GPUs to Accelerate Turbomachinery CFD Codes

GPU computing has established itself as a way to accelerate parallel codes in the high performance computing world. This work focuses on speeding up APNASA, a legacy CFD code used at NASA Glenn Research Center, while also drawing conclusions about the nature of GPU computing and the requirements to make GPGPU worthwhile on legacy codes. Rewriting and restructuring of the source code was avoided to limit the introduction of new bugs. The code was profiled and investigated for parallelization potential, then OpenACC directives were used to indicate parallel parts of the code. The use of OpenACC directives was not able to reduce the runtime of APNASA on either the NVIDIA Tesla discrete graphics card, or the AMD accelerated processing unit. Additionally, it was found that in order to justify the use of GPGPU, the amount of parallel work being done within a kernel would have to greatly exceed the work being done by any one portion of the APNASA code. It was determined that in order for an application like APNASA to be accelerated on the GPU, it should not be modular in nature, and the parallel portions of the code must contain a large portion of the code's computation time.

computer programming↗

NASA NTRS1976

Solid-propellant rocket motor internal ballistic performance variation analysis, phase 2

The Monte Carlo method was used to investigate thrust imbalance and its first time derivative throughtout the burning time of pairs of solid rocket motors firing in parallel. Results obtained compare favorably with Titan 3 C flight performance data. Statistical correlations of the thrust imbalance at various times with corresponding nominal trace slopes suggest several alternative methods of predicting thrust imbalance. The effect of circular-perforated grain deformation on internal ballistics is discussed, and a modified design analysis computer program which permits such an evaluation is presented. Comparisons with SRM firings indicate that grain deformation may account for a portion of the so-called scale factor on burning rate between large motors and strand burners or small ballistic test motors. Thermoelastic effects on burning rate are also investigated. Burning surface temperature is calculated by coupling the solid phase energy equation containing a strain rate term with a model of gas phase combustion zone using the Zeldovich-Novozhilov technique. Comparisons of solutions with and without the strain rate term indicate a small but possibly significant effect of the thermoelastic coupling.

Sforzini, R. H.↗

NASA NTRS1973

A reliability and comparative analysis of two standby system configurations.

Equations are derived which enable one to calculate the system reliability for parallel or triple modular redundant systems with standby spares. Software error detection is introduced into the TMR/Spares system configuration in order to utilize fully all of the units. An indication of the sensitivity of the system reliability to an increase in the number of spares, partitioning, switching, variations in the powered and unpowered failures rates, and time is presented. A comparison of the parallel and the TMR/Spares system configurations, under similar conditions, is given.

Taylor, D. S.↗

NASA NTRS2004

Scalable High Performance Computing: Direct and Large-Eddy Turbulent Flow Simulations Using Massively Parallel Computers

This final report contains reports of research related to the tasks "Scalable High Performance Computing: Direct and Lark-Eddy Turbulent FLow Simulations Using Massively Parallel Computers" and "Devleop High-Performance Time-Domain Computational Electromagnetics Capability for RCS Prediction, Wave Propagation in Dispersive Media, and Dual-Use Applications. The discussion of Scalable High Performance Computing reports on three objectives: validate, access scalability, and apply two parallel flow solvers for three-dimensional Navier-Stokes flows; develop and validate a high-order parallel solver for Direct Numerical Simulations (DNS) and Large Eddy Simulation (LES) problems; and Investigate and develop a high-order Reynolds averaged Navier-Stokes turbulence model. The discussion of High-Performance Time-Domain Computational Electromagnetics reports on five objectives: enhancement of an electromagnetics code (CHARGE) to be able to effectively model antenna problems; utilize lessons learned in high-order/spectral solution of swirling 3D jets to apply to solving electromagnetics project; transition a high-order fluids code, FDL3DI, to be able to solve Maxwell's Equations using compact-differencing; develop and demonstrate improved radiation absorbing boundary conditions for high-order CEM; and extend high-order CEM solver to address variable material properties. The report also contains a review of work done by the systems engineer.

Morgan, Philip E.↗

NASA NTRS1994

Portable parallel stochastic optimization for the design of aeropropulsion components

This report presents the results of Phase 1 research to develop a methodology for performing large-scale Multi-disciplinary Stochastic Optimization (MSO) for the design of aerospace systems ranging from aeropropulsion components to complete aircraft configurations. The current research recognizes that such design optimization problems are computationally expensive, and require the use of either massively parallel or multiple-processor computers. The methodology also recognizes that many operational and performance parameters are uncertain, and that uncertainty must be considered explicitly to achieve optimum performance and cost. The objective of this Phase 1 research was to initialize the development of an MSO methodology that is portable to a wide variety of hardware platforms, while achieving efficient, large-scale parallelism when multiple processors are available. The first effort in the project was a literature review of available computer hardware, as well as review of portable, parallel programming environments. The first effort was to implement the MSO methodology for a problem using the portable parallel programming language, Parallel Virtual Machine (PVM). The third and final effort was to demonstrate the example on a variety of computers, including a distributed-memory multiprocessor, a distributed-memory network of workstations, and a single-processor workstation. Results indicate the MSO methodology can be well-applied towards large-scale aerospace design problems. Nearly perfect linear speedup was demonstrated for computation of optimization sensitivity coefficients on both a 128-node distributed-memory multiprocessor (the Intel iPSC/860) and a network of workstations (speedups of almost 19 times achieved for 20 workstations). Very high parallel efficiencies (75 percent for 31 processors and 60 percent for 50 processors) were also achieved for computation of aerodynamic influence coefficients on the Intel. Finally, the multi-level parallelization strategy that will be needed for large-scale MSO problems was demonstrated to be highly efficient. The same parallel code instructions were used on both platforms, demonstrating portability. There are many applications for which MSO can be applied, including NASA's High-Speed-Civil Transport, and advanced propulsion systems. The use of MSO will reduce design and development time and testing costs dramatically.

Sues, Robert H.↗

NASA NTRS1990

Efficient parametric analysis of performance measures for communication networks

Efficient techniques for estimating performance measures in communication networks in a steady-state or transient setting are developed. These techniques may be used in a simulation environment or in connection with real-time observations. For Markov chain models, the recently proposed standard clock approach is extended, and a class of real-time algorithms for simultaneously generating multiple sample paths under different parameter sets is presented. Attention is focused on the link crash time estimation problem, where a 'crash' is defined as the first time a buffer overflows, given some initial conditions. An algorithm for estimating crash times under various traffic shocks is derived, where all estimates are obtained in parallel to an actual network's normal operation. An algorithm for crash time estimation of a G/D/1 link model is also derived using a different (perturbation-analysis-based) approach. Finally, extensive simulation results are provided to validate the proposed algorithms and compare them to brute-force simulation.

Cassandras, Christos G.↗

NASA NTRS1994

An architecture for real-time vision processing

To study the feasibility of developing an architecture for real time vision processing, a task queue server and parallel algorithms for two vision operations were designed and implemented on an i860-based Mercury Computing System 860VS array processor. The proposed architecture treats each vision function as a task or set of tasks which may be recursively divided into subtasks and processed by multiple processors coordinated by a task queue server accessible by all processors. Each idle processor subsequently fetches a task and associated data from the task queue server for processing and posts the result to shared memory for later use. Load balancing can be carried out within the processing system without the requirement for a centralized controller. The author concludes that real time vision processing cannot be achieved without both sequential and parallel vision algorithms and a good parallel vision architecture.

Chien, Chiun-Hong↗

DOE OSTI2024

On a Simplified Approach to Achieve Parallel Performance and Portability Across CPU and GPU Architectures

This paper presents software advances to easily exploit computer architectures consisting of a multi-core CPU and CPU+GPU to accelerate diverse types of high-performance computing (HPC) applications using a single code implementation. The paper describes and demonstrates the performance of the open-source C++ matrix and array (MATAR) library that uniquely offers: (1) a straightforward syntax for programming productivity, (2) usable data structures for data-oriented programming (DOP) for performance, and (3) a simple interface to the open-source C++ Kokkos library for portability and memory management across CPUs and GPUs. The portability across architectures with a single code implementation is achieved by automatically switching between diverse fine-grained parallelism backends (e.g., CUDA, HIP, OpenMP, pthreads, etc.) at compile time. The MATAR library solves many longstanding challenges associated with easily writing software that can run in parallel on any computer architecture. This work benefits projects seeking to write new C++ codes while also addressing the challenges of quickly making existing Fortran codes performant and portable over modern computer architectures with minimal syntactical changes from Fortran to C++. We demonstrate the feasibility of readily writing new C++ codes and modernizing existing codes with MATAR to be performant, parallel, and portable across diverse computer architectures.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1988

Computational requirements for on-orbit identification of space systems

For the future space systems, on-orbit identification (ID) capability will be required to complement on-orbit control, due to the fact that the dynamics of large space structures, spacecrafts, and antennas will not be known sufficiently from ground modeling and testing. The computational requirements for ID of flexible structures such as the space station (SS) or the large deployable reflectors (LDR) are however, extensive due to the large number of modes, sensors, and actuators. For these systems the ID algorithm operations need not be computed in real-time, only in near real-time, or an appropriate mission time. Consequently the space systems will need advanced processors and efficient parallel processing algorithm design and architectures to implement the identification algorithms in near real-time. The MAX computer currently being developed may handle such computational requirements. The purpose is to specify the on-board computational requirements for dynamic and static identification for large space structures. The computational requirements for six ID algorithms are presented in the context of three examples: the JPL/AFAL ground antenna facility, the space station (SS), and the large deployable reflector (LDR).

Hadaegh, Fred Y.↗