Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed 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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Variational data augmentation for a learning-based granular predictive model of power outages

As the trend in climate change continues, extreme weather events are expected to occur with increasing frequency and severity and pose a significant threat to the electric power infrastructure. Regardless of the efforts a utility puts towards hardening the grid, storm-induced damage to the utility assets such as cables and distributed energy resources (DERs) that are particularly vulnerable to such events is unavoidable. Access to a highly granular, in space and time, outage forecasting tool with long lead times (i.e., days ahead) will enhance the efficiency of service restoration efforts. Here, in this study, we propose to develop and implement a multi-model framework as an operational tool based on a granular and multi-day outage forecasting model using operational numerical weather prediction model forecasts and detailed component outage information. An innovative two-layered recurrent neural network, i.e., a long-short-term-memory (LSTM)-based variational autoencoder (VAE) framework and a sliding window are used to address the uneven distribution of different types of weather events and make better use of the time-series data. Case studies are performed to demonstrate the performance of the new framework.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1970

Concept for a distributed processor computer

Future generation computer utilizes cell of single metal oxide semiconductor wafer containing general purpose processor section and small memory of approximately 512 words of 16 bits each. Cells are organized into groups and groups interconnected to form computer.

Bogue, P. N.↗
NASA NTRS1990

A scheme for supporting distributed data structures on multicomputers

A data migration mechanism is proposed that allows an explicit and controlled mapping of data to memory. While read or write copies of each data element can be assigned to any processor's memory, longer term storage of each data element is assigned to a specific location in the memory of a particular processor. The proposed integration of a data migration scheme with a compiler is able to eliminate the migration of unneeded data that can occur in multiprocessor paging or caching. The overhead of adjudicating multiple concurrent writes to the same page or cache line is also eliminated. Data is presented that suggests that the scheme may be a pratical method for efficiently supporting data migration.

Hiranandani, Seema↗
DOE OSTI2021

Texture Memory in Hexagonal Metals and Its Mechanism

Texture memory is a phenomenon in which retention of initial textures occurs after a complete cycle of forward and backward transformations, and it occurs in various phase-transforming materials including cubic and hexagonal metals such as steels and Ti and Zr alloys. Texture memory is known to be caused by the phenomena called variant selection, in which some of the allowed child orientations in an orientation relationship between the parent and child phases are preferentially selected. Without such variant selection, the phase transformations would randomize preferred orientations. In this article, the methods of prediction of texture memory and mechanisms of variant selections in hexagonal metals are explored. The prediction method using harmonic expansion of orientation distribution functions with the variant selection in which the Burgers orientation relationship, {110}β//{0001} α-hex <1$\bar{1}$1>β//$\langle2\bar{11}0\rangle$ α-hex , is held with two or more adjacent parent grains at the same time, called “double Burgers orientation relation (DBOR)”, is introduced. This method is shown to be a powerful tool by which to analyze texture memory and ultimately provide predictive capabilities for texture changes during phase transformations. Variation in nucleation and growth rates on special boundaries and an extensive growth of selected variants are also described. Analysis of textures of commercially pure Ti observed in situ by pulsed neutron diffraction reveals that the texture memory in CP-Ti is indeed quite well predicted by consideration of the mechanism of DBOR. The analysis also suggests that the nucleation and growth rates on the special boundary of 90° rotation about $\langle2\bar{11}0\rangle$ α-hex should be about three times larger than those of the other special boundaries, and the selected variants should grow extensively into not only one parent grain but also other grains in α-hex(hexagonal)→β(bcc) transformation. The model calculations of texture development during two consecutive cycles of α-hex→β→α-hex transformation in CP-Ti and Zr are also shown.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Object Proxy Patterns for Accelerating Distributed Applications

Workflow and serverless frameworks have empowered new approaches to distributed application design by abstracting compute resources. However, their typically limited or one-size-fits-all support for advanced data flow patterns leaves optimization to the application programmer—optimization that becomes more difficult as data become larger. The transparent object proxy, which provides wide-area references that can resolve to data regardless of location, has been demonstrated as an effective low-level building block in such situations. Here we propose three high-level proxy-based programming patterns—distributed futures, streaming, and ownership—that make the power of the proxy pattern usable for more complex and dynamic distributed program structures. We motivate these patterns via careful review of application requirements and describe implementations of each pattern. As a result, we evaluate our implementations through a suite of benchmarks and by applying them in three meaningful scientific applications, in which we demonstrate substantial improvements in runtime, throughput, and memory usage.

Distributed Computing↗
DOE OSTI2022

Probabilistic Nanomagnetic Memories for Uncertain and Robust Machine Learning

This project evaluated the use of emerging spintronic memory devices for robust and efficient variational inference schemes. Variational inference (VI) schemes, which constrain the distribution for each weight to be a Gaussian distribution with a mean and standard deviation, are a tractable method for calculating posterior distributions of weights in a Bayesian neural network such that this neural network can also be trained using the powerful backpropagation algorithm. Our project focuses on domain-wall magnetic tunnel junctions (DW-MTJs), a powerful multi-functional spintronic synapse design that can achieve low power switching while also opening the pathway towards repeatable, analog operation using fabricated notches. Our initial efforts to employ DW-MTJs as an all-in-one stochastic synapse with both a mean and standard deviation didn’t end up meeting the quality metrics for hardware-friendly VI. In the future, new device stacks and methods for expressive anisotropy modification may make this idea still possible. However, as a fall back that immediately satisfies our requirements, we invented and detailed how the combination of a DW-MTJ synapse encoding the mean and a probabilistic Bayes-MTJ device, programmed via a ferroelectric or ionically modifiable layer, can robustly and expressively implement VI. This design includes a physics-informed small circuit model, that was scaled up to perform and demonstrate rigorous uncertainty quantification applications, up to and including small convolutional networks on a grayscale image classification task, and larger (Residual) networks implementing multi-channel image classification. Lastly, as these results and ideas all depend upon the idea of an inference application where weights (spintronic memory states) remain non-volatile, the retention of these synapses for the notched case was further interrogated. These investigations revealed and emphasized the importance of both notch geometry and anisotropy modification in order to further enhance the endurance of written spintronic states. In the near future, these results will be mapped to effective predictions for room temperature and elevated operation DW-MTJ memory retention, and experimentally verified when devices become available.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2025

Spin-Photon Entanglement of a Single Er 3 + Ion in the Telecom Band

Entanglement between photons and a quantum memory is a key component of quantum repeaters, which allow long-distance quantum entanglement distribution in the presence of fiber losses. Spin-photon entanglement has been implemented with a number of different atomic and solid-state qubits with long spin coherence times, but none directly emit photons into the 1.5 − μ m telecom band where losses in optical fibers are minimized. Here, we demonstrate spin-photon entanglement using a single rare earth ion in the solid-state Er 3 + coupled to a silicon nanophotonic cavity, which directly emits photons at 1532.6 nm. We infer an entanglement fidelity of 73(3)% after propagating through 15.6 km of optical fiber. This work opens the door to large-scale quantum networks based Er 3 + ions, leveraging scalable silicon device fabrication and spectral multiplexing. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

HydraGNN v3.0

New or improved capabilities included in v3.0 release are as follows: 1. Enhancement in message passing layers through generalization of the class inheritance to enable the inclusion of a broader set of message passing policies Inclusion of equivariant message passing layers from the original implementations of: SchNet (https://pubs.aip.org/aip/jcp/article/148/24/241722/962591/SchNet-A-deep-learning-architecture-for-molecules); DimeNet++ (https://arxiv.org/abs/2011.14115); EGNN models (https://arxiv.org/pdf/2102.09844.pdf) 2. Restructuring of class inheritance for data management 3. Support of DDStore https://github.com/ORNL/DDStore capabilities for improved distributed data parallelism on large volumes of data that cannot fit on intra-node memory capacities 4. Large-scale system support for OLCF-Crusher and OLCF-Frontier

Lupo Pasini, Massimiliano [Oak Ridge National Labo↗
DOE OSTI2024

When ancient numerical demons meet physics-informed machine learning: adjoint-based gradients for implicit differentiable modeling

Recent advances in differentiable modeling, a genre of physics-informed machine learning that trains neural networks (NNs) together with process-based equations, have shown promise in enhancing hydrological models' accuracy, interpretability, and knowledge-discovery potential. Current differentiable models are efficient for NN-based parameter regionalization, but the simple explicit numerical schemes paired with sequential calculations (operator splitting) can incur numerical errors whose impacts on models' representation power and learned parameters are not clear. Implicit schemes, however, cannot rely on automatic differentiation to calculate gradients due to potential issues of gradient vanishing and memory demand. Here we propose a “discretize-then-optimize” adjoint method to enable differentiable implicit numerical schemes for the first time for large-scale hydrological modeling. The adjoint model demonstrates comprehensively improved performance, with Kling–Gupta efficiency coefficients, peak-flow and low-flow metrics, and evapotranspiration that moderately surpass the already-competitive explicit model. Therefore, the previous sequential-calculation approach had a detrimental impact on the model's ability to represent hydrological dynamics. Furthermore, with a structural update that describes capillary rise, the adjoint model can better describe baseflow in arid regions and also produce low flows that outperform even pure machine learning methods such as long short-term memory networks. The adjoint model rectified some parameter distortions but did not alter spatial parameter distributions, demonstrating the robustness of regionalized parameterization. Despite higher computational expenses and modest improvements, the adjoint model's success removes the barrier for complex implicit schemes to enrich differentiable modeling in hydrology.

58 GEOSCIENCES↗
NASA NTRS1992

Preliminary efforts toward development of data handling and analysis software for unsteady flow measurements: An application for aeroelastic transonic flow configurations

A few years ago the Structural Dynamics Division at LaRC started ambitious experimental research efforts known as the Benchmark Models Program. The primary objective of this program was to provide experimental data that may serve as a calibration source for computational fluid dynamics (CFD) efforts that deal with aeroelastic unsteady flow configurations. It also focuses on the understanding of complex flow phenomenon associated with unsteady flow developments. The overall plan for the program has been described by Bennett, including a presentation of initial test results of flutter of a rigid wing mounted on flexible supports. An example of a test model employed to measure the dynamic response along with corresponding pressure distributions is shown. This model incorporates eighty pressure transducers distributed along two spanwise stations. In addition, the models are equipped with four accelerometers and two strain gages. The data handling system for the Benchmark Model Program is under development. Several interactive computer routines designed for the user interface, dynamic memory allocation, unsteady flow measurements data extraction, and further data processing were developed. To present a few examples of measured data, the unsteady pressure distributions and the wing model dynamic response were plotted.

Finaish, Fathi↗
NASA NTRS2001

DARPA/AFRL/NASA Smart Wing Second Wind Tunnel Test Results

To quantify the benefits of smart materials and structures adaptive wing technology, Northrop Grumman Corp. (NGC) built and tested two 16% scale wind tunnel models (a conventional and a "smart" model) of a fighter/attack aircraft under the DARPA/AFRL/NASA Smart Materials and Structures Development - Smart Wing Phase 1. Performance gains quantified included increased pitching moment (C(sub M)), increased rolling moment (C(subl)) and improved pressure distribution. The benefits were obtained for hingeless, contoured trailing edge control surfaces with embedded shape memory alloy (SMA) wires and spanwise wing twist effected by SMA torque tube mechanisms, compared to conventional hinged control surfaces. This paper presents an overview of the results from the second wind tunnel test performed at the NASA Langley Research Center s (LaRC) 16ft Transonic Dynamic Tunnel (TDT) in June 1998. Successful results obtained were: 1) 5 degrees of spanwise twist and 8-12% increase in rolling moment utilizing a single SMA torque tube, 2) 12 degrees of deflection, and 10% increase in rolling moment due to hingeless, contoured aileron, and 3) demonstration of optical techniques for measuring spanwise twist and deflected shape.

Scherer, L. B.↗
NASA NTRS1993

Compact Disc Write Once (CD-WO)

Compact Disc - Read Only Memory (CD-ROM) has fulfilled its promise of becoming a dominant data storage and distribution media of the 90's.

affordable at department level Orange Book↗
NASA NTRS2012

Design for the Structure and the Mechanics of Moballs

The moball is envisioned to be a round, self-powered, and wind-driven multifunctioning sensor used in the Gone with the Wind ON-Mars (GOWON) [http://www.lpi.usra.edu/meetings/ marsconcepts2012/pdf/4238.pdf]: A Wind-Driven Networked System of Mobile sensors on Mars. The moballs would have sensing, processing, and communication capabilities. The moballs would perform in situ detection of key environmental elements such as vaporized water, trace gases, wind, dust, clouds, light and UV exposure, temperature, as well as minerals of interest, possible biosignatures, surface magnetic and electric fields, etc. The embedded various low-power micro instruments could include a Multispectral Microscopic Imager (to detect various minerals), a compact curved focal plane array camera (UV/Vis/NIR) with a large field of view, a compact UV/Visible spectrometer, a micro-weather station, etc. The moballs could communicate with each other and an orbiter. Their wind- or gravity-driven rolling movement could be used to harvest and store electric energy. They could also generate and store energy using the sunlight, when available, and the diurnal temperature variations on Mars. The moballs would be self-aware of their (and their neighbors ) positions, energy storage, and memory availability; they would have processing power and could intelligently cooperate with neighboring moballs by distributing tasks, sharing data, and fusing information. The major advantages of using the wind-driven and spherical moball network over rovers or other fixed sensor webs to explore Mars would be: (1) moballs could explore a much larger expanse of Mars in a much faster fashion, (2) they could explore the difficult terrains such as steep slopes and sand dunes, and (3) they would be self-energy- generating and could work together and move around autonomously. The challenge in designing the structure and the mechanics of the moball would be that it should be sturdy enough to withstand the impact of its initial fall, as well as other impacts from obstacles in its way. A mechanism would be needed that could enable hundreds of moballs to be carried while they would be deflated and compact, then would inflate them just after deploying them to their drop site. Furthermore, the moballs should also be light enough to allow them to move easily over obstacles by force of the wind. They also should have some kind of maneuvering mechanism in place to help them avoid very hazardous sharp objects or events, and to enable them to get closer to the objects of interest. The structure of the moballs was designed so that they would have different layers. The outer layer should comprise a sturdy, yet light, polymer that could withstand both the impact of the initial drop, as well as the impact of the different obstacles it would encounter while traversing the surface of Mars. This polymer should not deteriorate with the 100 K daily temperature swings on Mars. The inner layer should consist of a very light gas such as nitrogen or helium. In terms of maneuvering, six very light weights placed at strategic locations would give moballs the ability to turn, or even hop, over hazardous (e.g., sharp) obstacles, or even initiate a movement (before getting more help from the wind to be carried around) when stuck. Maneuvering would be necessary in order to get closer to objects of interest. If the weights would be allowed to move freely, they could also be used to generate energy.

Davoodi, Faranak↗
NASA NTRS2007

Decision Support Systems for Launch and Range Operations Using Jess

The virtual test bed for launch and range operations developed at NASA Ames Research Center consists of various independent expert systems advising on weather effects, toxic gas dispersions and human health risk assessment during space-flight operations. An individual dedicated server supports each expert system and the master system gather information from the dedicated servers to support the launch decision-making process. Since the test bed is based on the web system, reducing network traffic and optimizing the knowledge base is critical to its success of real-time or near real-time operations. Jess, a fast rule engine and powerful scripting environment developed at Sandia National Laboratory has been adopted to build the expert systems providing robustness and scalability. Jess also supports XML representation of knowledge base with forward and backward chaining inference mechanism. Facts added - to working memory during run-time operations facilitates analyses of multiple scenarios. Knowledge base can be distributed with one inference engine performing the inference process. This paper discusses details of the knowledge base and inference engine using Jess for a launch and range virtual test bed.

Thirumalainambi, Rajkumar↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2024

Finding MIDDLE Ground: Scalable and Secure Distributed Learning

Edge computing methods allow devices to efficiently train a high-performing, robust, and personalized model for predictive tasks. However, these methods succumb to privacy and scalability concerns such as adversarial data recovery and expensive model communication. Furthermore, edge computing methods unrealistically assume that all devices train an identical model. In practice, edge devices have varying computational and memory constraints which may not allow certain devices to have the space or speed to train a specific model. To overcome these issues, we propose MIDDLE: a model independent distributed learning algorithm which allows heterogeneous edge devices to assist each other’s training while communicating only non-sensitive information. MIDDLE unlocks the ability for edge devices, regardless of computational or memory constraints, to assist each other even with completely different model architectures. Furthermore, MIDDLE does not require model or gradient communication which greatly reduces communication size and time. We prove that MIDDLE attains the optimal convergence rate O(1/sqrt(TM)) of stochastic gradient descent for convex and non-convex smooth optimization (for total iterations T and batch size M). Finally, our experimental results demonstrate that MIDDLE (even in non-IID data settings) attains robust and high-performing models without model or gradient communication.

Bornstein, Marc I.↗
NASA NTRS2011

Experiment in Onboard Synthetic Aperture Radar Data Processing

Single event upsets (SEUs) are a threat to any computing system running on hardware that has not been physically radiation hardened. In addition to mandating the use of performance-limited, hardened heritage equipment, prior techniques for dealing with the SEU problem often involved hardware-based error detection and correction (EDAC). With limited computing resources, software- based EDAC, or any more elaborate recovery methods, were often not feasible. Synthetic aperture radars (SARs), when operated in the space environment, are interesting due to their relevance to NASAs objectives, but problematic in the sense of producing prodigious amounts of raw data. Prior implementations of the SAR data processing algorithm have been too slow, too computationally intensive, and require too much application memory for onboard execution to be a realistic option when using the type of heritage processing technology described above. This standard C-language implementation of SAR data processing is distributed over many cores of a Tilera Multicore Processor, and employs novel Radiation Hardening by Software (RHBS) techniques designed to protect the component processes (one per core) and their shared application memory from the sort of SEUs expected in the space environment. The source code includes calls to Tilera APIs, and a specialized Tilera compiler is required to produce a Tilera executable. The compiled application reads input data describing the position and orientation of a radar platform, as well as its radar-burst data, over time and writes out processed data in a form that is useful for analysis of the radar observations.

Holland, Matthew↗
DOE OSTI2025

Programmable Cryogenic Memory in a Ge/GeSi Heterostructure

Programmable memory components that operate optimally at cryogenic temperatures are essential for cryogenic computing architectures that seek to implement computing-in-memory. In this work, we demonstrate highly programmable memory in a Ge/GeSi heterostructure field-effect transistor (HFET). To operate, the HFET is gated to introduce positive carriers within the Ge quantum well, creating a high-conductance state. We show that this device can be set to a low-conductance state by sweeping a negative bias on the device drain, and reset it to its high-conductance state by sweeping a more positive bias on the device gate, thereby creating memory. We then determine that the device can be programmed within a 103 range of conductances using either the SET or the RESET operation. We propose that memory is achieved through charge trapping as carriers tunnel out of the quantum well, and that altering the density and spatial distribution of carriers modulates the device conductance. This mechanism exhibits endurance over 1000 cycles at temperatures ≤ 25 K, suggesting that the carrier traps are located at the oxide-semiconductor interface. As a first demonstration of programmable conductance in a Ge/GeSi HFET, this work highlights the potential of group-IV HFETs to perform as analog cryogenic memory components.

cryogenic memory↗