Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “out of memory”

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 1,207 records · Page 67

Differential memory in the trilinear model magnetotail

The previously proposed concept of 'differential memory' is quantitatively demonstrated using an idealized analytical model of particle dynamics in the magnetotail geometry. In this model (the 'trilinear' tail model) the magnetotail is divided into three regions. The particle orbits are solved exactly in each region, thus reducing the orbit integration to an analytical mapping. It is shown that the trilinear model reproduces the essential phase space features of the earlier model (Chen and Palmadesso, 1986), possessing well-defined entry and exit regions, and stochastic, integrable (regular), and transient orbits, occupying disjoint phase space regions. Different regions have widely separated characteristic time scales corresponding to different types of particle motion. Using the analytical model, the evolution of single-particle distribution functions is calculated.

Chen, James↗

Distributed memory compiler design for sparse problems

A compiler and runtime support mechanism is described and demonstrated. The methods presented are capable of solving a wide range of sparse and unstructured problems in scientific computing. The compiler takes as input a FORTRAN 77 program enhanced with specifications for distributing data, and the compiler outputs a message passing program that runs on a distributed memory computer. The runtime support for this compiler is a library of primitives designed to efficiently support irregular patterns of distributed array accesses and irregular distributed array partitions. A variety of Intel iPSC/860 performance results obtained through the use of this compiler are presented.

Wu, Janet↗

Fuzzy associative memories

Mappings between fuzzy cubes are discussed. This level of abstraction provides a surprising and fruitful alternative to the propositional and predicate-calculas reasoning techniques used in expert systems. It allows one to reason with sets instead of propositions. Discussed here are fuzzy and neural function estimators, neural vs. fuzzy representation of structured knowledge, fuzzy vector-matrix multiplication, and fuzzy associative memory (FAM) system architecture.

Kosko, Bart↗

The Cortex Transform as an image preprocessor for sparse distributed memory: An initial study

An experiment is described which was designed to evaluate the use of the Cortex Transform as an image processor for Sparse Distributed Memory (SDM). In the experiment, a set of images were injected with Gaussian noise, preprocessed with the Cortex Transform, and then encoded into bit patterns. The various spatial frequency bands of the Cortex Transform were encoded separately so that they could be evaluated based on their ability to properly cluster patterns belonging to the same class. The results of this study indicate that by simply encoding the low pass band of the Cortex Transform, a very suitable input representation for the SDM can be achieved.

Olshausen, Bruno↗

Implementation of two projection methods on a shared memory multiprocessor - DEC VAX 6240

The relative performance of two iterative schemes, based on projection techniques, is compared on a shared memory multiprocessor - VAX 6240. The CG accelerated Block-SSOR method and the CG accelerated Symmetric-Kaczmarz method are considered for the solution of large sparse nonsymmetric systems of linear equations. It is shown that the regular structure of many matrices can be exploited by the CG-accelerated Block-SSOR method to provide good speedup in a multiprocessing environment. However, the CG accelerated Symmetric-Kaczmarz method, while being a viable alternative on a scalar machine, is unable to benefit from multiprocessing.

Kamath, C.↗

Explicit time integration of finite element models on a vectorized, concurrent computer with shared memory

The implementation of a nonlinear explicit program on a vectorized, concurrent computer with shared memory is described and studied. The conflict between vectorization and concurrency is described and some guidelines are given for optimal block sizes. Several example problems are summarized to illustrate the types of speed-ups which can be achieved by reprogramming as compared to compiler optimization.

Gilbertsen, Noreen D.↗

An area model for on-chip memories and its application

An area model suitable for comparing data buffers of different organizations and arbitrary sizes is described. The area model considers the supplied bandwidth of a memory cell and includes such buffer overhead as control logic, driver logic, and tag storage. The model gave less than 10 percent error when verified against real caches and register files. It is shown that, comparing caches and register files in terms of area for the same storage capacity, caches generally occupy more area per bit than register files for small caches because the overhead dominates the cache area at these sizes. For larger caches, the smaller storage cells in the cache provide a smaller total cache area per bit than the register set. Studying cache performance (traffic ratio) as a function of area, it is shown that, for small caches, direct-mapped caches perform significantly better than four-way set-associative caches and, for caches of medium areas, both direct-mapped and set-associative caches perform better than fully associative caches.

Mulder, Johannes M.↗

Ray tracing on distributed memory parallel systems

Among the many techniques in computer graphics, ray tracing is prized because it can render realistic images, albeit at great computational expense. In this note, the performance of several approaches to ray tracing on a distributed memory parallel system is evaluated. A set of performance instrumentation tools and their associated visualization software are used to identify the underlying causes of performance differences.

Jensen, David W.↗

Studies of electron collisions with polyatomic molecules using distributed-memory parallel computers

Elastic electron scattering cross sections from 5-30 eV are reported for the molecules C2H4, C2H6, C3H8, Si2H6, and GeH4, obtained using an implementation of the Schwinger multichannel method for distributed-memory parallel computer architectures. These results, obtained within the static-exchange approximation, are in generally good agreement with the available experimental data. These calculations demonstrate the potential of highly parallel computation in the study of collisions between low-energy electrons and polyatomic gases. The computational methodology discussed is also directly applicable to the calculation of elastic cross sections at higher levels of approximation (target polarization) and of electronic excitation cross sections.

Winstead, C.↗

Stripe stabilization in vertical Bloch line memory

Long, partial rectangular grooves have been made to reside below the stripe-confinement groove on a garnet surface, in order to stabilize minor loop stripes in a vertical Bloch-line memory. The test chip contained, in addition to either 10 or 20 minor-loop grooves, 10 read/write gate grooves and a major line groove; both 10 and 20 micron groove periods were tested. As the bias field was gradually decreased, bubbles began to stripe out. These stripes were stable at bias fields in the 70-80 Oe range. When stripes escaped from the groove, the even occurred from the end which does not face a read/write gate groove.

Wu, J. C.↗

Major line operation in vertical Bloch line memory

An experimental and numerical study is conducted of the operation of a major line in a vertical Bloch-line memory that employs a partial garnet-grooving architecture and contains (1) a bubble generator; (2) a bubble-propagation track; (3) a bubble-expander for detection; and (4) a bubble annihilator. The bubble expander is a modification of the propagation track; the meandering conductor and groove width were gradually increased to stretch the bubble into a stripe. The numerical model employed encompasses the garnet-grooving effect. Agreement is obtained between exparimental and simulation results.

Wu, J. C.↗

Memory implications of the spin-value effect in soft multilayers

New multilayer permalloy materials with thin separation layers that have significantly increased M-R coefficients at room temperature have the potential for substantially increasing both the speed and density of M-R memories. An analysis in the following discussion shows that the bit density at a given performance level is related to the product of M-R response and sheet resistivity when operating at the current-density limit. With a doubling of both sheet resistivity and M-R response over existing materials, the bit area can be reduced by about a factor of 4. Alternatively, if the bit area is kept the same, signal output is increased by a factor of 4 and circuit time constants can be reduced by a factor of 16.

Pohm, A. V.↗

Demagnetization effects on forward and reverse thresholds of M-R memory elements

A refinement in the way hard-axis demagnetizing effects are treated in multilayer M-R memory elements brings experimental and calculated results into agreement for both the forward and reverse switching thresholds. In the improved model, the nonuniform rotation of the magnetization in the elements because of edge pinning is taken into account. The demagnetizing fields are treated as corrections to the hard-axis word field rather than an addition to the anisotropy constant.

Pohm, A. V.↗

Compact Translating-Head Magnetic Memories

Stationary magnetic media stores information at densities up to 6.5 Gb/cm(Sup 2). High-density memory devices combine features of advanced rotating-disk magnetic recording and playback systems with compact two-axis high-acceleration linear actuators. New devices weigh less, occupy less space, and consume less power than disk and tape recorders.

Katti, Romney R.↗

Shape-Memory Probe Grasps Small Objects

Shape-memory device removes foreign objects from ear canal, nose, or throat with little risk of damage to tissue. Thin, flexible wire inserted into cavity. Once positioned, it is made to bend into hook, tweezer, or other "remembered" grasping configuration by heating above critical temperature.

Angulo, Earl D.↗

Efficient ICCG on a shared memory multiprocessor

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

Hammond, Steven W.↗

Learning to read aloud: A neural network approach using sparse distributed memory

An attempt to solve a problem of text-to-phoneme mapping is described which does not appear amenable to solution by use of standard algorithmic procedures. Experiments based on a model of distributed processing are also described. This model (sparse distributed memory (SDM)) can be used in an iterative supervised learning mode to solve the problem. Additional improvements aimed at obtaining better performance are suggested.

Joglekar, Umesh Dwarkanath↗

Some methods of encoding simple visual images for use with a sparse distributed memory, with applications to character recognition

To study the problems of encoding visual images for use with a Sparse Distributed Memory (SDM), I consider a specific class of images- those that consist of several pieces, each of which is a line segment or an arc of a circle. This class includes line drawings of characters such as letters of the alphabet. I give a method of representing a segment of an arc by five numbers in a continuous way; that is, similar arcs have similar representations. I also give methods for encoding these numbers as bit strings in an approximately continuous way. The set of possible segments and arcs may be viewed as a five-dimensional manifold M, whose structure is like a Mobious strip. An image, considered to be an unordered set of segments and arcs, is therefore represented by a set of points in M - one for each piece. I then discuss the problem of constructing a preprocessor to find the segments and arcs in these images, although a preprocessor has not been developed. I also describe a possible extension of the representation.

Jaeckel, Louis A.↗