Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “memory effects”

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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Stacked-Gate FET's For Analog Memory Elements

Three-terminal, double-stacked-gate field-effect transistor (FET), developed as analog memory element. Particularly suited for use as synapse with variable connection strength in electronic neural network. Provides programmable, nonvolatile resistive connection, somewhat in manner of porous-gate FET described in "Porous-Floating-Gate Field-Effect Transistor" (NPO-17532). Resembles commercial erasable programmable read-only memory (EPROM) device, except for thickness of layers of silicon dioxide electrically isolating gates. Either p-channel or n-channel device.

Thakoor, Anilkumar P.↗
NASA NTRS2019

Explicit IMF B(sub y)-Effect Maximizes at Subauroral Latitudes (Dedicated to the Memory of Eigil Friis-Christensen)

The most important parameter in the coupling between solar wind and geomagnetic activity is the B(sub z)‐component of the interplanetary magnetic field (IMF). However, recent studies have shown that IMF B(sub y) is an additional, independent driver of geomagnetic activity. We use here local geomagnetic indices from a large network of magnetic stations to study how IMF B(sub y) affects geomagnetic activity at different latitudes for all solar wind and, separately, during coronal mass ejections. We show that geomagnetic activity, for all solar wind, is 20% stronger for B(sub y) > 0 than for B(sub y) < 0 at subauroral latitudes of about 60° corrected geomagnetic latitude. During coronal mass ejections, the B(sub y)‐effect is larger, about 40%, at slightly lower latitudes of about 57° (corrected geomagnetic) latitude. These results highlight the importance of the IMF B(sub y)‐component for space weather at different latitudes and must be taken into account in space weather modeling

Holappa, L.↗
DOE OSTI2020

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

An Ultrathin Single Crystalline Relaxor Ferroelectric Integrated on a High Mobility Semiconductor

The epitaxial growth of multifunctional oxides on semiconductors has opened a pathway to introduce new functionalities to semiconductor device technologies. In particular, ferroelectric materials integrated on semiconductors could lead to low-power field-effect devices that can be used for logic or memory. Essential to realizing such field-effect devices is the development of ferroelectric metal-oxide-semiconductor (MOS) capacitors, in which the polarization of a ferroelectric gate is coupled to the surface potential of a semiconducting channel. Here we demonstrate that ferroelectric MOS capacitors can be realized using single crystalline SrZr x Ti 1-x O 3 (x= 0.7) that has been epitaxially grown on Ge. We find that the ferroelectric properties of SrZr x Ti 1-x O 3 are exceptionally robust, as gate layers as thin as 5 nm give rise to hysteretic capacitance-voltage characteristics that are 2 V in width. The development of ferroelectric MOS capacitors with gate thicknesses that are technologically relevant opens a pathway to realize scalable ferroelectric field-effect devices.

Moghadam, Reza M.↗
DOE OSTI2021

Total-Ionizing-Dose Effects on Long-term Data Retention Characteristics of Commercial 3-D NAND Memories

This article evaluates the data retention characteristics of irradiated multi-level cell (MLC) 3-D NAND flash memories. We irradiate the memory chips by a Co-60 gamma-ray source for up to 50 krad(Si) and then write a random data pattern on the irradiated chip to find its retention characteristics. The experimental results show that the data retention property of the irradiated chips is significantly degraded compared to the un-irradiated ones. We evaluate two independent strategies to improve the data retention characteristics of the irradiated chips. Furthermore, the first method involves high-temperature annealing of the irradiated chip while the second method suggests pre-programming the memory modules before deploying them in radiation-prone environments.

3-D NAND flash↗
DOE OSTI2017

Deep melting reveals liquid structural memory and anomalous ferromagnetism in bismuth

As an archetypal semimetal with complex and anisotropic Fermi surface and unusual electric properties (e.g., high electrical resistance, large magnetoresistance, and giant Hall effect), bismuth (Bi) has played a critical role in metal physics. In general, Bi displays diamagnetism with a high volumetric susceptibility (~10 -4 ). Here in this paper, we report unusual ferromagnetism in bulk Bi samples recovered from a molten state at pressures of 1.4–2.5 GPa and temperatures above ~1,250 K. The ferromagnetism is associated with a surprising structural memory effect in the molten state. On heating, low-temperature Bi liquid (L) transforms to a more randomly disordered high-temperature liquid (L') around 1,250 K. By cooling from above 1,250 K, certain structural characteristics of liquid L' are preserved in L. Bi clusters with characteristics of the liquid L' motifs are further preserved through solidification into the Bi-II phase across the pressure-independent melting curve, which may be responsible for the observed ferromagnetism.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Shape memory alloy engine for high efficiency low-temperature gradient thermal to electrical conversion

More than half of the energy generated worldwide is lost as unused thermal energy because of the lack of efficient methodology for harnessing the low-grade heat. In this paper, we demonstrate that shape-memory alloy can be an effective mechanism for recovering low-grade heat. Shape memory alloys exhibit thermally induced martensite to austenite phase transformation and super-elasticity (stress-induced martensitic transformation). Employing these two characteristics, we demonstrate a thermal engine for harnessing waste energy through all modes of heat transfer: convection, conduction, and radiation. In this work, we performed material and heat transfer analysis for achieving high frequency, sustainable and efficient operation of our engine. An optimized shape memory alloy engine generated 36 W per kilogram or 234 kW of electricity per cubic meter of active material. A continuous three-day operation of several SMA engines could generate 7.2 kWh of electricity when installed on a 500 m long hot pipe network. This generated power can potentially reduce the carbon footprint by 5.1 kg of CO 2 illustrating the promise of this technology for addressing climate change.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination

Post-training model compression can reduce the inference costs of deep neural networks, but uncompressed training still consumes enormous hardware resources and energy. To enable low-energy training on edge devices, it is highly desirable to directly train a compact neural network from scratch with a low memory cost. Low-rank tensor decomposition is an effective approach to reduce the memory and computing costs of large neural networks. However, directly training low-rank tensorized neural networks is a very challenging task because it is hard to determine a proper tensor rank a priori, and the tensor rank controls both model complexity and accuracy. Here, this paper presents a novel end-to-end framework for low-rank tensorized training. We first develop a Bayesian model that supports various low-rank tensor formats (e.g., CANDECOMP/PARAFAC, Tucker, tensor-train, and tensor-train matrix) and reduces neural network parameters with automatic rank determination during training. Then we develop a customized Bayesian solver to train large-scale tensorized neural networks. Our training methods shows orders-of-magnitude parameter reduction and little accuracy loss (or even better accuracy) in the experiments. On a very large deep learning recommendation system with over 4.2 ×10 9 model parameters, our method can reduce the parameter number to 1.6 ×10 5 automatically in the training process (i.e., by 2.6 ×10 4 times) while achieving almost the same accuracy. Code is available at https://github.com/colehawkins/bayesian-tensor-rank-determination.

compact neural networks↗
DOE OSTI2017

Distributed-Memory Fast Maximal Independent Set

The Maximal Independent Set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of MIS problems suggests the use of distributed-memory hardware as a cost-effective approach to providing necessary compute and memory resources. Luby proposed four randomized algorithms to solve the MIS problem. All those algorithms are designed focusing on shared-memory machines and are analyzed using the PRAM model. These algorithms do not have direct efficient distributed-memory implementations. In this paper, we extend two of Luby’s seminal MIS algorithms, “Luby(A)” and “Luby(B),” to distributed-memory execution, and we evaluate their performance. We compare our results with the “Filtered MIS” implementation in the Combinatorial BLAS library for two types of synthetic graph inputs.

distributed memory parallel↗
NASA NTRS2000

Automatic Generation of Directive-Based Parallel Programs for Shared Memory Parallel Systems

The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technologies, performance of parallel programs with compiler directives has demonstrated large improvement. The introduction of OpenMP directives, the industrial standard for shared-memory programming, has minimized the issue of portability. Due to its ease of programming and its good performance, the technique has become very popular. In this study, we have extended CAPTools, a computer-aided parallelization toolkit, to automatically generate directive-based, OpenMP, parallel programs. We outline techniques used in the implementation of the tool and present test results on the NAS parallel benchmarks and ARC3D, a CFD application. This work demonstrates the great potential of using computer-aided tools to quickly port parallel programs and also achieve good performance.

Jin, Hao-Qiang↗
NASA NTRS2000

Automatic Generation of OpenMP Directives and Its Application to Computational Fluid Dynamics Codes

The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technologies, performance of parallel programs with compiler directives has demonstrated large improvement. The introduction of OpenMP directives, the industrial standard for shared-memory programming, has minimized the issue of portability. In this study, we have extended CAPTools, a computer-aided parallelization toolkit, to automatically generate OpenMP-based parallel programs with nominal user assistance. We outline techniques used in the implementation of the tool and discuss the application of this tool on the NAS Parallel Benchmarks and several computational fluid dynamics codes. This work demonstrates the great potential of using the tool to quickly port parallel programs and also achieve good performance that exceeds some of the commercial tools.

Yan, Jerry↗
NASA NTRS2001

The Automatic Parallelisation of Scientific Application Codes Using a Computer Aided Parallelisation Toolkit

The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. Historically, the lack of a programming standard for using directives and the rather limited performance due to scalability have affected the take-up of this programming model approach. Significant progress has been made in hardware and software technologies, as a result the performance of parallel programs with compiler directives has also made improvements. The introduction of an industrial standard for shared-memory programming with directives, OpenMP, has also addressed the issue of portability. In this study, we have extended the computer aided parallelization toolkit (developed at the University of Greenwich), to automatically generate OpenMP based parallel programs with nominal user assistance. We outline the way in which loop types are categorized and how efficient OpenMP directives can be defined and placed using the in-depth interprocedural analysis that is carried out by the toolkit. We also discuss the application of the toolkit on the NAS Parallel Benchmarks and a number of real-world application codes. This work not only demonstrates the great potential of using the toolkit to quickly parallelize serial programs but also the good performance achievable on up to 300 processors for hybrid message passing and directive-based parallelizations.

Ierotheou, C.↗