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 631 records · Page 35

All sources NASA NTRS DOE OSTI

NASA NTRS2021

The role of analysis error in the convergence of reanalysis production streams in MERRA-2

Due to production time constraints, most reanalyses are produced in multiple parallel streams instead of a single continuous one. These streams cover separate segments of the reanalysis time period with short overlaps to allow reconstruction of the official record. A fundamental assumption justifying this approach is that the streams will be assimilating the same observations during the periods where they overlap, and so will eventually converge to a similar atmospheric state, making discontinuities at stream junctions negligible. This assumption is revisited in this work by examining the impact of analysis error on the differences between MERRA-2 overlapping streams in three historical periods. Comparison results are shown in terms of standard deviations of stream differences as well as the spectral decomposition of the variance of their differences. Residual differences were found at the end of each year of overlap, with larger values observed in the earlier segments of the presatellite era. By drawing parallels with analysis error statistics estimated from the GMAO OSSE system, these differences are shown to reflect the varying constraint of data with the varying observing network, and to further carry the imprint of errors that the data assimilation process is not able to mitigate. As such, they are unlikely to be reduced by longer spinup periods. The ability of data assimilation to ensure continuity in the parallel streams is put into question when the observing system coverage is inadequate or simply when the data assimilation system as a whole is suboptimal.

Amal El Akkraoui↗

NASA NTRS1986

Compositional changes, time and density variations in the magnetosphere associated with Birkeland currents and particle acceleration

Birkeland currents, parallel electric fields and plasma instabilities often occur together in time and space and play an important role in large scale plasma motions between the ionosphere and magnetosphere and along the magnetic field in the magnetosphere. The results of the plasma movements are large density and composition variations in the ionosphere and magnetosphere. Observations from ISIS-2 at 1400 km altitude show large densities with heavy ions dominating in regions with upward Birkeland currents, and low densities and light ions in regions with downward currents. Observations from ISEE-1 in field aligned current regions at 10,000 to 15,000 km altitude show transverse heating of protons and oxygen ions to 250 eV. Because of the different mobility of the protons and oxygen ions the proton flow is important in the beginning of the events but later the outflow becomes almost pure oxygen. Similarly ISEE-1 observations of outgoing field ion beams at 10,000 to 15,000 km altitude show time variations in the H+/O+ ratios and a dominance of O+ later in the events.

Ungstrup, E.↗

NASA NTRS1990

Execution time support for scientific programs on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

NASA NTRS1992

Optimal mapping of neural-network learning on message-passing multicomputers

A minimization of learning-algorithm completion time is sought in the present optimal-mapping study of the learning process in multilayer feed-forward artificial neural networks (ANNs) for message-passing multicomputers. A novel approximation algorithm for mappings of this kind is derived from observations of the dominance of a parallel ANN algorithm over its communication time. Attention is given to both static and dynamic mapping schemes for systems with static and dynamic background workloads, as well as to experimental results obtained for simulated mappings on multicomputers with dynamic background workloads.

Chu, Lon-Chan↗

NASA NTRS1988

Application of the hypercube parallel processor to a large-scale moment method code

The applicability of a parallel computing architecture to the solution of a large-scale moment-method code is investigated. Specifically, the NEC (Numerical Electromagnetics Code) method-of-moments scattering program is implemented on a hypercube parallel processor. The accuracy and the increase in the speed of execution on this parallel architecture are demonstrated. The results show a very large reduction in execution time for large problems. The great potential of this parallel processor is shown for interactive solution of large NEC problems as well as other moment-method techniques such as the finite-element method.

Manshadi, Farzin↗

DOE OSTI2018

Observations of a field-aligned ion/ion-beam instability in a magnetized laboratory plasma

Collisionless coupling between super Alfvénic ions and an ambient plasma parallel to a background magnetic field is mediated by a set of electromagnetic ion/ion-beam instabilities including the resonant right hand instability (RHI). To study this coupling and its role in parallel shock formation, a new experimental configuration at the University of California, Los Angeles utilizes high-energy and high-repetition-rate lasers to create a super-Alfvénic field-aligned debris plasma within an ambient plasma in the Large Plasma Device. We used a time-resolved fluorescence monochromator and an array of Langmuir probes to characterize the laser plasma velocity distribution and density. The debris ions were observed to be sufficiently super-Alfvénic and dense to excite the RHI. Measurements with magnetic flux probes exhibited a right-hand circularly polarized frequency chirp consistent with the excitation of the RHI near the laser target. To conclude, we compared measurements to 2D hybrid simulations of the experiment.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2017

An Integrated Approach to Parameter Learning in Infinite-Dimensional Space

The availability of sophisticated modern physics codes has greatly extended the ability of domain scientists to understand the processes underlying their observations of complicated processes, but it has also introduced the curse of dimensionality via the many user-set parameters available to tune. Many of these parameters are naturally expressed as functional data, such as initial temperature distributions, equations of state, and controls. Thus, when attempting to find parameters that match observed data, being able to navigate parameter-space becomes highly non-trivial, especially considering that accurate simulations can be expensive both in terms of time and money. Existing solutions include batch-parallel simulations, high-dimensional, derivative-free optimization, and expert guessing, all of which make some contribution to solving the problem but do not completely resolve the issue. In this work, we explore the possibility of coupling together all three of the techniques just described by designing user-guided, batch-parallel optimization schemes. Our motivating example is a neutron diffusion partial differential equation where the time-varying multiplication factor serves as the unknown control parameter to be learned. We find that a simple, batch-parallelizable, random-walk scheme is able to make some progress on the problem but does not by itself produce satisfactory results. After reducing the dimensionality of the problem using functional principal component analysis (fPCA), we are able to track the progress of the solver in a visually simple way as well as viewing the associated principle components. This allows a human to make reasonable guesses about which points in the state space the random walker should try next. Thus, by combining the random walker's ability to find descent directions with the human's understanding of the underlying physics, it is possible to use expensive simulations more efficiently and more quickly arrive at the desired parameter set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1982

Power-MOSFET Voltage Regulator

Ninety-six parallel MOSFET devices with two-stage feedback circuit form a high-current dc voltage regulator that also acts as fully-on solid-state switch when fuel-cell out-put falls below regulated voltage. Ripple voltage is less than 20 mV, transient recovery time is less than 50 ms. Parallel MOSFET's act as high-current dc regulator and switch. Regulator can be used wherever large direct currents must be controlled. Can be applied to inverters, industrial furnaces photovoltaic solar generators, dc motors, and electric autos.

Miller, W. N.↗

NASA NTRS1990

Execution time supports for adaptive scientific algorithms on distributed memory machines

Berryman, Harry↗

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 OSTI2017

Gyrokinetic magnetohydrodynamics and the associated equilibria

The gyrokinetic magnetohydrodynamic (MHD) equations, related to the recent paper by W. W. Lee, and their associated equilibria properties are discussed. This set of equations consists of the time-dependent gyrokinetic vorticity equation, the gyrokinetic parallel Ohm's law, and the gyrokinetic Ampere's law as well as the equations of state, which are expressed in terms of the electrostatic potential, Φ, and the vector potential, A, and support both spatially varying perpendicular and parallel pressure gradients and the associated currents. The corresponding gyrokinetic MHD equilibria can be reached when Φ → 0 and A becomes constant in time, which, in turn, gives ∇· (J ∥ +J ⊥ ) = 0 and the associated magnetic islands, if they exist. Examples of simple cylindrical geometry are given. In conclusion, these gyrokinetic MHD equations look quite different from the conventional MHD equations, and their comparisons will be an interesting topic in the future.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1988

Geoid and topography for infinite Prandtl number convection in a spherical shell

Geoid anomalies and surface and lower-boundary topographies are calculated for numerically generated thermal convection for an infinite Prandtl number, Boussinesq, axisymmetric spherical fluid shell with constant gravity and viscosity, for heating both entirely from below and entirely from within. Convection solutions are obtained for Rayleigh numbers Ra up to 20 times the critical Ra in heating from below and 27 times critical for heating from within. Geoid parallels surface undulations, and boundary deformation generally increases with increasing cell wavelength. Dimensionless geoid and topography in heating from below are about 5 times greater than in heating from within. Values for heating from within correlate more closely with geophysical data than values from heating from below, suggesting a predominance of internal heating in the mantle. The study emphasizes that dynamically induced topography and geoid are sensitive to the mode of heating in the earth's mantle.

Bercovici, D.↗

DOE OSTI2025

Real-Time Bayesian Inference at Extreme Scale: A Digital Twin for Tsunami Early Warning Applied to the Cascadia Subduction Zone

We present a Bayesian inversion-based digital twin that employs acoustic pressure data from seafloor sensors, along with 3D coupled acoustic–gravity wave equations, to infer earthquake-induced spatiotemporal seafloor motion in real time and forecast tsunami propagation toward coastlines for early warning with quantified uncertainties. Our target is the Cascadia subduction zone, with one billion parameters. Computing the posterior mean alone would require 50 years on a 512 GPU machine. Instead, exploiting the shift invariance of the parameter-to-observable map and devising novel parallel algorithms, we induce a fast offline–online decomposition. The offline component requires just one adjoint wave propagation per sensor; using MFEM, we scale this part of the computation to the full El Capitan system (43,520 GPUs) with 92% weak parallel efficiency. Moreover, given real-time data, the online component exactly solves the Bayesian inverse and forecasting problems in 0.2 seconds on a modest GPU system, a ten-billion-fold speedup.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2008

Parallel-Processing Software for Creating Mosaic Images

A computer program implements parallel processing for nearly real-time creation of panoramic mosaics of images of terrain acquired by video cameras on an exploratory robotic vehicle (e.g., a Mars rover). Because the original images are typically acquired at various camera positions and orientations, it is necessary to warp the images into the reference frame of the mosaic before stitching them together to create the mosaic. [Also see "Parallel-Processing Software for Correlating Stereo Images," Software Supplement to NASA Tech Briefs, Vol. 31, No. 9 (September 2007) page 26.] The warping algorithm in this computer program reflects the considerations that (1) for every pixel in the desired final mosaic, a good corresponding point must be found in one or more of the original images and (2) for this purpose, one needs a good mathematical model of the cameras and a good correlation of individual pixels with respect to their positions in three dimensions. The desired mosaic is divided into slices, each of which is assigned to one of a number of central processing units (CPUs) operating simultaneously. The results from the CPUs are gathered and placed into the final mosaic. The time taken to create the mosaic depends upon the number of CPUs, the speed of each CPU, and whether a local or a remote data-staging mechanism is used.

Klimeck, Gerhard↗

NASA NTRS1995

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

Chew, W. C.↗

DOE OSTI2020

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

In this paper, we propose a framework called FPDeep, which uses a hybrid of model and layer paral- lelism to configure distributed reconfigurable clusters to train DNNs. This approach has numerous benefits. First, the design does not suffer from batch size growth. Second, novel workload and weight partitioning leads to balanced loads of both among nodes. And third, the entire system is fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time features need to be cached while waiting for back-propagation.

Wang, Tianqi↗

NASA NTRS1987

The PISCES 2 parallel programming environment

PISCES 2 is a programming environment for scientific and engineering computations on MIMD parallel computers. It is currently implemented on a flexible FLEX/32 at NASA Langley, a 20 processor machine with both shared and local memories. The environment provides an extended Fortran for applications programming, a configuration environment for setting up a run on the parallel machine, and a run-time environment for monitoring and controlling program execution. This paper describes the overall design of the system and its implementation on the FLEX/32. Emphasis is placed on several novel aspects of the design: the use of a carefully defined virtual machine, programmer control of the mapping of virtual machine to actual hardware, forces for medium-granularity parallelism, and windows for parallel distribution of data. Some preliminary measurements of storage use are included.

Pratt, Terrence W.↗

NASA NTRS2011

Parallel Wavefront Analysis for a 4D Interferometer

This software provides a programming interface for automating data collection with a PhaseCam interferometer from 4D Technology, and distributing the image-processing algorithm across a cluster of general-purpose computers. Multiple instances of 4Sight (4D Technology s proprietary software) run on a networked cluster of computers. Each connects to a single server (the controller) and waits for instructions. The controller directs the interferometer to several images, then assigns each image to a different computer for processing. When the image processing is finished, the server directs one of the computers to collate and combine the processed images, saving the resulting measurement in a file on a disk. The available software captures approximately 100 images and analyzes them immediately. This software separates the capture and analysis processes, so that analysis can be done at a different time and faster by running the algorithm in parallel across several processors. The PhaseCam family of interferometers can measure an optical system in milliseconds, but it takes many seconds to process the data so that it is usable. In characterizing an adaptive optics system, like the next generation of astronomical observatories, thousands of measurements are required, and the processing time quickly becomes excessive. A programming interface distributes data processing for a PhaseCam interferometer across a Windows computing cluster. A scriptable controller program coordinates data acquisition from the interferometer, storage on networked hard disks, and parallel processing. Idle time of the interferometer is minimized. This architecture is implemented in Python and JavaScript, and may be altered to fit a customer s needs.

Rao, Shanti R.↗