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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 973 records · Page 54

All sources NASA NTRS DOE OSTI

NASA NTRS2001

Radiation dosimetry using three-dimensional optical random access memories

Three-dimensional optical random access memories (3D ORAMs) are a new generation of high-density data storage devices. Binary information is stored and retrieved via a light induced reversible transformation of an ensemble of bistable photochromic molecules embedded in a polymer matrix. This paper describes the application of 3D ORAM materials to radiation dosimetry. It is shown both theoretically and experimentally, that ionizing radiation in the form of heavy charged particles is capable of changing the information originally stored on the ORAM material. The magnitude and spatial distribution of these changes are used as a measure of the absorbed dose, particle type and energy. The effects of exposure on 3D ORAM materials have been investigated for a variety of particle types and energies, including protons, alpha particles and 12C ions. The exposed materials are observed to fluoresce when exposed to laser light. The intensity and the depth of the fluorescence is dependent on the type and energy of the particle to which the materials were exposed. It is shown that these effects can be modeled using Monte Carlo calculations. The model provides a better understanding of the properties of these materials. which should prove useful for developing systems for charged particle and neutron dosimetry/detector applications. c2001 Published by Elsevier Science B.V.

Non-NASA Center↗

DOE OSTI2022

Scalable access to shared files in a distributed system

Logic may pre-populate cache of compute nodes allocated to a user's session. Logic may access an image file of a global filesystem, the image file to comprise a first set of one or more files associated with a user session and a second set of one or more files upon which execution of the first set will depend. Logic may store the image file in local data storage of each compute node of a spanning tree of compute nodes allocated for the user session. Logic may unpack the image file based on the data. Logic may configure the local environment of each compute node in the spanning tree to identify a location in local memory of each of the files. And logic may initiate execution of a local filesystem service in each of the compute nodes of the spanning tree.

Oganezov, Alexander↗

NASA NTRS1982

Application of digital image analysis techniques to antimisting fuel spray characterization

Pulsed ruby laser sheet illumination of the spray is used for the initial recording of data on very-high-resolution photographic film. The digitization of mosaic elements is effected with a vidicon and video digitizer whose output is stored in computer RAM memory for processing. Highly nonspherical elements and a broad range of drop diameters (8-2000 microns) resulting from the unusual rheological properties of the fuel-additive system are accommodated by the device configuration and algorithms. It is found that the generation of two-dimensional images by means of scattered light also eliminates errors resulting from variations in the index of refraction and from the submicron scattering sites that are often present within the modified fuel. No a priori information on the drop size distribution or on the system response to various drop sizes is required.

Fleeter, R.↗

NASA NTRS1993

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Standley, Hilda M.↗

NASA NTRS1986

Real-time garbage collection for list processing

In a list processing system, small reference counters are maintained in conjunction with memory cells for the purpose of identifying memory cells that become available for re-use. The counters are updated as references to the cells are created and destroyed, and when a counter of a cell is decremented to logical zero the cell is immediately returned to a list of free cells. In those cases where a counter must be incremented beyond the maximum value that can be represented in a small counter, the cell is restructured so that the additional reference count can be represented. The restructuring involves allocating an additional cell, distributing counter, tag, and pointer information among the two cells, and linking both cells appropriately into the existing list structure.

Shuler, R. L., Jr.↗

NASA NTRS1990

Real-time garbage collection for list processing using restructured cells for increased reference counter size

Shuler, Jr., Robert L.↗

NASA NTRS2017

The Effect of Firn-Aquifer Drainage on the Greenland Subglacial System or Subglacial Efficiency and Storage Modified by the Temporal Pattern of High-Elevation Meltwater Input

Ice flow in marginal region of the Greenland Ice Sheet dynamically responds to summer melting as surface meltwater is routed through the supraglacial hydrologic system to the bed of the ice sheet via crevasses and moulins. Given the expected increases in surface melt production and extent, and the potential for high elevation surface-to-bed connections, it is imperative to understand how meltwater delivered to the bed from different high-elevation supraglacial storage features affects the evolution of the subglacial hydrologic system and associated ice dynamics. Here, we use the two-dimensional subglacial hydrologic model, GLaDS, which includes distributed and channelized water flow, to test how the subglacial system of an idealized outlet glacier responds to cases of high-elevation firn-aquifer-type and supraglacial-lake-type englacial drainage over the course of 5 years. Model outputs driven by these high elevation drainage types are compared to steady-state model results, where the subglacial system only receives the 1980- 2016 mean MERRA-2 runoff via low-elevation moulins. Across all experiments, the subglacial hydrologic system displays inter-annual memory, resulting in multiyear declines in subglacial pressure during the onset of seasonal melting and growth of subglacial channels. The gradual addition of water in firn-aquifer-type drainage scenarios resulted in small increases in subglacial water storage but limited changes in subglacial efficiency and channelization. Rapid, supraglacial- lake-type drainage resulted in short-term local increases in subglacial water pressure and storage, which gave way to spatially extensive decreases in subglacial pressure and downstream channelization. These preliminary results suggest that the character of high-elevation englacial drainage can have a strong, and possibly outsized, control on subglacial efficiency throughout the ablation zone. Therefore, understanding both how high elevation meltwater is stored supraglacially and the probability of crevassing at high elevations will play an important role in how the subglacial system, proglacial discharge and ice motion will respond to future increases in surface melt production and runoff.

Andrews, Lauren C.↗

NASA NTRS1996

An Experimental Study of a Separated/Reattached Flow Behind a Backward-Facing Step. Re(sub h) = 37,000

An experimental study was carried out to investigate turbulent structure of a two-dimensional incompressible separating/reattaching boundary layer behind a backward-facing step. Hot-wire measurement technique was used to measure three Reynolds stresses and higher-order mean products of velocity fluctuations. The Reynolds number, Re(sub h), based on the step height, h, and the reference velocity, U(sub 0), was 37,000. The upstream oncoming flow was fully developed turbulent boundary layer with the Re(sub theta) = 3600. All turbulent properties, such as Reynolds stresses, increase dramatically downstream of the step within an internally developing mixing layer. Distributions of dimensionless mean velocity, turbulent quantities and antisymmetric distribution of triple velocity products in the separated free shear layer suggest that the shear layer above the recirculating region strongly resembles free-shear mixing layer structure. In the reattachment region close to the wall, turbulent diffusion term balances the rate of dissipation since advection and production terms appear to be negligibly small. Further downstream, production and dissipation begin to dominate other transport processes near the wall indicating the growth of an internal turbulent boundary layer. In the outer region, however, the flow still has a memory of the upstream disturbance even at the last measuring station of 51 step-heights. The data show that the structure of the inner layer recovers at a much faster rate than the outer layer structure. The inner layer structure resembles the near-wall structure of a plane zero pressure-gradient turbulent boundary layer (plane TBL) by 25h to 30h, while the outer layer structure takes presumably over 100h.

Jovic, Srba↗

DOE OSTI2024

A Diffusion‐Based Uncertainty Quantification Method to Advance E3SM Land Model Calibration

Abstract Calibrating land surface models and accurately quantifying their uncertainty are crucial for improving the reliability of simulations of complex environmental processes. This, in turn, advances our predictive understanding of ecosystems and supports climate‐resilient decision‐making. Traditional calibration methods, however, face challenges of high computational costs and difficulties in accurately quantifying parameter uncertainties. To address these issues, we develop a diffusion‐based uncertainty quantification (DBUQ) method. Unlike conventional generative diffusion methods, which are computationally expensive and memory‐intensive, DBUQ innovates by formulating a parameterized generative model and approximates this model through supervised learning, which enables quick generation of parameter posterior samples to quantify its uncertainty. DBUQ is effective, efficient, and general‐purpose, making it suitable for site‐specific ecosystem model calibration and broadly applicable for parameter uncertainty quantification across various earth system models. In this study, we applied DBUQ to calibrate the Energy Exascale Earth System Model land model at the Missouri Ozark AmeriFlux forest site. Results indicated that DBUQ produced accurate parameter posterior distributions similar to those from Markov Chain Monte Carlo sampling but with 30 times less computing time. This significant improvement in efficiency suggests that DBUQ can enable rapid, site‐level model calibration at a global scale, enhancing our predictive understanding of climate impacts on terrestrial ecosystems.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1987

The PISCES 2 parallel programming environment

PISCES 2 is a programming environment for scientific and engineering computations on MIMD parallel computers. It is currently implemented on a flexible FLEX/32 at NASA Langley, a 20 processor machine with both shared and local memories. The environment provides an extended Fortran for applications programming, a configuration environment for setting up a run on the parallel machine, and a run-time environment for monitoring and controlling program execution. This paper describes the overall design of the system and its implementation on the FLEX/32. Emphasis is placed on several novel aspects of the design: the use of a carefully defined virtual machine, programmer control of the mapping of virtual machine to actual hardware, forces for medium-granularity parallelism, and windows for parallel distribution of data. Some preliminary measurements of storage use are included.

Pratt, Terrence W.↗

DOE OSTI2025

Comprehensive assessment of deep reinforcement learning approaches for economic dispatch in nuclear-driven microgrids

As the electrical grid integrates more variable renewable energy sources such as wind and solar, the demand for distributed and flexible systems to address this increased variability becomes critical. Nuclear-driven microgrids provide a promising solution by offering stable generation to complement intermittent renewables, ensuring grid reliability and operating efficiency. This paper proposes a recurrent deep reinforcement learning framework for optimal economic dispatch in a nuclear-powered microgrid integrating renewable energy sources, small modular reactors, battery storage systems, and balance-of-plant dynamics. A three-agent control architecture is developed, where demand and renewable energy agents act as forecasters, and a reinforcement learning-based dispatch agent performs real-time energy allocation. A nonlinear programming formulation is first used to generate an optimal baseline for benchmarking. The proposed dispatch controller, based on Proximal Policy Optimization enhanced with Long Short-Term Memory networks, exploits temporal correlations in system dynamics by taking advantage of the time series used as inputs to improve policy robustness under uncertainty. Comparative analysis against established deep reinforcement learning methods, including Proximal Policy Optimization with a feedforward architecture, Soft Actor-Critic, and Twin Delayed Deep Deterministic Policy Gradient, demonstrates superior performance. Numerical results indicate that the proposed controller achieves a 0.39% cost reduction relative to the nonlinear programming benchmark and outperforms other learning-based methods by generating additional revenue of up to 0.35%. All reinforcement learning controllers compute dispatch actions in less than 0.3 s, resulting in a computational speedup of more than three orders of magnitude over the nonlinear programming baseline. The findings of this paper highlight their applicability for real-time operation and control in nuclear-integrated microgrids under volatile operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2026

HARMONY: Large-Scale Architecture Search for Efficient Hybrid Language Models

As large language models scale to trillions of parameters, their computational and memory requirements present critical challenges for efficient training and deployment. While Mixture of Experts (MoE) architectures enable efficient scaling through sparse parameter activation, and state-space models like Mamba offer linear-time complexity, principled methods for combining these paradigms remain undeveloped. We introduce HARMONY (Hybrid Architecture Research for Mamba, Optimized with Neural efficiencY), a multi-objective evolutionary neural architecture search framework for discovering efficient hybrid language models that integrate Transformer attention mechanisms, Mixture-of-Experts routing, and Mamba state-space components. Through large-scale distributed search using 16,384 MI250X GPUs on the Frontier supercomputer, HARMONY explores a comprehensive design space encompassing six attention variants (MHA, MQA, GQA, MLA, SWA, and Mamba-2), variable MoE configurations with both routed and shared experts, and extensive Mamba hyperparameters. Our framework discovers heterogeneous architectures that balance training performance with computational efficiency through multi-objective optimization incorporating latency penalties and fitness-based selection. Analysis of discovered architectures reveals that optimal hybrid designs favor heterogeneous component mixing rather than homogeneous patterns, with Mamba-2 and Multi-Head Latent Attention (MLA) emerging as preferred mechanisms. Discovered architectures demonstrate superior training efficiency: our best configuration achieves a final perplexity of 1.0874 with 2.38B parameters while processing 4,320 tokens/second, outperforming significantly larger manually designed models. Full-scale evaluation shows HARMONY's top architectures achieve better loss trajectories than equivalently-sized models using state-of-the-art configurations including Mixtral, Jamba, and Samba. Additionally, we demonstrate 91% weak scaling efficiency when training discovered 36B-parameter models across 1,024 GPUs. HARMONY is released as an open framework with comprehensive tools for building and training hybrid models using expert-data-pipeline parallelism, democratizing access to automated architecture design for next-generation language models.

Herron, Emily [ORNL] (ORCID:0000000273008172)↗

DOE OSTI2026

Score-based deterministic density sampling

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1995

Discrete-time Markovian stochastic Petri nets

We revisit and extend the original definition of discrete-time stochastic Petri nets, by allowing the firing times to have a 'defective discrete phase distribution'. We show that this formalism still corresponds to an underlying discrete-time Markov chain. The structure of the state for this process describes both the marking of the Petri net and the phase of the firing time for each transition, resulting in a large state space. We then modify the well-known power method to perform a transient analysis even when the state space is infinite, subject to the condition that only a finite number of states can be reached in a finite amount of time. Since the memory requirements might still be excessive, we suggest a bounding technique based on truncation.

Ciardo, Gianfranco↗

NASA NTRS1968

The Use of Large Lithium-Drifted, Germanium Diodes for Gamma-Ray Spectral Measurements at Balloon Altitudes

A series of balloon-borne experiments has been initiated at the Oak Ridge National Laboratory (ORNL) in cooperation with the Space Sciences Laboratory of the NASA G. C. Marshall Space Flight Center to determine the feasibility of using large (greater than 20 cc) lithium-drifted, germanium diodes to investigate the spectrum of atmospheric gamma rays (60 keV < E < 1.5 MeV) at altitudes corresponding to a few grams per cm (sup 2) residual atmosphere. The results of these measurements will also provide a basis for designing an appropriate shield for a multi-diode, highly directional gamma-ray spectrometer for use in astrophysical measurements. Two flights were accomplished during 1967 using the same two diodes and basic instrument package. Both flights were launched at the NCAR Scientific Balloon Flight Base, Palestine, Texas, and attained a float altitude of 117, 000 ft. The measured atmospheric gamma-ray spectrum shows at least one distinct line at 511 keV (annihilation radiation) superimposed on a continuous distribution of gamma rays attributable to both energy-degraded gamma rays and brems-strahlung photons. A second diode, encased in a passive shield of plastic and lead, shows the expected lines resulting from both neutron inelastic scattering and capture in the germanium. Data acquisition was accomplished on an event-by-event basis through the use of 512-channel, on-board ADC and word-generator circuits and a ground-based, on-line telemetry decoder. The decoder makes it possible to store the data in the memory of a modified pulse-height analyzer simultaneously with storage on magnetic tape. This provides a real-time visual observation of the data as it is accumulated and greatly facilitates preflight calibrations.

Chapman, G. T.↗

NASA NTRS2003

Intelligent machines in the twenty-first century: foundations of inference and inquiry

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Review↗

NASA NTRS1978

User's manual: Subsonic/supersonic advanced panel pilot code

Sufficient instructions for running the subsonic/supersonic advanced panel pilot code were developed. This software was developed as a vehicle for numerical experimentation and it should not be construed to represent a finished production program. The pilot code is based on a higher order panel method using linearly varying source and quadratically varying doublet distributions for computing both linearized supersonic and subsonic flow over arbitrary wings and bodies. This user's manual contains complete input and output descriptions. A brief description of the method is given as well as practical instructions for proper configurations modeling. Computed results are also included to demonstrate some of the capabilities of the pilot code. The computer program is written in FORTRAN IV for the SCOPE 3.4.4 operations system of the Ames CDC 7600 computer. The program uses overlay structure and thirteen disk files, and it requires approximately 132000 (Octal) central memory words.

Moran, J.↗

NASA NTRS1994

Applications Performance on NAS Intel Paragon XP/S - 15#

The Numerical Aerodynamic Simulation (NAS) Systems Division received an Intel Touchstone Sigma prototype model Paragon XP/S- 15 in February, 1993. The i860 XP microprocessor with an integrated floating point unit and operating in dual -instruction mode gives peak performance of 75 million floating point operations (NIFLOPS) per second for 64 bit floating point arithmetic. It is used in the Paragon XP/S-15 which has been installed at NAS, NASA Ames Research Center. The NAS Paragon has 208 nodes and its peak performance is 15.6 GFLOPS. Here, we will report on early experience using the Paragon XP/S- 15. We have tested its performance using both kernels and applications of interest to NAS. We have measured the performance of BLAS 1, 2 and 3 both assembly-coded and Fortran coded on NAS Paragon XP/S- 15. Furthermore, we have investigated the performance of a single node one-dimensional FFT, a distributed two-dimensional FFT and a distributed three-dimensional FFT Finally, we measured the performance of NAS Parallel Benchmarks (NPB) on the Paragon and compare it with the performance obtained on other highly parallel machines, such as CM-5, CRAY T3D, IBM SP I, etc. In particular, we investigated the following issues, which can strongly affect the performance of the Paragon: a. Impact of the operating system: Intel currently uses as a default an operating system OSF/1 AD from the Open Software Foundation. The paging of Open Software Foundation (OSF) server at 22 MB to make more memory available for the application degrades the performance. We found that when the limit of 26 NIB per node out of 32 MB available is reached, the application is paged out of main memory using virtual memory. When the application starts paging, the performance is considerably reduced. We found that dynamic memory allocation can help applications performance under certain circumstances. b. Impact of data cache on the i860/XP: We measured the performance of the BLAS both assembly coded and Fortran coded. We found that the measured performance of assembly-coded BLAS is much less than what memory bandwidth limitation would predict. The influence of data cache on different sizes of vectors is also investigated using one-dimensional FFTs. c. Impact of processor layout: There are several different ways processors can be laid out within the two-dimensional grid of processors on the Paragon. We have used the FFT example to investigate performance differences based on processors layout.

Saini, Subhash↗