Search NASA⌕ Search

SEARCH · Search NASA

Results for “Memory Formation”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)

The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2006

Phase Structure and Site Preference Behavior of Ternary Alloying Additions to PdTi and PtTi Shape-Memory Alloys

The phasc structure and concentration dependence of the lattice parameter and energy of formation of ternary Pd-'I-X and Pt-Ti-X alloys for a large number of ternary alloying additions X (X = Na, Mg, Al, Si, Sc. V, Cr, Mn, Fe, Co, Ni, Cu, Zn, Y, Zr, Nb, Mo, Tc, Ru, Rh, Ag, Cd, Hf, Ta, W, Re, Os, Ir) are investigated with an atomistic modeling approach. In addition, a detailed description of the site preference behavior of such additions showing that the elements can be grouped according to their absolute preference for a specific site, regardless of concentration, or preference for available sites in the deficient sublattice is provided.

Bozzolo, Guillermo↗
DOE OSTI2023

Probing Defects and Spin‐Phonon Coupling in CrSBr via Resonant Raman Scattering

Abstract Understanding the stability limitations and defect formation mechanisms in 2D magnets is essential for their utilization in spintronic and memory technologies. Here, defects in mono‐ to multilayer CrSBr are correlated with structural, vibrational, and magnetic properties. Resonant Raman scattering is used to reveal distinct vibrational defect signatures. In pristine CrSBr, it is shown that bromine atoms mediate vibrational interlayer coupling, allowing for distinguishing between surface and bulk defect modes. Environmental exposure is shown to cause drastic degradation in monolayers, with the formation of intralayer defects. This is in contrast to multilayers that predominantly show bromine surface defects. Through deliberate ion irradiation, the formation of defect modes is tuned: these are strongly polarized and resonantly enhanced, reflecting the quasi‐‐1D electronic character of CrSBr. Strikingly, pronounced signatures of spin‐phonon coupling of the intrinsic phonon modes and the ion beam‐induced defect modes are observed throughout the magnetic transition temperature. Overall, defect engineering of magnetic properties is possible, with resonant Raman spectroscopy serving as a direct fingerprint of magnetic phases and defects in CrSBr.

2D magnetic semiconductors↗
DOE OSTI2024

Understanding Mixed Precision GEMM with MPGemmFI: Insights into Fault Resilience

Emerging deep learning workloads urgently need fast general matrix multiplication (GEMM). Thus, one of the critical features of machine-learning-specific accelerators such as NVIDIA Tensor Cores, AMD Matrix Cores, and Google TPUs is the support of mixed-precision enabled GEMM. For DNN models, lower-precision FP data formats and computation offer acceptable correctness but significant performance, area, and memory footprint improvement. While promising, the mixed-precision computation on error resilience remains unexplored. To this end, we develop a fault injection framework that systematically injects fault into the mixed-precision computation results. We investigate how the faults affect the accuracy of machine learning applications. Based on the characteristics of error resilience, we offer lightweight error detection and correction solutions that significantly improve the overall model accuracy by 75% if the models experience hardware faults. The solutions can be efficiently integrated into the accelerator's pipelines.

Fang, Bo↗
DOE OSTI2021

Accelerating Binarized Neural Networks via Bit-Tensor-Cores in Turing GPUs

Despite foreseeing tremendous speedups over conventional deep neural networks, the performance advantage of binarized neural networks (BNNs) has merely been showcased on general-purpose processors such as CPUs and GPUs. In fact, due to being unable to leverage bit-level-parallelism with a word-based architecture, GPUs have been criticized for extremely low utilization (1%) when executing BNNs. Consequently, the latest tensorcores in NVIDIA Turing GPUs start to experimentally support bit computation. In this work, we look into this brand new bit computation capability and characterize its unique features. We show that the stride of memory access can significantly affect performance delivery and a data-format co-design is highly desired to support the tensorcores for achieving superior performance than existing software solutions without tensorcores. We realize the tensorcore-accelerated BNN design, particularly the major functions for fully-connect and convolution layers — bit matrix multiplication and bit convolution. Evaluations on two NVIDIA Turing GPUs show that, with ResNet-18, our BTC-BNN design can process ImageNet at a rate of 5.6K images per second, 77% faster than state-of-the-art. Our BNN approach is released on https://github.com/pnnl/TCBNN.

Li, Ang↗
DOE OSTI2020

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗
DOE OSTI2021

Columnar data analysis with ATLAS analysis formats

Future analysis of ATLAS data will involve new small-sized analysis formats to cope with the increased storage needs. The smallest of these, named DAOD_PHYSLITE, has calibrations already applied to allow fast downstream analysis and avoid the need for further analysis-specific intermediate formats. This allows for application of the "columnar analysis" paradigm where operations are applied on a per-array instead of a per-event basis. We will present methods to read the data into memory, using Uproot, and also discuss I/O aspects of columnar data and alternatives to the ROOT data format. Furthermore, we will show a representation of the event data model using the Awkward Array package and present proof of concept for a simple analysis application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

CRCNS22 Learning Rules in the Hippocampus and their Mapping to Neuromorphic Systems (Final Technical Report)

Large scale biologically-realistic computational models are key to investigating the interplay between structure and function in nervous systems, thus paving the way to new clinical methods and neuro-inspired computing solutions. This project focuses on the hippocampus, in particular the CA3-CA1 regions, due to their role in associative learning and memory, pattern separation and completion, and spatial navigation. Investigations into the neuronal organization and learning rule(s) of this circuit can shed light into how declarative memories are formed, stored, recalled and forgotten and inform computational, experimental and clinical neuroscience work. Our project aims at developing a novel data-driven methodology supported by a broad heterogeneous base of neuroscience experimental knowledge and inspired from advances in computer science and engineering. Specifically, this work will benchmark existing and new learning rules within a full-scale spiking neural network simulation of the CA3-CA1 region. The model will be based on an open-source repository, called the Hippocampome, which contains neuronal morphologies, firing patterns, synapse probabilities, and most other required parameters for all known neuron types in the rodent hippocampal formation. The model will be first trained in a supervised fashion for associative memory tasks using backpropagation through time traditionally used in computer science, enhanced with a new technique called the surrogate gradient method. This optimization method will be used to obtain a global loss minimization, but it is not biologically inspired as it assumes the use of data not locally available to the synapses. However, we propose its use as a benchmarking tool, to compare the training performance of local biologically plausible and hardware-mappable learning rules at scale. New rules or combinations will be proposed and tested as needed, based on the obtained results. Progress in this area will also drive the development of novel hardware-mappable algorithms for continual lifelong learning and categorization of new events from few presented examples. This project goes beyond the existing state-of-the-art by looking at large scale realistic neuronal circuits as networks trainable via global optimization methods such as surrogate gradient descent. The objective function of the brain that supports learning is largely unknown, but it is likely that it operates through local learning rules. Studying network trajectories around local minima as proposed in this work represents a useful strategy for understanding whether a network is training by using a specific (set of) learning rule(s). Starting from a completely untrained network is a challenging test since it is difficult to determine how the learning rule affects the trajectory of the network. This interdisciplinary project will help understand what rule governs learning in these regions or if multiple learning rules are involved. The work will develop a robust methodology to measure if the network is converging to the target solution, oscillating around it, or diverging away.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

True Load Balancing for Matricized Tensor Times Khatri-Rao Product

MTTKRP is the bottleneck operation in algorithms used to compute the CP tensor decomposition. For sparse tensors, utilizing the compressed sparse fibers (CSF) storage format and the CSF-oriented MTTKRP algorithms is important for both memory and computational efficiency on distributed-memory architectures. Existing intelligent tensor partitioning models assume the computational cost of MTTKRP to be proportional to the total number of nonzeros in the tensor. However, this is not the case for the CSF-oriented MTTKRP on distributed-memory architectures. We outline two deficiencies of nonzero-based intelligent partitioning models when CSF-oriented MTTKRP operations are performed locally: failure to encode processors' computational loads and increase in total computation due to fiber fragmentation. We focus on existing fine-grain hypergraph model and propose a novel vertex weighting scheme that enables this model encode correct computational loads of processors. We also propose to augment the fine-grain model by fiber nets for reducing the increase in total computational load via minimizing fiber fragmentation. In this way, the proposed model encodes minimizing the load of the bottleneck processor. In conclusion, parallel experiments with real-world sparse tensors on up to 1024 processors prove the validity of the outlined deficiencies and demonstrate the merit of our proposed improvements in terms of parallel runtimes.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

Flexible format, computer accessed telemetry system

With this system, it is possible to sample and generate two or more simultaneous formats; one can be transmitted to ground station in real time, and other is stored for later transmission. Sensor output comparison data, plus information to control format, compression algorithm, and allowable degree of sensor activity, are stored in memory.

Easton, R. A.↗
NASA NTRS1979

Spectral transformation in the SOFI complex for processing photographic images on the ES computer, part 1

A description is given of three programs catalogued in the form of object modules in the library of a system for processing photographic images computer. PFT is the subprogram of the multi-dimensional BPF of real-valued information, in the operative computer memory. INRECO is a subprogram-interface between the real and complex formats for representing two-dimensional spectra and images. FFT2 is a subprogram for calculating the correlation functions of the image using the previous subprograms.

Debabov, A. S.↗
DOE OSTI2021

Boundary conditions manipulation of polar vortex domains in BiFeO 3 membranes via phase-field simulations

Polar vortex domains have recently become an emergent research field due to the abundant physical phenomena and potential applications in high-density memories. Here, we explore the mechanisms of creating polar vortex domains in the BiFeO3 (BFO) membranes subjected to different boundary conditions using phase-field simulations. A major difference is that the vortex in membrane can be stabilized even under short-circuit electrical boundary conditions compared to vortex in other systems, such as thin film or superlattice. We found that (a) the formation of polar vortex domains at the membrane interior under bending is mainly driven by the reduction of elastic energy under short-circuit boundary condition, and the vortex chirality (namely, clockwise and counterclockwise) could be identified by n-shape and u-shape bending; (b) in the unbent open-circuit BFO membrane case, exotic trapezoid-shaped vortex nanodomains form at the terminations of 109 degrees domain walls (DWs) and partially charged 71 degrees DWs, which is driven by the local depolarization field and the interplay among electrostatic, elastic, and gradient and Landau energies. We also examine Kittel's law by establishing the dependence of vortex periods on the membrane thickness. Furthermore, these results give further understanding of the effect of boundary conditions on the formation of polar vortex domains, guiding experimental designs of vortex-based high-density memories.

36 MATERIALS SCIENCE↗
NASA NTRS1992

Cockpit data link displays - An evaluation of textual formats

Data link technologies are being investigated for air/ground information transfer for commercial aircraft operation. This study was designed to measure which of four alpha-numeric display formats for display of data link information would lead to the quickest and most accurate memory retrieval in a part-task simulation environment. Pilots viewed a clearance for 10-15 seconds and were subsequently queried about the content of that clearance. Speed and accuracy of responses were measured across three retention tasks. The three retention tasks included free recall of a particular clearance. recognition of a previous clearance, and the comparison of element values between a previously displayed and current clearance. Each format was tested with and without a distraction task. Subjective ratings of each format were also collected. The analyses revealed no significant differences for reaction time or accuracy among the four formats. Explanations for these results as well as alternative methodologies are discussed.

Mcgann, Alison↗
NASA NTRS2007

[Interview Questions]

The Goddard Mission Services Evolution Center, or GMSEC, was started in 2001 to create a new standard approach for managing GSFC missions. Standardized approaches in the past involved selecting and then integrating the most appropriate set of functional tools. Assumptions were made that "one size fits all" and that tool changes would not be necessary for many years. GMSEC took a very different approach and has proven to be very successful. The core of the GMSEC architecture consists of a publish/subscribe message bus, standardized message formats, and an Applications Programming Interface (API). The API supports multiple operating systems, programming languages and messaging middleware products. We use a GMSEC-developed free middleware for low-cost development. A high capacity, robust middleware is used for operations and a messaging system with a very small memory footprint is used for on-board flight software. Software components can use the standard message formats or develop adapters to convert from their native formats to the GMSEC formats. We do not want vendors to modify their core products. Over 50 software components are now available for use with the GMSEC architecture. Most available commercial telemetry and command systems, including the GMV hifly Satellite Control System, have been adapted to run in the GMSEC labs.

Smith, Dan↗
DOE OSTI2024

Bridging the Gap Between LLMs and LNS with Dynamic Data Format and Architecture Codesign

Deep neural networks (DNNs) have achieved tremendous success in the past few years. However, their training and inference demand exceptional computational and memory resources. Quantization has been shown as an effective approach to mitigate the cost, with the mainstream data types reduced from FP32 to FP16/BF16 and recently FP8 in the latest NVIDIA H100 GPUs. With increasingly aggressive quantization, however, the conventional floating-point formats suffer from limited precision in representing numbers around zero. Recently, NVIDIA demonstrated the potential of using a Logarithmic Number System (LNS) for the next generation of tensor cores. While LNS mitigates the hurdles in representing small numbers, in this work we observed a mismatch between LNS and the emerging Large Language Models (LLM), where LLM exhibits significant outliers when directly adopting the LNS format. In this paper, we present a data-format/architecture codesign to bright this gap. On the format side, we propose a dynamic LNS format to flexibly represent outliers at a higher precision, by exploiting asymmetry in the LNS representation and identifying outliers through a per-vector basis. On the architecture side, for demonstration, we realize the dynamic LNS format in a systolic array, which can handle the irregularity of the outliers at runtime. We implement our approach on an Alveo U280 FPGA as a prototype. Experimental results show that our design can effectively handle the outliers and resolve the mismatch between LNS and LLM, contributing to an accuracy improvement of 15.4% and 16% over the floating-point and the original LNS baselines, using four state-of-the-art LLM models. Our observation and design lay a solid foundation for the large-scale adoption of the LNS format in the next-generation deep learning hardware.

Haghi, Pouya↗
DOE OSTI2020

Fast transformations between configuration state function and Slater determinant bases for direct configuration interaction

A hybrid configuration state function (CSF) and Slater determinant (SD) basis full configuration interaction (CI) program was developed to simultaneously take advantage of fast SD basis algorithms for σ = Hc formation and the smaller CI vector length and more robust convergence offered by a CSF basis. Graphical processing unit acceleration of the direct CSF-SD and SD-CSF basis transformation algorithms ensures that the combined transformation time per iteration relative to σ formation is small (~15%). In addition to the obvious benefits of reducing the memory footprint of the CI vector, additional computational savings are demonstrated that rely directly on the size of the CI basis, in one particular case reducing the CI time-to-solution of a HF-CAS-(16,16)-CI/6-31G calculation of ethylene from 1954.79 s to 956 s by using a CSF basis, a 2.0× speedup.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Technical report: Design of the accessor

As we have seen the arithmetic power of hardware architectures growing much faster than the memory bandwidth, there is an urgent need to rethink the way we operate, communicate, and store data. A promising strategy for overcoming the “memory wall” is the decoupling of memory precision from arithmetic precision as proposed in Anzt et al. Such a decoupling of memory precision and arithmetic precision requires an “accessor” that handles the conversion between formats (resp. compression of the data) on the fly in registers. Such an accessor has to be general in the sense that it can handle a wide range of floating point formats and compression strategies, and still allows for further extension. At the same time, is important that the use of the accessor is not a burden for the developer. Therefore, it is important to abstract all implementation details from the user, hide the underlying storage format from the user, and make the accessor cross-platform portable. In this document we present the design of an accessor that aims at fulfilling all these requirements.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Fe-Ti-Cr-Oxides in Martian Meteorite EETA79001 Studied by Point-counting Procedure Using Raman Spectroscopy

Fe-Ti-Cr-Oxide minerals contain much information about rock petrogenesis and alteration. Among the most important in the petrology of common intrusive and extrusive rocks are those of the FeO-TiO2-Cr2O3 compositional system chromite, ulv spinel-magnetite, and ilmenite-hematite. These minerals retain memories of oxygen fugacity. Their exsolution into companion mineral pairs give constraints on formation temperature and cooling rate. Laser Raman spectroscopy is anticipated to be a powerful technique for characterization of materials on the surface of Mars. A Mars Microbeam Raman Spectrometer (MMRS) is under development. It combines a micro sized laser beam and an automatic point-counting mechanism, and so can detect minor minerals or weak Raman-scattering phases such as Fe- Ti-Cr-oxides in mixtures (rocks & soils), and provide information on grain size and mineral mode. Most Fe-Ti-Cr-oxides produce weaker Raman signals than those from oxyanionic minerals, e.g. carbonates, sulfates, phosphates, and silicates, partly because most of them are intrinsically weaker Raman scatters, and partly because their dark colors limit the penetration depth of the excitation laser beam (visible wavelength) and of the Raman radiation produced. The purpose of this study is to show how well the Fe-Ti-Cr-oxides can be characterized by on-surface planetary exploration using Raman spectroscopy. We studied the basic Raman features of common examples of these minerals using well-characterized individual mineral grains. The knowledge gained was then used to study the Fe-Ti-Cr-oxides in Martian meteorite EETA79001, especially effects of compositional and structural variations on their Raman features.

Wang, Alian↗