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 793 records · Page 44
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Active Time-Domain Reflectometry for Unattended Safeguards Systems FY15 Report

The International Atomic Energy Agency (IAEA) continues to expand its use of unattended measurement systems. An increasing number of systems and an expanding family of instruments create challenges in terms of deployment efficiency and the implementation of data authentication measures. In collaboration with the IAEA, tamper-indicating measures to address data-transmission authentication challenges with unattended safeguards systems are under investigation. Pacific Northwest National Laboratory (PNNL) is studying the viability of active time-domain reflectometry (TDR) along two parallel but interconnected paths: (1) swept-frequency TDR as the highly flexible, laboratory gold standard to which field-deployable options can be compared, and (2) a low-cost commercially available spread-spectrum TDR technology as one option for field implementation. This report describes PNNL’s FY15 progress in the viability study including: an overview of the TDR methods under investigation; description of the testing configurations and mock tampering scenarios; results from a preliminary sensitivity comparison of the two TDR methods; demonstration of a quantitative metric for estimating field performance that acknowledges the need for high detection probability while minimizing false alarms. FY15 progress reported here sets the stage for a rigorous comparison of the candidate TDR methods, over a range of deployment scenarios and perturbing effects typical of IAEA unattended monitoring systems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2018

Exploiting Geometric Partitioning in Task Mapping for Parallel Computes

We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by "nearby' cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the overall cost of communication. Our new method applies a geometric partitioning algorithm to both the tasks and the processors, and assigns task parts to the corresponding processor parts. We also present a number of algorithmic optimizations that exploit specific features of the network or application. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 32K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Model Reduction for Compressible Cavity Simulations Towards Uncertainty Quantification of Structural Loading

This report summarizes FY16 progress towards enabling uncertainty quantification for compressible cavity simulations using model order reduction (MOR). The targeted application is the quantification of the captive-carry environment for the design and qualification of nuclear weapons systems. To accurately simulate this scenario, Large Eddy Simulations (LES) require very fine meshes and long run times, which lead to week-long runs even on parallel state-of-the-art super- computers. MOR can reduce substantially the CPU-time requirement for these simulations. We describe two approaches for model order reduction for nonlinear systems, which can yield significant speed-ups when combined with hyper-reduction: the Proper Orthogonal Decomposition (POD)/Galerkin approach and the POD/Least-Squares Petrov Galerkin (LSPG) approach. The implementation of these methods within the in-house compressible flow solver SPARC is discussed. Next, a method for stabilizing and enhancing low-dimensional reduced bases that was developed as a part of this project is detailed. This approach is based on a premise termed "minimal subspace rotation", and has the advantage of yielding ROMs that are more stable and accurate for long-time compressible cavity simulations. Numerical results for some laminar cavity problems aimed at gauging the viability of the proposed model reduction methodologies are presented and discussed.

42 ENGINEERING↗
NASA NTRS1970

Leading-edge pressure measurements of airfoil vortex interaction

Experimental pressure-differential measurements made at 10% chord of an airfoil-vortex interaction are presented. A line vortex was oscillated over an airfoil perpendicular to the span and parallel to the chord. The pressure time history was recorded in order to show the sharp pressure pulses resulting from the bursting of the vortex core as it impinges upon the airfoil. Results for various vortex sizes and free stream velocities were obtained. Measurements were also made when the airfoil was yawed to the line vortex. Maximum pressure differences were observed to occur in phase across the blade even with yaw, and were directly proportional to the square of the free stream velocity. The maximum dynamic pressure coefficients obtained were as high as 1.0 when vortex bursting occurred.

Walsh, R. G., Jr.↗
NASA NTRS1985

Viscous effects on transonic airfoil stability and response

Viscous effects on transonic airfoil stability and response are investigated using an integral boundary layer model coupled to the inviscid XTRAN2L transonic small disturbance code. Unsteady transonic airloads required for stability analyses are computed using a pulse transfer function analysis including viscous effects. The pulse analysis provides unsteady aerodynamic forces for a wide range of reduced frequency in a single flow field computation. Nonlinear time marching aeroelastic solutions are presented which show the effects of viscosity on airfoil response behavior and flutter. Effects of amplitude on time marching responses are demonstrated. A state space aeroelastic model employing Pade approximants to describe the unsteady airloads is used to study the effects of viscosity on transonic airfoil stability. State space dynamic pressure root loci are in good overall agreement with time marching damping and frequency estimates. Parallel sets of results with and without viscous effects reveal the effects of viscosity on transonic unsteady airloads and aeroelastic characteristics of airfoils.

Berry, H. M.↗
NASA NTRS1985

The cosmic-ray shock structure problem for relativistic shocks

The time asymptotic behaviour of a relativistic (parallel) shock wave significantly modified by the diffusive acceleration of cosmic-rays is investigated by means of relativistic hydrodynamical equations for both the cosmic-rays and thermal gas. The form of the shock structure equation and the dispersion relation for both long and short wavelength waves in the system are obtained. The dependence of the shock acceleration efficiency on the upstream fluid spped, long wavelength Mach number and the ratio N = P sub co/cP sub co+P sub go)(Psub co and P sub go are the upstream cosmic-ray and thermal gas pressures respectively) are studied.

Webb, G. M.↗
NASA NTRS1986

Simulating a small turboshaft engine in real-time multiprocessor simulator (RTMPS) environment

A Real-Time Multiprocessor Simulator (RTMPS) has been developed at NASA Lewis Research Center. The RTMPS uses parallel microprocessors to achieve computing speeds needed for real-time engine simulation. This report describes the use of the RTMPS system to simulate a small turboshaft engine. The process of programming the engine equations and distributing them over one, two, and four processors is discussed. Steady-state and transient results from the RTMPS simulation are compared with results from a main-frame-based simulation. Processor execution times and the associated execution time savings for the two and four processor cases are presented using actual data obtained from the RTMPS system. Included is a discussion of why the minimum achievable calculation time for the turboshaft engine model was attained using four processors. Finally, future enhancements to the RTMPS system are discussed including the development of a generalized partitioning algorithm to automatically distribute the system equations among the processors in optimum fashion.

Milner, E. J.↗
NASA NTRS1986

Systolic VLSI for Kalman filters

A novel two-dimensional parallel computing method for real-time Kalman filtering is presented. The mathematical formulation of a Kalman filter algorithm is rearranged to be the type of Faddeev algorithm for generalizing signal processing. The data flow mapping from the Faddeev algorithm to a two-dimensional concurrent computing structure is developed. The architecture of the resulting processor cells is regular, simple, expandable, and therefore naturally suitable for VLSI chip implementation. The computing methodology and the two-dimensional systolic arrays are useful for Kalman filter applications as well as other matrix/vector based algebraic computations.

Yeh, H.-G.↗
NASA NTRS1987

Galerkin/Runge-Kutta discretizations for semilinear parabolic equations

A new class of fully discrete Galerkin/Runge-Kutta methods is constructed and analyzed for semilinear parabolic initial boundary value problems. Unlike any classical counterpart, this class offers arbitrarily high, optimal order convergence. In support of this claim, error estimates are proved, and computational results are presented. Furthermore, it is noted that special Runge-Kutta methods allow computations to be performed in parallel so that the final execution time can be reduced to that of a low order method.

Keeling, Stephen L.↗
NASA NTRS1988

Elastic-plastic crack analysis using a global-local approach on a parallel computer

A global-local finite-element analysis procedure is employed to solve elastoplastic crack problems. This procedure involves a global analysis using a coarse mesh and the subsequent locally refined analysis of a number of subregions. Parallel computation is involved in the local analyses. Numerical examples are performed on a MIMD parallel computer to demonstrate the time-saving capability of the proposed procedure.

Sun, C. T.↗
NASA NTRS1989

Stability and implementation of partitioned CSI solution procedures

A partitioned procedure developed for the efficient solution of control-structure interaction (CSI) problems is presented with emphasis on its computational stability, implementation aspects, and accuracy characteristics. The partitioned CSI procedure proposed here can facilitate the use of large-scale structural analysis for control-structure interaction problems. It is anticipated that real-time CSI simulations will become routine if adequate advances are made in the construction of reduced-order observers and, for some time variant problems, if substantially faster parallel solution procedures for the Riccati equations become available.

Park, K. C.↗
NASA NTRS1989

Case studies in serial and parallel simulation

The design of a ground combat simulation in a time-driven and in an event-driven style is discussed. The differences between time-driven and event-driven simulation are illustrated, and performance results for the two systems executing both serially and in parallel are presented. It is noted that the event-driven style produces a more efficient system both serially and in parallel, primarily because it minimizes the number of messages produced and thereby reduces the amount of computation.

Wieland, Frederick↗
NASA NTRS1990

A block-based algorithm for the solution of compressible flows in rotor-stator combinations

A block-based solution algorithm is developed for the solution of compressible flows in rotor-stator combinations. The method allows concurrent solution of multiple solution blocks in parallel machines. It also allows a time averaged interaction at the stator-rotor interfaces. Numerical results are presented to illustrate the performance of the algorithm. The effect of the interaction between the stator and rotor is evaluated.

Akay, H. U.↗
NASA NTRS1993

Three-Dimensional Magnetic-Bubble Memory System

Proposed magnetic-bubble memory system includes stack of two-dimensional memory modules. Design enables overall storage density of system to be greater than prior magnetic-bubble memories. Provides nonvolatile storage, with readout access times in millisecond range. Has partly parallel input/output configuration supporting high-performance computing. Also relatively invulnerable to damage by ionizing radiation. Binary data, as represented by direction of magnetization of magnetic bubbles, reads out via Faraday effect.

Katti, Romney R.↗
NASA NTRS1992

Scientific computing in the 1990ies: An astronomical perspective

The compute performance, storage capability, degree of networking, and usability of modern computer hardware have enormously progressed in the past decade. These hardware advances are not paralleled by an equivalent increase in software productivity. Among astronomers the need is gradually perceived to discuss questions such as whether we are prepared to meet the pending challenge of vector and massively parallel computers. Therefore, a moderated, time-limited and access-restricted, wide-area network discussion forum is proposed for having a first, broad-minded go at the question of whether our current software efforts are heading in the right direction. The main topics, goals, means, and form of the proposed discussion process are presented.

Adorf, Hans-Martin↗
NASA NTRS1996

From Competence to Efficiency: A Tale of GA Progress

Genetic algorithms (GAs) - search procedures based on the mechanics of natural selection and genetics - have grown in popularity for the solution of difficult optimization problems. Concomitant with this growth has been a rising cacaphony of complaint asserting that too much time must be spent by the GA practitioner diddling with codes, operators, and GA parameters; and even then these GA cassandras continue, and the user is still unsure that the effort will meet with success. At the same time, there has been a rising interest in GA theory by a growing community - a theorocracy - of mathematicians and theoretical computer scientists, and these individuals have turned their efforts increasingly toward elegant abstract theorems and proofs that seem to the practitioner to offer little in the way of answers for GA design or practice. What both groups seem to have missed is the largely unheralded 1993 assembly of integrated, applicable theory and its experimental confirmation. This theory has done two key things. First, it has predicted that simple GAs are severely limited in the difficulty of problems they can solve, and these limitations have been confirmed experimentally. Second, it has shown the path to circumventing these limitations in nontraditional GA designs such as the fast messy GA. This talk surveys the history, methodology, and accomplishment of the 1993 applicable theory revolution. After arguing that these accomplishments open the door to universal GA competence, the paper shifts the discussion to the possibility of universal GA efficiency in the utilization of time and real estate through effective parallelization, temporal decomposition, hybridization, and relaxed function evaluation. The presentation concludes by suggesting that these research directions are quickly taking us to a golden age of adaptation.

Goldberg, David E.↗
NASA NTRS1997

Miniature Comet Ice and Dust Experiment (Mini-CIDEX)

This document reports the extent of the progress attained by Lockheed Martin Astronautics (LMA) in the development of equipment designed for the miniature Comet Ice and Dust EXperiment (mini-CIDEX) on NASA contract No. NAS2-14042 from the Ames Research Center (ARC). This report is in two parts. The first part summarizes progress in chronological order. The contents of the first part have been extracted from the monthly reports submitted by LMA to ARC over the duration of the program. The second part is a summary of the designs that were extracted from the mini-CIDEX contract designs and implemented into mission studies performed under different funding but in parallel to the mini- CIDEX contract time period. These second part activities were not performed under contract No. NAS2-14042; however, they are included in this report to show how it was intended that the mini-CIDEX be used on actual mission spacecraft.

Hayden, Jeffrey L.↗
NASA NTRS1998

NASA Image eXchange (NIX)

This paper discusses the technical aspects of and the project background for the NASA Image exchange (NIX). NIX, which provides a single entry point to search selected image databases at the NASA Centers, is a meta-search engine (i.e., a search engine that communicates with other search engines). It uses these distributed digital image databases to access photographs, animations, and their associated descriptive information (meta-data). NIX is available for use at the following URL: http://nix.nasa.gov./NIX, which was sponsored by NASAs Scientific and Technical Information (STI) Program, currently serves images from seven NASA Centers. Plans are under way to link image databases from three additional NASA Centers. images and their associated meta-data, which are accessible by NIX, reside at the originating Centers, and NIX utilizes a virtual central site that communicates with each of these sites. Incorporated into the virtual central site are several protocols to support searches from a diverse collection of database engines. The searches are performed in parallel to ensure optimization of response times. To augment the search capability, browse functionality with pre-defined categories has been built into NIX, thereby ensuring dissemination of 'best-of-breed' imagery. As a final recourse, NIX offers access to a help desk via an on-line form to help locate images and information either within the scope of NIX or from available external sources.

vonOfenheim. William H. C.↗