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 379 records · Page 21

Parallel algorithms and architecture for computation of manipulator forward dynamics

Parallel computation of manipulator forward dynamics is investigated. Considering three classes of algorithms for the solution of the problem, that is, the O(n), the O(n exp 2), and the O(n exp 3) algorithms, parallelism in the problem is analyzed. It is shown that the problem belongs to the class of NC and that the time and processors bounds are of O(log2/2n) and O(n exp 4), respectively. However, the fastest stable parallel algorithms achieve the computation time of O(n) and can be derived by parallelization of the O(n exp 3) serial algorithms. Parallel computation of the O(n exp 3) algorithms requires the development of parallel algorithms for a set of fundamentally different problems, that is, the Newton-Euler formulation, the computation of the inertia matrix, decomposition of the symmetric, positive definite matrix, and the solution of triangular systems. Parallel algorithms for this set of problems are developed which can be efficiently implemented on a unique architecture, a triangular array of n(n+2)/2 processors with a simple nearest-neighbor interconnection. This architecture is particularly suitable for VLSI and WSI implementations. The developed parallel algorithm, compared to the best serial O(n) algorithm, achieves an asymptotic speedup of more than two orders-of-magnitude in the computation the forward dynamics.

Fijany, Amir↗

Interpreting Solar Wind Turbulent Spectra beyond Taylor’s Hypothesis

In this Letter we apply a methodology, recently proposed by Bourouaine & Perez (BP19), to interpret solar wind turbulent power spectra beyond the Taylor approximation (TA). The turbulent power spectra were measured using Helios spacecraft data near 0.6 au. We use the model proposed in BP19 to reproduce the field-perpendicular power spectrum E(k(sub ⊥)) of antisunward Alfvénic fluctuations in the plasma frame (where k(sub ⊥) is the field-perpendicular wavenumber) from the corresponding measured frequency power spectrum P(sub sc)(ω,θ(sub b)) along the sampling angle ,θ(sub b), which is the angle between the local magnetic field and the sampling direction. Here ω = 2πf and f is the frequency of the time signal. Interestingly enough, we found that for all corresponding measured frequency power spectrum P(sub sc)(ω,θ(sub b)) the reproduced field-perpendicular power spectrum E(k(sub ⊥)) is the same and independent of the considered sampling angle θ(sub b). This finding is consistent with the fact that the analyzed turbulence is strong and highly anisotropic with k(sub ∥) ≪ k(sub ⊥) (where k(sub ∥) is the field-parallel wavenumber). Furthermore, for this specific time signal we found that the commonly used TA is still approximately valid with the important difference that a broadening in k(sub ⊥) for each angular frequency ω is present. This broadening can be described in the context of the methodology proposed in BP19.

Solar magnetic fields↗

Enabling Parallel Performance and Portability of Solid Mechanics Simulations Across CPU and GPU Architectures

Efficiently simulating solid mechanics is vital across various engineering applications. As constitutive models grow more complex and simulations scale up in size, harnessing the capabilities of modern computer architectures has become essential for achieving timely results. This paper presents advancements in running parallel simulations of solid mechanics on multi-core CPUs and GPUs using a single-code implementation. This portability is made possible by the C++ matrix and array (MATAR) library, which interfaces with the C++ Kokkos library, enabling the selection of fine-grained parallelism backends (e.g., CUDA, HIP, OpenMP, pthreads, etc.) at compile time. MATAR simplifies the transition from Fortran to C++ and Kokkos, making it easier to modernize legacy solid mechanics codes. We applied this approach to modernize a suite of constitutive models and to demonstrate substantial performance improvements across different computer architectures. This paper includes comparative performance studies using multi-core CPUs along with AMD and NVIDIA GPUs. Results are presented using a hypoelastic–plastic model, a crystal plasticity model, and the viscoplastic self-consistent generalized material model (VPSC-GMM). The results underscore the potential of using the MATAR library and modern computer architectures to accelerate solid mechanics simulations.

Morgan, Nathaniel (ORCID:0000000276118449)↗

Variance of the Quantum Dwell Time for a Nonrelativistic Particle

Munoz, Seidel, and Muga [Phys. Rev. A 79, 012108 (2009)], following an earlier proposal by Pollak and Miller [Phys. Rev. Lett. 53, 115 (1984)] in the context of a theory of a collinear chemical reaction, showed that suitable moments of a two-flux correlation function could be manipulated to yield expressions for the mean quantum dwell time and mean square quantum dwell time for a structureless particle scattering from a time-independent potential energy field between two parallel lines in a two-dimensional spacetime. The present work proposes a generalization to a charged, nonrelativistic particle scattering from a transient, spatially confined electromagnetic vector potential in four-dimensional spacetime. The geometry of the spacetime domain is that of the slab between a pair of parallel planes, in particular those defined by constant values of the third (z) spatial coordinate. The mean Nth power, N = 1, 2, 3, . . ., of the quantum dwell time in the slab is given by an expression involving an N-flux-correlation function. All these means are shown to be nonnegative. The N = 1 formula reduces to an S-matrix result published previously [G. E. Hahne, J. Phys. A 36, 7149 (2003)]; an explicit formula for N = 2, and of the variance of the dwell time in terms of the S-matrix, is worked out. A formula representing an incommensurability principle between variances of the output-minus-input flux of a pair of dynamical variables (such as the particle s time flux and others) is derived.

Hahne, Gerhard↗

Parallel computation of unsteady, three-dimensional, chemically reacting, nonequilibrium flow using a time-split finite-volume method on the Illiac IV

A description is presented of the split finite-volume method which is a viable numerical procedure for performing with the aid of a modern special purpose vector computer numerical simulation studies of complicated flow fields, including chemical reactions, about geometrically complex bodies. Such numerical studies are needed for the development of atmospheric entry vehicles such as the space shuttle. The equations which are approximated are quite general and can be used in studies of combustion, pollution, and other chemically reacting flow phenomena, where convective transport effects dominate the influence of radiative, viscous, and other transport mechanisms. The shock perturbed flow about a shuttle orbiter flying at a large angle of attack during atmospheric entry is illustrated. The method uses a time splitting of the convection differencing operator to achieve efficient data management.

Reinhardt, W. A.↗

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Venter, Gerhard↗

The Software Correlator of the Chinese VLBI Network

The software correlator of the Chinese VLBI Network (CVN) has played an irreplaceable role in the CVN routine data processing, e.g., in the Chinese lunar exploration project. This correlator will be upgraded to process geodetic and astronomical observation data. In the future, with several new stations joining the network, CVN will carry out crustal movement observations, quick UT1 measurements, astrophysical observations, and deep space exploration activities. For the geodetic or astronomical observations, we need a wide-band 10-station correlator. For spacecraft tracking, a realtime and highly reliable correlator is essential. To meet the scientific and navigation requirements of CVN, two parallel software correlators in the multiprocessor environments are under development. A high speed, 10-station prototype correlator using the mixed Pthreads and MPI (Massage Passing Interface) parallel algorithm on a computer cluster platform is being developed. Another real-time software correlator for spacecraft tracking adopts the thread-parallel technology, and it runs on the SMP (Symmetric Multiple Processor) servers. Both correlators have the characteristic of flexible structure and scalability.

Zheng, Weimin↗

Phase space simulation of collisionless stellar systems on the massively parallel processor

A numerical technique for solving the collisionless Boltzmann equation describing the time evolution of a self gravitating fluid in phase space was implemented on the Massively Parallel Processor (MPP). The code performs calculations for a two dimensional phase space grid (with one space and one velocity dimension). Some results from calculations are presented. The execution speed of the code is comparable to the speed of a single processor of a Cray-XMP. Advantages and disadvantages of the MPP architecture for this type of problem are discussed. The nearest neighbor connectivity of the MPP array does not pose a significant obstacle. Future MPP-like machines should have much more local memory and easier access to staging memory and disks in order to be effective for this type of problem.

White, Richard L.↗

Digital data reformatter/deserializer

A method and apparatus is presented for reformatting and de-serializing a serially-received sequence of data words, each consisting of a fixed number of binary data bits. A block of nm bits is serially fed into a shift register or serially-connected group of shift registers. In lieu of the(nm-1)th shifts, the bits are rearranged within the shift register in parallel fashion, according to a prescribed scheme. Shifting then continues, until the first bit of each data word appears in the last bit position in the shift register, at which time that data word is shifted in parallel into an output buffer stage, from which it is outputted in parallel, after a fixed delay.

Engel, A.↗

Method of Detecting System Function by Measuring Frequency Response

Real time battery impedance spectrum is acquired using one time record, Compensated Synchronous Detection (CSD). This parallel method enables battery diagnostics. The excitation current to a test battery is a sum of equal amplitude sin waves of a few frequencies spread over range of interest. The time profile of this signal has duration that is a few periods of the lowest frequency. The voltage response of the battery, average deleted, is the impedance of the battery in the time domain. Since the excitation frequencies are known, synchronous detection processes the time record and each component, both magnitude and phase, is obtained. For compensation, the components, except the one of interest, are reassembled in the time domain. The resulting signal is subtracted from the original signal and the component of interest is synchronously detected. This process is repeated for each component.

Morrison, John L.↗

A real time neural net estimator of fatigue life

A neural net architecture is proposed to estimate, in real-time, the fatigue life of mechanical components, as part of the Intelligent Control System for Reusable Rocket Engines. Arbitrary component loading values were used as input to train a two hidden-layer feedforward neural net to estimate component fatigue damage. The ability of the net to learn, based on a local strain approach, the mapping between load sequence and fatigue damage has been demonstrated for a uniaxial specimen. Because of its demonstrated performance, the neural computation may be extended to complex cases where the loads are biaxial or triaxial, and the geometry of the component is complex (e.g., turbopump blades). The generality of the approach is such that load/damage mappings can be directly extracted from experimental data without requiring any knowledge of the stress/strain profile of the component. In addition, the parallel network architecture allows real-time life calculations even for high frequency vibrations. Owing to its distributed nature, the neural implementation will be robust and reliable, enabling its use in hostile environments such as rocket engines. This neural net estimator of fatigue life is seen as the enabling technology to achieve component life prognosis, and therefore would be an important part of life extending control for reusable rocket engines.

Troudet, T.↗

A real time neural net estimator of fatigue life

A neural network architecture is proposed to estimate, in real-time, the fatigue life of mechanical components, as part of the intelligent Control System for Reusable Rocket Engines. Arbitrary component loading values were used as input to train a two hidden-layer feedforward neural net to estimate component fatigue damage. The ability of the net to learn, based on a local strain approach, the mapping between load sequence and fatigue damage has been demonstrated for a uniaxial specimen. Because of its demonstrated performance, the neural computation may be extended to complex cases where the loads are biaxial or triaxial, and the geometry of the component is complex (e.g., turbopumps blades). The generality of the approach is such that load/damage mappings can be directly extracted from experimental data without requiring any knowledge of the stress/strain profile of the component. In addition, the parallel network architecture allows real-time life calculations even for high-frequency vibrations. Owing to its distributed nature, the neural implementation will be robust and reliable, enabling its use in hostile environments such as rocket engines.

Troudet, T.↗

Contextual classification on PASM

The use of N microprocessors in the SIMD mode of parallel processing to do classifications almost N times faster than a single microprocessor is discussed. Examples of contextual classifiers are given, uniprocessor algorithms for performing contextual classifications are presented, and their computational complexity is analyzed. The SIMD mode of parallel processing is defined and PASM is overviewed. The presented uniprocessor algorithms are used as a basis for developing parallel algorithms for performing computationally intensive contextual classifications.

Siegel, H. J.↗

Cardinal: Seismic and Geoacoustic Array Processing

Data collected via seismic and infrasound array deployments are leveraged in the geosciences to detect and characterize a myriad of natural and anthropogenic sources. These deployments consist of numerous sensors placed in a predetermined configuration to amplify signal strength and improve the efficacy of array processing techniques used to measure signal directionality and waveform coherence. High‐fidelity feature extraction is often predicated on interstation distance as well as the frequency content and wavelength of an incident signal. Numerous array processing softwares analyze data in sequential frequency bands to obtain a more detailed characterization of a signal. However, current algorithms are limited in their ability to determine optimal array configuration for each band. We introduce an open‐source Python code, called Cardinal, to process seismic and infrasound array data in discretized time–frequency space with the option of applying an adaptive array design to determine optimal subarray configuration for each frequency band. To reduce computational time, the array processing step can be run in parallel using multithreading. Furthermore, the software has the capability to aggregate array processing results from different time–frequency pixels to produce separate sets of detections, or families, with added utility via the application of an adaptive semblance threshold, which aids in isolating signals‐of‐interest from coherent background noise. Upon appropriate configuration, Cardinal exhibits the potential to combine distinct seismic and infrasound phases into separate families.

Adaptive Array↗

A Strassen-Newton algorithm for high-speed parallelizable matrix inversion

Techniques are described for computing matrix inverses by algorithms that are highly suited to massively parallel computation. The techniques are based on an algorithm suggested by Strassen (1969). Variations of this scheme use matrix Newton iterations and other methods to improve the numerical stability while at the same time preserving a very high level of parallelism. One-processor Cray-2 implementations of these schemes range from one that is up to 55 percent faster than a conventional library routine to one that is slower than a library routine but achieves excellent numerical stability. The problem of computing the solution to a single set of linear equations is discussed, and it is shown that this problem can also be solved efficiently using these techniques.

Bailey, David H.↗

Program For Parallel Discrete-Event Simulation

User does not have to add any special logic to aid in synchronization. Time Warp Operating System (TWOS) computer program is special-purpose operating system designed to support parallel discrete-event simulation. Complete implementation of Time Warp mechanism. Supports only simulations and other computations designed for virtual time. Time Warp Simulator (TWSIM) subdirectory contains sequential simulation engine interface-compatible with TWOS. TWOS and TWSIM written in, and support simulations in, C programming language.

Beckman, Brian C.↗

NASA Space Launch System Operations Outlook

The National Aeronautics and Space Administration's (NASA) Space Launch System (SLS) Program, managed at the Marshall Space Flight Center (MSFC), is working with the Ground Systems Development and Operations (GSDO) Program, based at the Kennedy Space Center (KSC), to deliver a new safe, affordable, and sustainable capability for human and scientific exploration beyond Earth's orbit (BEO). Larger than the Saturn V Moon rocket, SLS will provide 10 percent more thrust at liftoff in its initial 70 metric ton (t) configuration and 20 percent more in its evolved 130-t configuration. The primary mission of the SLS rocket will be to launch astronauts to deep space destinations in the Orion Multi-Purpose Crew Vehicle (MPCV), also in development and managed by the Johnson Space Center. Several high-priority science missions also may benefit from the increased payload volume and reduced trip times offered by this powerful, versatile rocket. Reducing the life-cycle costs for NASA's space transportation flagship will maximize the exploration and scientific discovery returned from the taxpayer's investment. To that end, decisions made during development of SLS and associated systems will impact the nation's space exploration capabilities for decades. This paper will provide an update to the operations strategy presented at SpaceOps 2012. It will focus on: 1) Preparations to streamline the processing flow and infrastructure needed to produce and launch the world's largest rocket (i.e., through incorporation and modification of proven, heritage systems into the vehicle and ground systems); 2) Implementation of a lean approach to reachback support of hardware manufacturing, green-run testing, and launch site processing and activities; and 3) Partnering between the vehicle design and operations communities on state-ofthe- art predictive operations analysis techniques. An example of innovation is testing the integrated vehicle at the processing facility in parallel, rather than sequentially, saving both time and money. These themes are accomplished under the context of a new cross-program integration model that emphasizes peer-to-peer accountability and collaboration towards a common, shared goal. Utilizing the lessons learned through 50 years of human space flight experience, SLS is assigning the right number of people from appropriate backgrounds, providing them the right tools, and exercising the right processes for the job. The result will be a powerful, versatile, and capable heavy-lift, human-rated asset for the future human and scientific exploration of space.

Hefner, William Keith↗

NASA Space Launch System Operations Outlook

The National Aeronautics and Space Administration's (NASA) Space Launch System (SLS) Program, managed at the Marshall Space Flight Center (MSFC), is working with the Ground Systems Development and Operations (GSDO) Program, based at the Kennedy Space Center (KSC), to deliver a new safe, affordable, and sustainable capability for human and scientific exploration beyond Earth's orbit (BEO). Larger than the Saturn V Moon rocket, SLS will provide 10 percent more thrust at liftoff in its initial 70 metric ton (t) configuration and 20 percent more in its evolved 130-t configuration. The primary mission of the SLS rocket will be to launch astronauts to deep space destinations in the Orion Multi- Purpose Crew Vehicle (MPCV), also in development and managed by the Johnson Space Center. Several high-priority science missions also may benefit from the increased payload volume and reduced trip times offered by this powerful, versatile rocket. Reducing the lifecycle costs for NASA's space transportation flagship will maximize the exploration and scientific discovery returned from the taxpayer's investment. To that end, decisions made during development of SLS and associated systems will impact the nation's space exploration capabilities for decades. This paper will provide an update to the operations strategy presented at SpaceOps 2012. It will focus on: 1) Preparations to streamline the processing flow and infrastructure needed to produce and launch the world's largest rocket (i.e., through incorporation and modification of proven, heritage systems into the vehicle and ground systems); 2) Implementation of a lean approach to reach-back support of hardware manufacturing, green-run testing, and launch site processing and activities; and 3) Partnering between the vehicle design and operations communities on state-of-the-art predictive operations analysis techniques. An example of innovation is testing the integrated vehicle at the processing facility in parallel, rather than sequentially, saving both time and money. These themes are accomplished under the context of a new cross-program integration model that emphasizes peer-to-peer accountability and collaboration towards a common, shared goal. Utilizing the lessons learned through 50 years of human space flight experience, SLS is assigning the right number of people from appropriate backgrounds, providing them the right tools, and exercising the right processes for the job. The result will be a powerful, versatile, and capable heavy-lift, human-rated asset for the future human and scientific exploration of space.

Hefner, William Keith↗