Search NASA⌕ Search

SEARCH · Search NASA

Results for “MP-1”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Applications of the massively parallel machine, the MasPar MP-1, to Earth sciences

The computational workload of upcoming NASA science missions, especially the ground data processing for the Earth Observing System, is projected to be quite large (in the 50 to 100 gigaFLOPS range) and corespondingly very expensive to perform using conventional supercomputer systems. High performance, general purpose massively parallel computer systems such as the MasPar MP-1 are being investigated by NASA as a more cost effective alternative. Massively parallel systems are targeted for accelerated development and maturation by NASA's upcoming five-year High Performance Computing and Communications Program. A summary of the broad range of applications currently running on the MP-1 at NASA/Goddard are presented in this paper along with descriptions of the parallel algorithmic techniques employed in five applications that have bearing on Earth sciences.

Fischer, James R.↗
NASA NTRS1991

Maximum entropy method applied to deblurring images on a MasPar MP-1 computer

A statistical inference method based on the principle of maximum entropy is developed for the purpose of enhancing and restoring satellite images. The proposed maximum entropy image restoration method is shown to overcome the difficulties associated with image restoration and provide the smoothest and most appropriate solution consistent with the measured data. An implementation of the method on the MP-1 computer is described, and results of tests on simulated data are presented.

Bonavito, N. L.↗
DOE OSTI2024

Simultaneous Thermal Analysis of Anion and Cation Exchange Resins

The decomposition reactions of one anion exchange resin (Bio-Rad AG MP-1) and one cerium-loaded cation exchange resin (DOWEX 50W-X8), both in nitrate form, were analyzed using simultaneous thermal analysis methods. Thermogravimetric analysis, dynamic scanning calorimetry, and evolved gas analysis were deployed in combination to probe the temperature profiles, reaction enthalpies, and off-gases from these resins under process-relevant temperature ranges. Analysis indicates that both resins undergo three clear phases during heating. The first is a dehydration step with prominent off-gassing of water, the second is a decomposition step with evolution of several gaseous species, and lastly is a combustion step with a large release of CO 2 . The temperature at which combustion ends varies slightly between AG MP-1 and DOWEX 50W: combustion completed at ~690°C and ~810°C, respectively. For the DOWEX cation resin, the combustion reaction showed greater sensitivity to the availability of oxygen under the test conditions. Both resins displayed broad exotherms during the combustion step of the decomposition, but the DOWEX cation resin demonstrated a 4.5 times higher specific enthalpy than that of the AG MP-1.

36 MATERIALS SCIENCE↗
NASA NTRS1994

A heterogeneous computing environment for simulating astrophysical fluid flows

In the Concurrent Computing Laboratory in the Department of Physics and Astronomy at Louisiana State University we have constructed a heterogeneous computing environment that permits us to routinely simulate complicated three-dimensional fluid flows and to readily visualize the results of each simulation via three-dimensional animation sequences. An 8192-node MasPar MP-1 computer with 0.5 GBytes of RAM provides 250 MFlops of execution speed for our fluid flow simulations. Utilizing the parallel virtual machine (PVM) language, at periodic intervals data is automatically transferred from the MP-1 to a cluster of workstations where individual three-dimensional images are rendered for inclusion in a single animation sequence. Work is underway to replace executions on the MP-1 with simulations performed on the 512-node CM-5 at NCSA and to simultaneously gain access to more potent volume rendering workstations.

Cazes, J.↗
DOE OSTI2024

Interfacial Analysis of Blister Formation in U-10Mo Mini-Plates

A thorough investigation of potential failure mechanisms builds confidence in the performance of monolithic U-10wt%Mo (U-10Mo) fuel plates. The lowenriched uranium (LEU) fuel system is currently undergoing qualification as a high U-density fuel that can be used to convert United States high-performance research reactors from high-enriched uranium (HEU) operation. This will require establishing fuel operational limits such that fission products and a coolable geometry are retained, even during off-normal reactor operation conditions [1]. Such off-normal conditions can subject the fuel plates to temperatures where the internal pressure of precipitated fission gasses result in a permanent deformed, raised area of the cladding, referred to as a blister. These blisters can reduce the local coolability of a fuel plate and can even close coolant channels of a fuel assembly, so blistered plates are considered failed regardless of whether the fuel is truly breached. Historically, a marginto- failure is established through out-of-pile blister threshold testing of irradiated fuel plates. This is accomplished by incrementally heating irradiated fuel plates until blisters are observed. This reveals the temperature threshold that would have resulted in a blister if a plate experienced them at those irradiation conditions [2]. While the blister testing itself reveals the temperatures at which the cladding mechanical integrity was exceeded, a more thorough investigation of the interface evolution in proximity to formed blisters may reveal mechanisms as to the blister formation and retention of fission gases. Previous studies have explored potential underlying mechanisms in historical plates that may have been close to blistering [3]; however, this work is the first exploration of blister tested irradiated plates, fabricated by a commercial vendor—another requirement for qualification of the fuel system [1]. The Mini-plate 1 (MP-1) experiment was the first in a series of irradiation and post-irradiation examination (PIE) campaigns to qualify the U-10Mo monolithic fuel system. It consisted of commercially fabricated 25.4×101.5 mm Al-clad mini-plates with a monolithic U-10Mo foil coated in a Zr diffusion barrier. The primary MP-1 PIE campaign was previously completed. Among the suit of examinations was a blister testing campaign, where plates were incrementally annealed in 25°C increments until blisters were observed or a maximum temperature of 550°C was reached [4]. The previously blistered plates from this campaign were revisited in this work.

25228↗
DOE OSTI2024

Design of Mini-Plate-1 Irradiation Test for Qualification of High-Density, Low-Enriched U-10Mo Monolithic Fuel

The United States High Performance Research Reactor project is tasked with fuel development and qualification leading to conversion of higher power research and test reactors in the US from high-enriched uranium (HEU) to low-enriched uranium (LEU) fuels. Here, this manuscript identifies the functional and operational design requirements of the first miniature test plate (mini-plate [MP]) irradiation campaign (MP-1) of commercially fabricated LEU U-10Mo monolithic plate-type fuel and is the precursor to a large parametric mini-plate test (MP-2) aimed at producing the data to support regulatory qualification of the LEU U-10Mo monolithic fuel. The manuscript (1) provides a general description of the selected U-10Mo LEU fuel and (2) defines the overall experiment design and functional requirements to accomplish the specific test objective of MP-1, which is to confirm that the commercially manufactured LEU U-10Mo monolithic fuel meets the established requirements of geometric stability, mechanical integrity and stable and predictable behavior. The fuel testing parameters are established by the need to bound performance behavior within the operational envelope of the reactors being converted.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS1994

An implementation of a tree code on a SIMD, parallel computer

We describe a fast tree algorithm for gravitational N-body simulation on SIMD parallel computers. The tree construction uses fast, parallel sorts. The sorted lists are recursively divided along their x, y and z coordinates. This data structure is a completely balanced tree (i.e., each particle is paired with exactly one other particle) and maintains good spatial locality. An implementation of this tree-building algorithm on a 16k processor Maspar MP-1 performs well and constitutes only a small fraction (approximately 15%) of the entire cycle of finding the accelerations. Each node in the tree is treated as a monopole. The tree search and the summation of accelerations also perform well. During the tree search, node data that is needed from another processor is simply fetched. Roughly 55% of the tree search time is spent in communications between processors. We apply the code to two problems of astrophysical interest. The first is a simulation of the close passage of two gravitationally, interacting, disk galaxies using 65,636 particles. We also simulate the formation of structure in an expanding, model universe using 1,048,576 particles. Our code attains speeds comparable to one head of a Cray Y-MP, so single instruction, multiple data (SIMD) type computers can be used for these simulations. The cost/performance ratio for SIMD machines like the Maspar MP-1 make them an extremely attractive alternative to either vector processors or large multiple instruction, multiple data (MIMD) type parallel computers. With further optimizations (e.g., more careful load balancing), speeds in excess of today's vector processing computers should be possible.

Olson, Kevin M.↗
NASA NTRS1991

Parallel Processing System

In order to process very high resolution image data from spacecraft sensors, Goddard Space Flight Center commissioned the development of a Massively Parallel Processor (MPP) based upon simultaneous processing of image picture elements (pixels) rather than serial processing. It resulted in a considerable increase in computational speed. MasPar Computer Corporation's MasPar MP-1 incorporates this technology, allowing users to attack a variety of computationally-intensive problems. The MP-1 is no longer manufactured but has been replaced by the MP-2, a more advanced model.

Source record↗
NASA NTRS1991

Massively parallel algorithms for trace-driven cache simulations

Trace driven cache simulation is central to computer design. A trace is a very long sequence of reference lines from main memory. At the t(exp th) instant, reference x sub t is hashed into a set of cache locations, the contents of which are then compared with x sub t. If at the t sup th instant x sub t is not present in the cache, then it is said to be a miss, and is loaded into the cache set, possibly forcing the replacement of some other memory line, and making x sub t present for the (t+1) sup st instant. The problem of parallel simulation of a subtrace of N references directed to a C line cache set is considered, with the aim of determining which references are misses and related statistics. A simulation method is presented for the Least Recently Used (LRU) policy, which regradless of the set size C runs in time O(log N) using N processors on the exclusive read, exclusive write (EREW) parallel model. A simpler LRU simulation algorithm is given that runs in O(C log N) time using N/log N processors. Timings are presented of the second algorithm's implementation on the MasPar MP-1, a machine with 16384 processors. A broad class of reference based line replacement policies are considered, which includes LRU as well as the Least Frequently Used and Random replacement policies. A simulation method is presented for any such policy that on any trace of length N directed to a C line set runs in the O(C log N) time with high probability using N processors on the EREW model. The algorithms are simple, have very little space overhead, and are well suited for SIMD implementation.

Nicol, David M.↗
NASA NTRS1992

Design of neural networks for classification of remotely sensed imagery

Classification accuracies of a backpropagation neural network are discussed and compared with a maximum likelihood classifier (MLC) with multivariate normal class models. We have found that, because of its nonparametric nature, the neural network outperforms the MLC in this area. In addition, we discuss techniques for constructing optimal neural nets on parallel hardware like the MasPar MP-1 currently at GSFC. Other important discussions are centered around training and classification times of the two methods, and sensitivity to the training data. Finally, we discuss future work in the area of classification and neural nets.

Chettri, Samir R.↗
NASA NTRS1993

Neural networks for atmospheric retrievals

We use neural networks to perform retrievals of temperature and water fractions from simulated clear air radiances for the Atmospheric Infrared Sounder (AIRS). Neural networks allow us to make effective use of the large AIRS channel set, and give good performance with noisy input. We retrieve surface temperature, air temperature at 64 distinct pressure levels, and water fractions at 50 distinct pressure levels. Using 728 temperature and surface sensitive channels, the RMS error for temperature retrievals with 0.2K input noise is 1.2K. Using 586 water and temperature sensitive channels, the mean error with 0.2K input noise is 16 percent. Our implementation of backpropagation training for neural networks on the 16,000-processor MasPar MP-1 runs at a rate of 90 million weight updates per second, and allows us to train large networks in a reasonable amount of time. Once trained, the network can be used to perform retrievals quickly on a workstation of moderate power.

Motteler, Howard E.↗
NASA NTRS1993

A simple parallel prefix algorithm for compact finite-difference schemes

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is highly efficient on parallel machines. It consists of a prefix communication pattern and AXPY operations. Both the computation and the communication can be truncated without degrading the accuracy when the system is diagonally dominant. A formal accuracy study was conducted to provide a simple truncation formula. Experimental results were measured on a MasPar MP-1 SIMD machine and on a Cray 2 vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for the compact scheme on high-performance computers.

Sun, Xian-He↗
NASA NTRS1993

Efficient, massively parallel eigenvalue computation

In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. An effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD computers, the Maspar MP-1 and MP-2 systems, is described. Results of numerical tests and timings are also presented.

Huo, Yan↗
NASA NTRS1994

Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, conservative methods are used; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15 times over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, new methods were developed that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50 percent and the speedup over the optimized serial code to about 120 times.

Greenberg, Albert G.↗
NASA NTRS1994

An efficient three-dimensional Poisson solver for SIMD high-performance-computing architectures

We present an algorithm that solves the three-dimensional Poisson equation on a cylindrical grid. The technique uses a finite-difference scheme with operator splitting. This splitting maps the banded structure of the operator matrix into a two-dimensional set of tridiagonal matrices, which are then solved in parallel. Our algorithm couples FFT techniques with the well-known ADI (Alternating Direction Implicit) method for solving Elliptic PDE's, and the implementation is extremely well suited for a massively parallel environment like the SIMD architecture of the MasPar MP-1. Due to the highly recursive nature of our problem, we believe that our method is highly efficient, as it avoids excessive interprocessor communication.

Cohl, H.↗
NASA NTRS1994

Three-dimensional radiative transfer calculations on an SIMD machine applied to accretion disks

We have developed a tool to solve the radiative transfer equation for a three-dimensional astrophysical object on the SIMD computer MasPar MP-1. With this tool we can rapidly calculate the image of such an object as seen from an arbitrary direction and at an arbitrary wavelength. Such images and spectra can then be used to directly compare observations with the model. This tool can be applied to many different areas in astrophysics, e.g., HI disks of galaxies and polarized radiative transfer of accretion columns onto white dwarfs. Here we use this tool to calculate the image and spectrum of a simple model of an accretion disk.

Vath, H.↗
NASA NTRS1994

Three-dimensional radiative transfer on a massively parallel computer

We perform 3D radiative transfer calculations in non-local thermodynamic equilibrium (NLTE) in the simple two-level atom approximation on the Mas-Par MP-1, which contains 8192 processors and is a single instruction multiple data (SIMD) machine, an example of the new generation of massively parallel computers. On such a machine, all processors execute the same command at a given time, but on different data. To make radiative transfer calculations efficient, we must re-consider the numerical methods and storage of data. To solve the transfer equation, we adopt the short characteristic method and examine different acceleration methods to obtain the source function. We use the ALI method and test local and non-local operators. Furthermore, we compare the Ng and the orthomin methods of acceleration. We also investigate the use of multi-grid methods to get fast solutions for the NLTE case. In order to test these numerical methods, we apply them to two problems with and without periodic boundary conditions.

Vath, H. M.↗
NASA NTRS1994

Data-parallel lower-upper relaxation method for reacting flows

The implicit lower-upper symmetric Gauss-Seidel (LU-SGS) method of Yoon and Jameson is modified for use on massively parallel computers. The method has been implemented on the Thinking Machines CM-5 and the MasPar MP-1 and MP-2, where large percentages of the theoretical peak floating point performance are obtained. It is shown that the new data-parallel LU relaxation method has better convergence properties than the original method for two different inviscid compressible flow simulations. The convergence is also improved for five-species reacting air computations. The performance of the method on various partitions of the CM-5 and on the MasPar computers is discussed. The new method shows promise for the efficient simulation of very large perfect gas and reacting flows.

Candler, Graham V.↗