Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel codes”

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 487 records · Page 27

Report on Preliminary Detailed Experimental Plan for Neutron Irradiation of A709 at ATR and HFIR

Advanced nuclear power technologies will use higher temperatures as a means to extract energy at a higher efficiency than current plants and therefore put a larger demand on the structural materials. Improved performance of structural materials could enable greater safety margins, longer plant lifetimes, and reduce maintenance costs. Alloy 709 is championed as the next generation of austenitic alloys for advanced nuclear reactors. In parallel to the ASME code case pursued, the AMMT program is initiating a neutron irradiation campaign to provide first-of-a-kind engineering data to establish operational design parameters and how the mechanical response is modified by environmental factors. This document refines the AMMT neutron irradiation campaign to a 4 year program to support the generation of creep knockdown factors for Alloy 709 and welded Alloy 709. The campaign is divided among two national laboratories, Oak Ridge National Laboratory and Idaho National Laboratory, to use the strengths of each laboratory. Through a cooperative plan, time-independent properties and time-dependent properties will be obtained across a large temperature window, nominally 300°C to 800°C, damage levels up to 10 dpa, and with and without the impacts of transmutation produced helium.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Extended Physics-Informed Neural Networks (XPINNs): A Generalized Space-Time Domain Decomposition Based Deep Learning Framework for Nonlinear Partial Differential Equations

Here we propose a generalized space-time domain decomposition approach for the physics-informed neural networks (PINNs) to solve nonlinear partial differential equations (PDEs) on arbitrary complex-geometry domains. The proposed framework, named eXtended PINNs ( X P I N N s ), further pushes the boundaries of both PINNs as well as conservative PINNs (cPINNs), which is a recently proposed domain decomposition approach in the PINN framework tailored to conservation laws. Compared to PINN, the XPINN method has large representation and parallelization capacity due to the inherent property of deployment of multiple neural networks in the smaller subdomains. Unlike cPINN, XPINN can be extended to any type of PDEs. Moreover, the domain can be decomposed in any arbitrary way (in space and time), which is not possible in cPINN. Thus, XPINN offers both space and time parallelization, thereby reducing the training cost more effectively. In each subdomain, a separate neural network is employed with optimally selected hyperparameters, e.g., depth/width of the network, number and location of residual points, activation function, optimization method, etc. A deep network can be employed in a subdomain with complex solution, whereas a shallow neural network can be used in a subdomain with relatively simple and smooth solutions. We demonstrate the versatility of XPINN by solving both forward and inverse PDE problems, ranging from one-dimensional to three-dimensional problems, from time-dependent to time-independent problems, and from continuous to discontinuous problems, which clearly shows that the XPINN method is promising in many practical problems. The proposed XPINN method is the generalization of PINN and cPINN methods, both in terms of applicability as well as domain decomposition approach, which efficiently lends itself to parallelized computation. The XPINN code is available on h t t p s : / / g i t h u b . c o m / A m e y a J a g t a p / X P I N N s .

97 MATHEMATICS AND COMPUTING↗

Study of helium emissions from active solar regions

A theoretical study is made of the visible and UV line radiation of He I atoms and He II ions from a plane-parallel model flare layer. Codes were developed for the solution of the statistically steady state equation for a 30 level He I - II - III model, and the line and continuum transport equations. These codes are described and documented in the report along with sample solutions. Optical depths and some line intensities are presented for a 1000 km thick layer. Solutions of the steady state equations are presented for electron temperatures 10,000 to 50,000 K and electron densities 10 to the 10th power to 10 to the 14th power/cu cm.

Kulander, J. L.↗

Methodology of modeling and measuring computer architectures for plasma simulations

A brief introduction to plasma simulation using computers and the difficulties on currently available computers is given. Through the use of an analyzing and measuring methodology - SARA, the control flow and data flow of a particle simulation model REM2-1/2D are exemplified. After recursive refinements the total execution time may be greatly shortened and a fully parallel data flow can be obtained. From this data flow, a matched computer architecture or organization could be configured to achieve the computation bound of an application problem. A sequential type simulation model, an array/pipeline type simulation model, and a fully parallel simulation model of a code REM2-1/2D are proposed and analyzed. This methodology can be applied to other application problems which have implicitly parallel nature.

Wang, L. P. T.↗

Converting Time Signals From BCD to IRIG-B

Coded representation of time signals--day, hour, minute, second--is changed from binary-coded decimal (BCD) to IRIG standard time-code format B by circuit that uses nine integrated circuits. Input to code-converter circuit is parallel BCD pulses on bus output is serial pulses of IRIG-B on single line.

Houston, J. B.↗

Increasing processor utilization during parallel computation rundown

Some parallel processing environments provide for asynchronous execution and completion of general purpose parallel computations from a single computational phase. When all the computations from such a phase are complete, a new parallel computational phase is begun. Depending upon the granularity of the parallel computations to be performed, there may be a shortage of available work as a particular computational phase draws to a close (computational rundown). This can result in the waste of computing resources and the delay of the overall problem. In many practical instances, strict sequential ordering of phases of parallel computation is not totally required. In such cases, the beginning of one phase can be correctly computed before the end of a previous phase is completed. This allows additional work to be generated somewhat earlier to keep computing resources busy during each computational rundown. The conditions under which this can occur are identified and the frequency of occurrence of such overlapping in an actual parallel Navier-Stokes code is reported. A language construct is suggested and possible control strategies for the management of such computational phase overlapping are discussed.

Jones, W. H.↗

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.↗

Parallel software support for computational structural mechanics

The application of the parallel programming methodology known as the Force was conducted. Two application issues were addressed. The first involves the efficiency of the implementation and its completeness in terms of satisfying the needs of other researchers implementing parallel algorithms. Support for, and interaction with, other Computational Structural Mechanics (CSM) researchers using the Force was the main issue, but some independent investigation of the Barrier construct, which is extremely important to overall performance, was also undertaken. Another efficiency issue which was addressed was that of relaxing the strong synchronization condition imposed on the self-scheduled parallel DO loop. The Force was extended by the addition of logical conditions to the cases of a parallel case construct and by the inclusion of a self-scheduled version of this construct. The second issue involved applying the Force to the parallelization of finite element codes such as those found in the NICE/SPAR testbed system. One of the more difficult problems encountered is the determination of what information in COMMON blocks is actually used outside of a subroutine and when a subroutine uses a COMMON block merely as scratch storage for internal temporary results.

Jordan, Harry F.↗

Increasing processor utilization during parallel computation rundown

Some parallel processing environments provide for asynchronous execution and completion of general purpose parallel computations from a single computational phase. When all the computations from such a phase are complete, a new parallel computational phase is begun. Depending upon the granularity of the parallel computations to be performed, there may be a shortage of available work as a particular computational phase draws to a close (computational rundown). This can result in the waste of computing resources and the delay of the overall problem. In many practical instances, strict sequential ordering of phases of parallel computation is not totally required. In such cases, the beginning of one phase can be correctly computed before the end of a previous phase is completed. This allows additional work to be generated somewhat earlier to keep computing resources busy during each computational rundown. The conditions under which this can occur are identified and the frequency of occurrence of such overlapping in an actual parallel Navier-Stokes code is reported. A language construct is suggested and possible control strategies for the management of such computational phase overlapping are discsused.

Jones, William H.↗

Analysis and simulations of a troposphere-stratosphere gravity wave model. I

An analytical model is presented that accommodates nonhydrostatic shearing stratified flow over an obstacle, and that can be modified to include a superposed stratosphere with constant wind and higher stability. A simulation code is used in parallel with the analytic calculations to demonstrate a methodology for determining the wavelength and magnitude of gravity wave energy reflected, and that transmitted, by the tropopause.

Wurtele, M. G.↗

Voyager image data compression and block encoding

Telemetry enhancement techniques used by Voyager-2 to reduce telemetry transmission rates by over 50 percent compared to those used at Saturn, with negligible loss in information return, are described. The use of the Reed-Solomon encoder is discussed, and the principles and implementation of an Image Data Compressor algorithm for noiseless coding techniques are addressed. Parallel operation of the redundant Flight Data Subsystem processors is discussed.

Urban, Michael G.↗

Programming Probabilistic Structural Analysis for Parallel Processing Computer

The ultimate goal of this research program is to make Probabilistic Structural Analysis (PSA) computationally efficient and hence practical for the design environment by achieving large scale parallelism. The paper identifies the multiple levels of parallelism in PSA, identifies methodologies for exploiting this parallelism, describes the development of a parallel stochastic finite element code, and presents results of two example applications. It is demonstrated that speeds within five percent of those theoretically possible can be achieved. A special-purpose numerical technique, the stochastic preconditioned conjugate gradient method, is also presented and demonstrated to be extremely efficient for certain classes of PSA problems.

Sues, Robert H.↗

Seal development activities at Allison Turbine Division

Brush seals are being evaluated for potential near and far term gas turbine engine applications. Development is in the form of rig component testing and engine testing. Allison has tested an engine with 20 individual brush seal positions. These seals were located throughout the engine. The emphasis of the current work is on obtaining long term performance data for brush seals. Very little of this data is available. Allison is presently developing film riding face seal technology to support future gas turbine engine applications. A face seal with an approximate 7 inch diameter was successfully tested to 1000 F, 100 psid, and 650 ft/sec. Seal leakage remained below 1 scfm throughout the duration of the test. A model for the compressible gas film was developed which separates the model for the compressible gas film was developed which separates the primary seal rings during operation. This model is based on the traditional Reynold's approach which is customarily applied to lubrication type problems. Because of the difficulty of experimentally verifying the program predictions, a commercial Navier-Stokes code was used in parallel. By comparing predictions for similar cases, it is expected that the limitations of the Reynold's model can be assessed as it applies to this particular seal.

Munson, John↗

A portable MPI-based parallel vector template library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C++ by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of C or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

A Portable MPI-Based Parallel Vector Template Library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C + + by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of c or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

Multistage Simulations of the GE90 Turbine

The average passage approach has been used to analyze three multistage configurations of the GE90 turbine. These are a high pressure turbine rig, a low pressure turbine rig and a full turbine configuration comprising 18 blade rows of the GE90 engine at takeoff conditions. Cooling flows in the high pressure turbine have been simulated using source terms. This is the first time a dual-spool cooled turbine has been analyzed in 3D using a multistage approach. There is good agreement between the simulations and experimental results. Multistage and component interaction effects are also presented. The parallel efficiency of the code is excellent at 87.3% using 121 processors on an SGI Origin for the 18 blade row configuration. The accuracy and efficiency of the calculation now allow it to be effectively used in a design environment so that multistage effects can be accounted for in turbine design.

Turner, Mark G.↗

Implementation of an Eta Belt Domain on Parallel Systems

We extend the Eta weather model from a regional domain into a belt domain that does not require meridional boundary conditions. We describe how the extension is achieved and the parallel implementation of the code on the Cray T3E and the SGI Origin 2000. We validate the forecast results on the two platforms and examine how the removal of the meridional boundary conditions affects these forecasts. In addition, using several domains of different sizes and resolutions, we present the scaling performance of the code on both systems.

Kouatchou, Jules↗

Charon Toolkit for Parallel, Implicit Structured-Grid Computations: Functional Design

Charon is a software toolkit that enables engineers to develop high-performing message-passing programs in a convenient and piecemeal fashion. Emphasis is on rapid program development and prototyping. In this report a detailed description of the functional design of the toolkit is presented. It is illustrated by the stepwise parallelization of two representative code examples.

VanderWijngaart, Rob F.↗