Search NASA⌕ Search

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.

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

At least 1,639 records · Page 91

Intelligent Partitioning based Fully Parallel AC Security-Constrained Optimal Power Flow

Today’s power grid is becoming more diverse and integrated with high-level distributed energy resources and smart control technologies that is creating a new set of grid management challenges in terms of large-scale, nonlinear, and non-convex problem modeling, complex and time-consuming computation, as well as difficult uncertainty handling. This project focused on solving a challenging multi-period security-constrained generation scheduling problem, which is of great importance for maximizing the social welfare of real-time dispatch, day-ahead market, as well as weekly planning of power systems. Our developed software explored parallel optimization algorithms for complex and realistic power system models, and develop fast, efficient, and robust grid optimization solutions on the high-performance computing platform that will enable increased grid economics, flexibility, resilience, as well as energy security in the United States.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Managing genomic variant calling workflows with Swift/T

Bioinformatics research is frequently performed using complex workflows with multiple steps, fans, merges, and conditionals. This complexity makes management of the workflow difficult on a computer cluster, especially when running in parallel on large batches of data: hundreds or thousands of samples at a time. Scientific workflow management systems could help with that. Many are now being proposed, but is there yet the “best” workflow management system for bioinformatics? Such a system would need to satisfy numerous, sometimes conflicting requirements: from ease of use, to seamless deployment at peta- and exa-scale, and portability to the cloud. We evaluated Swift/T as a candidate for such role by implementing a primary genomic variant calling workflow in the Swift/T language, focusing on workflow management, performance and scalability issues that arise from production-grade big data genomic analyses. In the process we introduced novel features into the language, which are now part of its open repository. Additionally, we formalized a set of design criteria for quality, robust, maintainable workflows that must function at-scale in a production setting, such as a large genomic sequencing facility or a major hospital system. The use of Swift/T conveys two key advantages. (1) It operates transparently in multiple cluster scheduling environments (PBS Torque, SLURM, Cray aprun environment, etc.), thus a single workflow is trivially portable across numerous clusters. (2) The leaf functions of Swift/T permit developers to easily swap executables in and out of the workflow, which makes it easy to maintain and to request resources optimal for each stage of the pipeline. While Swift/T’s data-level parallelism eliminates the need to code parallel analysis of multiple samples, it does make debugging more difficult, as is common for implicitly parallel code. Nonetheless, the language gives users a powerful and portable way to scale up analyses in many computing architectures.

Science & Technology - Other Topics↗

Assessment of plasma impedance probe for measuring electron density and collision frequency in a plasma with spatial and temporal gradients

Numerical simulations and experimental measurements were combined to determine the ability of a plasma impedance probe (PIP) to measure plasma density and electron collision frequency in a plasma containing spatial gradients as well as time-varying oscillations in the plasma density. A PIP is sensitive to collision frequency through the width of the parallel resonance in the Re[Z]-vs.-frequency characteristic, while also being sensitive to electron density through the zero-crossing of the Im[Z]-vs.-frequency characteristic at parallel resonance. Simulations of the probe characteristic in a linear plasma gradient indicated that the broadening of Re[Z] due to the spatial gradient obscured the broadening due to electron collision frequency, preventing a quantitative measurement of the absolute collision frequency for gradients considered in this study. Simulation results also showed that the PIP is sensitive to relative changes in electron collision frequency in a spatial density gradient, but a second broadening effect due to time-varying oscillations made collision frequency measurements impossible. The time-varying oscillations had the effect of causing multiple zero-crossings in Im[Z] at parallel resonance. Results of experiments and simulations indicated that the lowest-frequency zero-crossing represented the lowest plasma density in the oscillations and the highest-frequency zero-crossing represented the highest plasma density in the oscillations, thus the PIP probe was found to be an effective tool to measure both the average plasma density as well as the maximum and minimum densities due to temporal oscillations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hidden-line removal at 20 pictures/second through hybrid techniques.

A real-time computer image generation method is presented that is designed to operate in a parallel-computing environment. It can provide good quality pictures of limited complexity if implemented on a general purpose hybrid computing system. Such a hybrid approach can generate a new image every 50 milliseconds. These results have been demonstrated by a feasibility test program which impelements the hybrid concepts described. This hybrid-picture generation capability is shown to represent a significant contribution to the area of real-time hidden-line removal.

Brown, R. M.↗

Parallel-vector computation for linear structural analysis and non-linear unconstrained optimization problems

Several parallel-vector computational improvements to the unconstrained optimization procedure are described which speed up the structural analysis-synthesis process. A fast parallel-vector Choleski-based equation solver, pvsolve, is incorporated into the well-known SAP-4 general-purpose finite-element code. The new code, denoted PV-SAP, is tested for static structural analysis. Initial results on a four processor CRAY 2 show that using pvsolve reduces the equation solution time by a factor of 14-16 over the original SAP-4 code. In addition, parallel-vector procedures for the Golden Block Search technique and the BFGS method are developed and tested for nonlinear unconstrained optimization. A parallel version of an iterative solver and the pvsolve direct solver are incorporated into the BFGS method. Preliminary results on nonlinear unconstrained optimization test problems, using pvsolve in the analysis, show excellent parallel-vector performance indicating that these parallel-vector algorithms can be used in a new generation of finite-element based structural design/analysis-synthesis codes.

Nguyen, D. T.↗

Model-based Dynamic Control of Speculative Forays in Parallel Computation

In simulations running in parallel, the processors would have to synchronize with other processors to maintain correct global order of computations. This can be done either by blocking computation until correct order is guaranteed, or by \textit{speculatively} proceeding with the best guess (based on local information) and later correcting errors if/as necessary. Since the gainful lengths of speculative forays depend on the dynamics of the application software and hardware at runtime, an online control system is necessary to dynamically choose and/or switch between the blocking and speculative strategies. In this paper, we formulate the reversible speculative computing in large-scale parallel computing as a dynamic linear feedback control (optimization) system model and evaluate its performance in terms of time and cost savings as compared to the traditional (forward) computing. We illustrate with an exact analogy in the form of vehicular travel under dynamic, delayed route information. The objective is to assist in making the optimal decision on what computational approach is to be chosen, by predicting the amount of time and cost savings (or losing) under different environments represented by different parameters and probability distribution functions. We consider the cases of Gaussian, exponential and log-normal distribution functions. The control system is intended for incorporating into speculative parallel applications such as optimistic parallel discrete event simulations to decide at runtime when and to what extent speculative execution can be performed gainfully.

Perumalla, Kalyan↗

Scale-dependent normalized amplitude and weak spectral anisotropy of magnetic field fluctuations in the solar wind turbulence

Turbulence in the solar wind was recently reported to be anisotropic, with the average power spectral index close to −2 when sampling parallel to the local mean magnetic field B{sub 0} and close to −5/3 when sampling perpendicular to the local B{sub 0}. This result was widely considered to be observational evidence for the critical balance theory (CBT), which is derived by making the assumption that the turbulence strength is close to one. However, this basic assumption has not yet been checked carefully with observational data. Here we present for the first time the scale-dependent magnetic-field fluctuation amplitude, which is normalized by the local B{sub 0} and evaluated for both parallel and perpendicular sampling directions, using two 30-day intervals of Ulysses data. From our results, the turbulence strength is evaluated as much less than one at small scales in the parallel direction. An even stricter criterion is imposed when selecting the wavelet coefficients for a given sampling direction, so that the time stationarity of the local B{sub 0} is better ensured during the local sampling interval. The spectral index for the parallel direction is then found to be −1.75, whereas the spectral index in the perpendicular direction remains close to −1.65. These two new results, namely that the value of the turbulence strength is much less than one in the parallel direction and that the angle dependence of the spectral index is weak, cannot be explained by existing turbulence theories, like CBT, and thus will require new theoretical considerations and promote further observations of solar-wind turbulence.

79 ASTRONOMY AND ASTROPHYSICS↗

Severe storm initiation and development from satellite infrared imagery and Rawinsonde data

The geographical distribution of potential temperatures, mixing ratio, and streamlines of flow patterns at 850, 700, and 500 mb heights are used to understand the prestorm convection and the horizontal convergence of moisture. From the analysis of 21 tornadoes the following conclusions are reached: (1) Strong horizontal convergence of moisture appeared at the 850, 700, and 500 mb levels in the area 12 hours before the storm formation; (2) An abundantly moist atmosphere below 3 km (700 mb) becomes convectively unstable during the time period between 12 and 24 hours before the initiation of the severe storms; (3) Strong winds veering with height with direction parallel to the movement of a dryline, surface fronts, etc; (4) During a 36-hour period, a tropopause height in the areas of interest is lowest at the time of tornadic cloud formation; (5) A train of gravity waves is detected before and during the cloud formation period. Rapid-scan infrared imagery provides near real-time information on the life cycle of the storm which can be summarized as follows: (1) Enhanced convection produced an overshooting cloud top penetrating above the tropopause, making the mass density of the overshooting cloud much greater than the mass density of the surrounding air; (2) The overshooting cloud top collapsed at the end of the mature stage of the cloud development; (3) The tornado touchdown followed the collapse of the overshooting cloud top.

Hung, R. J.↗

Parallel-vector out-of-core equation solver for computational mechanics

A parallel/vector out-of-core equation solver is developed for shared-memory computers, such as the Cray Y-MP machine. The input/ output (I/O) time is reduced by using the a synchronous BUFFER IN and BUFFER OUT, which can be executed simultaneously with the CPU instructions. The parallel and vector capability provided by the supercomputers is also exploited to enhance the performance. Numerical applications in large-scale structural analysis are given to demonstrate the efficiency of the present out-of-core solver.

Qin, J.↗

Real-time synthetic aperture radar data processing for space applications

Range and azimuth correlation in the time domain using current state-of-the-art CCD LSI technology provides a potentially practical means of achieving real-time pipeline processing of SAR images for future space missions. The proposed range correlator approach, using already demonstrated CCD transversal filtering techniques, will require very little power: less than 10 watts per Seasat-type 20-km processing module. The azimuth correlator architecture is considerably more demanding since it requires a large number of parallel chips (1020 for a Seasat-type 20-km module) to achieve a real-time processing capability.

Arens, W. E.↗

Evolutionary Computing for Low-thrust Navigation

The development of new mission concepts requires efficient methodologies to analyze, design and simulate the concepts before implementation. New mission concepts are increasingly considering the use of ion thrusters for fuel-efficient navigation in deep space. This paper presents parallel, evolutionary computing methods to design trajectories of spacecraft propelled by ion thrusters and to assess the trade-off between delivered payload mass and required flight time. The developed methods utilize a distributed computing environment in order to speed up computation, and use evolutionary algorithms to find globally Pareto-optimal solutions. The methods are coupled with two main traditional trajectory design approaches, which are called direct and indirect. In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. In the indirect approach, a thrust control problem is transformed into a costate control problem, and the initial values of the costate vector are optimized. The developed methods are applied to two problems: 1) an orbit transfer around the Earth and 2) a transfer between two distance retrograde orbits around Europa, the closest to Jupiter of the icy Galilean moons. The optimal solutions found with the present methods are comparable to other state-of-the-art trajectory optimizers and to analytical approximations for optimal transfers, while the required computational time is several orders of magnitude shorter than other optimizers thanks to an intelligent design of control vector discretization, advanced algorithmic parameterization, and parallel computing.

optimization↗

A multicomputer and real time Ada environment

A multicomputer is defined as a set of tightly-coupled yet autonomous computers capable of synchronizing and communicating in parallel but also of operating independently. The architectural concepts and requirements for executing the Ada programs in a multicomputer system are discussed. Synchronization, commmunication, and protection of shared data between the Ada program entities are addressed. Decomposition or partitioning of the Ada program in a multicomputer system is also studied. Finally, a multicomputer and real time Ada environment is described using FLEX/32 multicomputer system.

Naeini, Ray↗

Dual Cryogenic Capacitive Density Sensor

A dual cryogenic capacitive density sensor has been developed. The device contains capacitive sensors that monitor two-phase cryogenic flow density to within 1% accuracy, which, if temperature were known, could be used to determine the ratio of liquid to gas in the line. Two of these density sensors, located a known distance apart, comprise the sensor, providing some information on the velocity of the flow. This sensor was constructed as a proposed mass flowmeter with high data acquisition rates. Without moving parts, this device is capable of detecting the density change within a two-phase cryogenic flow more than 100 times a second. Detection is enabled by a series of two sets of five parallel plates with stainless steel, cryogenically rated tubing. The parallel plates form the two capacitive sensors, which are measured by electrically isolated digital electronics. These capacitors monitor the dielectric of the flow essentially the density of the flow and can be used to determine (along with temperature) the ratio of cryogenic liquid to gas. Combining this information with the velocity of the flow can, with care, be used to approximate the total two-phase mass flow. The sensor can be operated at moderately high pressures and can be lowered into a cryogenic bath. The electronics have been substantially improved over the older sensors, incorporating a better microprocessor, elaborate ground loop protection and noise limiting circuitry, and reduced temperature sensitivity. At the time of this writing, this design has been bench tested at room temperature, but actual cryogenic tests are pending

Youngquist, Robert↗

In-Situ Three-Dimensional Shape Rendering from Strain Values Obtained Through Optical Fiber Sensors

A method and system for rendering the shape of a multi-core optical fiber or multi-fiber bundle in three-dimensional space in real time based on measured fiber strain data. Three optical fiber cores arc arranged in parallel at 120.degree. intervals about a central axis. A series of longitudinally co-located strain sensor triplets, typically fiber Bragg gratings, are positioned along the length of each fiber at known intervals. A tunable laser interrogates the sensors to detect strain on the fiber cores. Software determines the strain magnitude (.DELTA.L/L) for each fiber at a given triplet, but then applies beam theory to calculate curvature, beading angle and torsion of the fiber bundle, and from there it determines the shape of the fiber in s Cartesian coordinate system by solving a series of ordinary differential equations expanded from the Frenet-Serrat equations. This approach eliminates the need for computationally time-intensive curve-tilting and allows the three-dimensional shape of the optical fiber assembly to be displayed in real-time.

Chan, Hon Man↗

Between a Map and a Data Rod

A Digital Divide has long stood between how NASA and other satellite-derived data are typically archived (time-step arrays or maps) and how hydrology and other point-time series oriented communities prefer to access those data. In essence, the desired method of data access is orthogonal to the way the data are archived. Our approach to bridging the Divide is part of a larger NASA-supported data rods project to enhance access to and use of NASA and other data by the Consortium of Universities for the Advancement of Hydrologic Science, Inc. (CUAHSI) Hydrologic Information System (HIS) and the larger hydrology community. Our main objective was to determine a way to reorganize data that is optimal for these communities. Two related objectives were to optimally reorganize data in a way that (1) is operational and fits in and leverages the existing Goddard Earth Sciences Data and Information Services Center (GES DISC) operational environment and (2) addresses the scaling up of data sets available as time series from those archived at the GES DISC to potentially include those from other Earth Observing System Data and Information System (EOSDIS) data archives. Through several prototype efforts and lessons learned, we arrived at a non-database solution that satisfied our objectivesconstraints. We describe, in this presentation, how we implemented the operational production of pre-generated data rods and, considering the tradeoffs between length of time series (or number of time steps), resources needed, and performance, how we implemented the operational production of on-the-fly (virtual) data rods. For the virtual data rods, we leveraged a number of existing resources, including the NASA Giovanni Cache and NetCDF Operators (NCO) and used data cubes processed in parallel. Our current benchmark performance for virtual generation of data rods is about a years worth of time series for hourly data (9,000 time steps) in 90 seconds. Our approach is a specific implementation of the general optimal strategy of reorganizing data to match the desired means of access. Results from our project have already significantly extended NASA data to the large and important hydrology user community that has been, heretofore, mostly unable to easily access and use NASA data.

machine learning↗

Real time identification of large space structures

Identification of frequencies, damping ratios, and mode shapes of large space structures (LSSs) are examined in real time. Real time processing allows for quick updates of model processing after a reconfiguration of structural failure. Recursive lattice least squares (RLLS) was selected as the baseline algorithm for the identification. Simulation results on a one dimensional LSS demonstrated that it provides good estimates, was not ill-conditioned in the presence of under-excited modes, allowed activity by a supervisory control system which prevented damage to the LSS or excessive drift, and was capable of real-time processing for typical LSS models. A suboptimal version of RLLS, which is equivalent to simulated parallel processing, was derived. A NASTRAN model of the dual keel U.S. space station was used to demonstrate the input/identification algorithm package in a more realistic simulation. Because the first eight flexible modes were very close together, the identification was much more difficult than in the simple examples. Even so, the model was accurately identified in real time.

Voss, Janice E.↗

Solving very large, sparse linear systems on mesh-connected parallel computers

The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.

Opsahl, Torstein↗

On the inference of viscoelastic constants from stress relaxation experiments

Several constitutive theories have been proposed in the literature to model the viscoelastic response of materials, including widely used rheological constitutive models. These models are characterized by certain parameters ("time constants") that define the time scales over which the material relaxes. These parameters are primarily obtained from stress relaxation experiments using curve-fitting techniques. However, the question of how best to estimate these time constants remains open. As a step towards answering this question, we propose an optimal experimental design approach based on ideas from information geometry, namely Fisher information and Kullback-Leibler divergence. The material is modeled as a spring element in parallel with multiple Maxwell elements and described using a one- or two-term Prony series. Treating the time constants as unknowns, we develop expressions for the Fisher information and Kullback-Leibler divergence that allow us to maximize information gain from experimental data. Based on the results of this study, we propose that the largest time constant estimated from a stress relaxation experiment for a linear viscoelastic material should be at most one-fifth of the total time of the experiment in order to maximize information gain. Our results also provide confirmation that the equilibrium modulus of the material cannot be reliably determined from curve-fitting to data from a stress relaxation experiment.

Fisher information↗