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 289 records · Page 16

High-resolution turbulent simulations using the Connection Machine-2

The spectral method provides an efficient algorithm for solving the 3D incompressible Navier-Stokes equations in periodic boundaries. Most people, so far, have used vectorized machines, such as the CRAY-2, to implement fast Fourier transformations and time integrations in the spectral calculations. In this paper, new results are presented using the spectral calculations on the Connection Machine-2 with a parallel algorithm. The large memory of the Connection Machine-2 and the parallel algorithm allows, of the first time, to implement a 512-cubed mesh resolution for high Reynolds number flows. The computational speed of the present code is about 30 percent faster than the fastest CRAY-2 simulations with four processors. Parallel machines, such as the Connection Machine-2, will possibly provide new computational power for understanding the intermittency and cascade mechanism in fluid turbulence.

Chen, Shiyi↗

Planning in time - Windows and durations for activities and goals

The present general purpose automated planner/scheduler generates parallel plans aimed at the achievement of goals having imposed time constraints, with both durations and start time windows being specifiable for sets of goal conditions. Deterministic durations of such parallel plan activities as actions, events triggered by circumstances, inferences, and scheduled events entirely outside the actor's control, are explicitly modeled and may be any computable function of the activity variables. The final plan network resembles a PERT chart. Examples are given from the traditional 'blocksworld', and from a realistic 'Spaceworld' in which an autonomous spacecraft photographs objects in deep space and transmits the information to earth.

Vere, S. A.↗

The Mega Mesospheric Parachute

The current understanding and modeling of the upper reaches of the atmosphere is incomplete. Upper atmospheric interactions with the lower atmosphere, effects of ionizing radiation, high altitude cloud phenomena, and the dynamical interaction with the magnetosphere require greater definition. The scientific objective of obtaining a greater understanding of the upper atmosphere can be achieved by designing, implementing, testing, and utilizing a facility that provides long period in-situ measurements of the mesosphere. Current direct sub-sonic measurements of the upper atmosphere are hampered by the approximately one minute sub-sonic observation window of a ballistic sounding rocket regardless of the launch angle. In-situ measurements at greater than transonic speeds impart energy into the molecular atmospheric system and distort the true atmospheric chemistry. A long duration, sub-sonic capability will significantly enhance our ability to observe and measure: (1) mesospheric lightning phenomena (sprites and blue jets) (2) composition, structure and stratification of noctilucent clouds (3) physics of seasonal radar echoes, gravity wave phenomena (4) chemistry of mesospheric gaseous ratio mixing (5) mesospheric interaction of ionizing radiation (6) dynamic electric and magnetic fields This new facility will also provide local field measurements which complement those that can be obtained through external measurements from satellite and ground-based platforms. The 400 foot (approximately 130 meter) diameter lightweight mega-mesospheric parachute system, deployed with a sounding rocket, is proposed herein as a method to increase sub-sonic mesospheric measurement time periods by more than an order of magnitude. The report outlines a multi-year evolving science instrumentation suite in parallel with the development of the mega meso-chute facility. The developmental issues surrounding the meso-chute are chiefly materials selection (thermal and structural) and deployment mechanism physics. Three mission cases were conceived and developed to include cost and schedules estimates. Each scenario has increasing scientific utility with paralleling launch weight, parachute hang-time, deployment altitude, and parachute size: (1) Case #1: $8.4M@24 months, 6kg payload, 20 min., 50km alt., 80 m. dia. (2) Case #2: $10.4M@24 months, 6kg payload, 20 min., 60km alt, 130m. dia. (3) Case #3: $13.6M@36 months, 30kg payload, 30 min., 90km alt., 200m. dia. The initial breakout cost for the parachute system is approximately $2M@24 months. This report identifies that although the challenges of the mega-meso-chute may be difficult, they can be surmounted and valuable results can be achieved.

Kloesel, Kurt J.↗

Evidence for parallel electric field particle acceleration in the dayside auroral oval

Electron and ion energy spectra and electron pitch angle distributions are presented for two sounding rocket flights in the dayside auroral zone. At times, effects of dc electric fields parallel to the magnetic field are evident in that: (1) within precipitation features, protons are decelerated by an amount of energy consistent with that which electrons gain and (2) electrons are sometimes aligned to within 3 deg (full width at half maximum) of the magnetic field. A maximum altitude for the accelerating region of several thousand kilometers is deduced from the narrow width of the pitch angle distribution and also from time-of-flight delays between the observation of accelerated electrons and decelerated protons.

Torbert, R. B.↗

Multiprocessing the Sieve of Eratosthenes

The Sieve of Eratosthenes for finding prime numbers in recent years has seen much use as a benchmark algorithm for serial computers while its intrinsically parallel nature has gone largely unnoticed. The implementation of a parallel version of this algorithm for a real parallel computer, the Flex/32, is described and its performance discussed. It is shown that the algorithm is sensitive to several fundamental performance parameters of parallel machines, such as spawning time, signaling time, memory access, and overhead of process switching. Because of the nature of the algorithm, it is impossible to get any speedup beyond 4 or 5 processors unless some form of dynamic load balancing is employed. We describe the performance of our algorithm with and without load balancing and compare it with theoretical lower bounds and simulated results. It is straightforward to understand this algorithm and to check the final results. However, its efficient implementation on a real parallel machine requires thoughtful design, especially if dynamic load balancing is desired. The fundamental operations required by the algorithm are very simple: this means that the slightest overhead appears prominently in performance data. The Sieve thus serves not only as a very severe test of the capabilities of a parallel processor but is also an interesting challenge for the programmer.

Bokhari, S.↗

A parallel iterative solution method for systems of nonlinear hyperbolic equations

An iterative algorithm suitable for the solution of a system of nonlinear hyperbolic partial differentiation equations in multiple dimensions is discussed. Current numerical methods for systems of nonlinear PDEs have limited parallelism due to strong coupling between the equations. This method decouples the PDEs by linearizing the convention coefficient for a space-time domain. This provides large grain parallelism. The linearization also allows the treatment of some terms in the equations as source terms, providing more freedom to choose from a wider variety of numerical methods. Smaller grain parallelism may be exploited within the solves for each equation. Thus, the method has potential for parallelism at several levels.

Scroggs, Jeffrey S.↗

Three-wave coupling observed between a shear Alfvén wave and a kink-unstable magnetic flux rope

Results from a laboratory experiment are presented in which, for the first time, a shear Alfvén wave is launched using an antenna in a current-carrying plasma column that is tailored to be either stable or unstable to the kink oscillation. As the plasma is driven kink unstable, the frequency power spectrum of the Alfvén wave evolves from a single peak to a peak with multiple sidebands separated by integer multiples of the kink frequency. The main sidebands (one on either side of the launched wave peak in the power spectrum) are analyzed using azimuthal wavenumber matching, perpendicular and parallel wavenumber decomposition, and bispectral time series analysis. The dispersion relation and three-wave matching conditions are satisfied, given each sideband is a propagating Alfvén wave that results from the interaction of the pump Alfvén wave and the co-propagating component of a half-wavelength, standing kink mode. The interaction is shown to generate smaller perpendicular wavelength Alfvén waves that drive energy transport to scales that will approach the dissipation scale of k⊥ρs=1, with k⊥ being the perpendicular wavenumber and ρs being the ion gyroradius at the electron temperature.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Satisfiability Test with Synchronous Simulated Annealing on the Fujitsu AP1000 Massively-Parallel Multiprocessor

Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a parallel synchronous simulated annealing method for solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchronous simulated annealing procedure, called Generalized Speculative Computation, which guarantees the same decision sequence as sequential simulated annealing. To demonstrate the performance of the parallel method, we have selected problem instances varying in size from 100-variables/425-clauses to 5000-variables/21,250-clauses. Experimental results on the AP1000 multiprocessor indicate that our approach can satisfy 99.9 percent of the clauses while giving almost a 70-fold speedup on 500 processors.

Sohn, Andrew↗

Parallel computations and control of adaptive structures

The equations of motion for structures with adaptive elements for vibration control are presented for parallel computations to be used as a software package for real-time control of flexible space structures. A brief introduction of the state-of-the-art parallel computational capability is also presented. Time marching strategies are developed for an effective use of massive parallel mapping, partitioning, and the necessary arithmetic operations. An example is offered for the simulation of control-structure interaction on a parallel computer and the impact of the approach presented for applications in other disciplines than aerospace industry is assessed.

Park, K. C.↗

Resource Selection Using Execution and Queue Wait Time Predictions

Computational grids provide users with many possible places to execute their applications. We wish to help users select where to run their applications by providing predictions of the execution times of applications on space shared parallel computers and predictions of when scheduling systems for such parallel computers will start applications. Our predictions are based on instance based learning techniques and simulations of scheduling algorithms. We find that our execution time prediction techniques have an average error of 37 percent of the execution times for trace data recorded from SGI Origins at NASA Ames Research Center and that this error is 67 percent lower than the error of user estimates. We also find that the error when predicting how long applications will wait in scheduling queues is 95 percent of mean queue wait times when using our execution time predictions and this is 57 percent lower than if we use user execution time estimates.

Warren, Smith↗

Resource Selection Using Execution and Queue Wait Time Predictions

Computational grids provide users with many possible places to execute their applications. We wish to help users select where to run their applications by providing predictions of the execution times of applications on space shared parallel computers and predictions of when scheduling systems for such parallel computers will start applications. Our predictions are based on instance based learning techniques and simulations of scheduling algorithms. We find that our execution time prediction techniques have an average error of 37 percent of the execution times for trace data recorded from SGI Origins at NASA Ames Research Center and that this error is 67 percent lower than the error of user estimates. We also find that the error when predicting how long applications will wait in scheduling queues is 95 percent of mean queue wait times when using our execution time predictions and this is 57 percent lower than if we use user execution time estimates.

Smith, Warren↗

Parallel Climate Data Assimilation PSAS Package

We have designed and implemented a set of highly efficient and highly scalable algorithms for an unstructured computational package, the PSAS data assimilation package, as demonstrated by detailed performance analysis of systematic runs on up to 512node Intel Paragon. The equation solver achieves a sustained 18 Gflops performance. As the results, we achieved an unprecedented 100-fold solution time reduction on the Intel Paragon parallel platform over the Cray C90. This not only meets and exceeds the DAO time requirements, but also significantly enlarges the window of exploration in climate data assimilations.

PSAS data scalable algorithms Intel Paragon 512nod↗

What is Team X?

Team X is a concurrent engineering team for rapid design and analysis of space mission concepts. It was developed in 1995 by JPL to reduce study time and cost. More than 1100 studies have been completed It is institutionally endorsed and it has been emulated by many institutions. In Concurrent Engineering (i.e., Parallel) diverse specialists work in real time, in the same place, with shared data, to yield an integrated design

Concurrent Engineering↗

An Efficient and Accurate Algorithm for Computing Grid-Averaged Solar Fluxes for Horizontally Inhomogeneous Clouds

A computationally efficient method is presented to account for the horizontal cloud inhomogeneity by using a radiatively equivalent plane parallel homogeneous (PPH) cloud. The algorithm can accurately match the calculations of the reference (rPPH) independent column approximation (ICA) results, but use only the same computational time required for a single plane parallel computation. The effective optical depth of this synthetic sPPH cloud is derived by exactly matching the direct transmission to that of the inhomogeneous ICA cloud. The ffective9 scattering asymmetry factor is found from a pre-calculated albedo inverse look-up-table that is allowed to vary over the range from -1.0 to 1.0. In the special cases of conservative scattering and total absorption, the synthetic method is exactly equivalent to the ICA, with only a small bias (about 0.2% in flux) relative to ICA due to imperfect interpolation in using the look-up tables. In principle, the ICA albedo can be approximated accurately regardless of cloud inhomogeneity. For a more complete comparison, the broadband shortwave albedo and transmission calculated from the synthetic sPPH cloud and averaged over all incident directions, have the RMS biases of 0.26% and 0.76%, respectively, for inhomogeneous clouds over a wide variation of particle size. The advantages of the synthetic PPH method are that (1) it is not required that all the cloud subcolumns have uniform microphysical characteristic, (2) it is applicable to any 1D radiative transfer scheme, and (3) it can handle arbitrary cloud optical depth distributions and an arbitrary number of cloud subcolumns with uniform computational efficiency.

cloud inhomogeneity↗

Heat release effects on the instability of parallel shear layers

The influence of time-dependent heat addition on the linear instablity of shear layers is of considerable interest in understanding the dynamic behavior of reacting flows and combustion-turbulence interactions. The approach is based upon the Bernoulli enthalpy aeroacoustics theory, which utilizes the specific enthalpy and specific entropy as the primary thermodynamic variables. In addition, velocity oscillations are split into Helmoholtz decomposition theorem.

Hegde, U.↗

Exploratory Study for Continuous-time Parameter Estimation of Ankle Dynamics

Recently, a parallel pathway model to describe ankle dynamics was proposed. This model provides a relationship between ankle angle and net ankle torque as the sum of a linear and nonlinear contribution. A technique to identify parameters of this model in discrete-time has been developed. However, these parameters are a nonlinear combination of the continuous-time physiology, making insight into the underlying physiology impossible. The stable and accurate estimation of continuous-time parameters is critical for accurate disease modeling, clinical diagnosis, robotic control strategies, development of optimal exercise protocols for longterm space exploration, sports medicine, etc. This paper explores the development of a system identification technique to estimate the continuous-time parameters of ankle dynamics. The effectiveness of this approach is assessed via simulation of a continuous-time model of ankle dynamics with typical parameters found in clinical studies. The results show that although this technique improves estimates, it does not provide robust estimates of continuous-time parameters of ankle dynamics. Due to this we conclude that alternative modeling strategies and more advanced estimation techniques be considered for future work.

neuromuscular systems↗