Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed computation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,747 records · Page 97
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Magnetic tunnel junction random number generators applied to dynamically tuned probability trees driven by spin orbit torque

Abstract Perpendicular magnetic tunnel junction (pMTJ)-based true-random number generators (RNGs) can consume orders of magnitude less energy per bit than CMOS pseudo-RNGs. Here, we numerically investigate with a macrospin Landau–Lifshitz-Gilbert equation solver the use of pMTJs driven by spin–orbit torque to directly sample numbers from arbitrary probability distributions with the help of a tunable probability tree. The tree operates by dynamically biasing sequences of pMTJ relaxation events, called ‘coinflips’, via an additional applied spin-transfer-torque current. Specifically, using a single, ideal pMTJ device we successfully draw integer samples on the interval [0, 255] from an exponential distribution based on p -value distribution analysis. In order to investigate device-to-device variations, the thermal stability of the pMTJs are varied based on manufactured device data. It is found that while repeatedly using a varied device inhibits ability to recover the probability distribution, the device variations average out when considering the entire set of devices as a ‘bucket’ to agnostically draw random numbers from. Further, it is noted that the device variations most significantly impact the highest level of the probability tree, with diminishing errors at lower levels. The devices are then used to draw both uniformly and exponentially distributed numbers for the Monte Carlo computation of a problem from particle transport, showing excellent data fit with the analytical solution. Finally, the devices are benchmarked against CMOS and memristor RNGs, showing faster bit generation and significantly lower energy use.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2012

Lagrangian perturbations and the matter bispectrum II: the resummed one-loop correction to the matter bispectrum

This is part two in a series of papers in which we investigate an approach based on Lagrangian perturbation theory (LPT) to study the non-linear evolution of the large-scale structure distribution in the universe. Firstly, we compute the matter bispectrum in real space using LPT up one-loop order, for both Gaussian and non-Gaussian initial conditions. In the initial position limit, we find that the one-loop bispectrum computed in this manner is identical to its counterpart obtained from standard Eulerian perturbation theory (SPT). Furthermore, the LPT formalism allows for a simple reorganisation of the perturbative series corresponding to the resummation of an infinite series of perturbations in SPT. Applying this method, we find a resummed one-loop bispectrum that compares favourably with results from N-body simulations. We generalise the resummation method also to the computation of the redshift-space bispectrum up to one loop.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

A kinetic line-driven radiation operator and its application to Gyrokinetics

A velocity dependent, kinetic model for line radiation is developed for continuum kinetic codes. It has been implemented in the full-f gyrokinetic code Gkeyll. The total radiation for a charge state is modeled as an advection in velocity space with a form of $\nabla_v \cdot(v\nu(v)f(v))$, guaranteeing particle conservation. The velocity dependence (in the form of an effective frequency $\nu(v)$) is found through fitting the energy loss of the operator, i.e. the second velocity moment, to the radiation data in the OpenADAS database. Therefore, each individual transition does not need to be evaluated every time step, significantly reducing the computational cost of including line radiation in a kinetic model. The dependence on velocity instead of the usual, temperature, allows the radiation to be computed from non-Maxwellian electron distribution functions: We benchmark the model against a collisional radiative model using isotropic non-Maxwellian distribution functions. A velocity dependent model of radiation can more accurately describe the radiation in the more kinetic regimes expected in reactor-scale devices. The velocity dependence qualitatively captures the quantum mechanical need for a minimum velocity before any radiation occurs.

kinetic↗
DOE OSTI2014

Towards a centralized Grid Speedometer

Given the distributed nature of the Worldwide LHC Computing Grid and the way CPU resources are pledged and shared around the globe, Virtual Organizations (VOs) face the challenge of monitoring the use of these resources. For CMS and the operation of centralized workflows, the monitoring of how many production jobs are running and pending in the Glidein WMS production pools is very important. The Dashboard Site Status Board (SSB) provides a very flexible framework to collect, aggregate and visualize data. The CMS production monitoring team uses the SSB to define the metrics that have to be monitored and the alarms that have to be raised. During the integration of CMS production monitoring into the SSB, several enhancements to the core functionality of the SSB were required, They were implemented in a generic way, so that other VOs using the SSB can exploit them. Alongside these enhancements, there were a number of changes to the core of the SSB framework. This paper presents the details of the implementation and the advantages for current and future usage of the new features in SSB.

Dzhunov, I.↗
DOE OSTI2011

Entanglement percolation on a quantum internet with scale-free and clustering characters

The applicability of entanglement percolation protocol to real Internet structure is investigated. If the current Internet can be used directly in the quantum regime, the protocol can provide a way to establish long-distance entanglement when the links are pure nonmaximally entangled states. This applicability is primarily due to the combination of scale-free degree distribution and a high level of clustering, both of which are widely observed in many natural and artificial networks including the current Internet. It suggests that the topology of real Internet may play an important role in entanglement establishment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Electrostatic modulation of the lateral carrier density profile in field effect devices with nonlinear dielectrics

The properties of two-dimensional (2D) electronic systems are often effectively controlled using electrostatic gating. The geometry of such field effect devices influences the effectiveness of the gate and the carrier density profile in the 2D device. Here, in this work, we analyze the gate-induced spatial variations in the lateral carrier density in patterned LaAlO 3 /SrTiO 3 devices. We model the electrostatics of the 2D interface using the Thomas-Fermi approximation and compute the gate-induced charge distribution at the interface. We show that the electric field lines generated by the gate are focused at the edges of the device, causing an increased depletion near its edges. This effect is accentuated in LaAlO 3 /SrTiO 3 due to the large, nonlinear dielectric constant of the substrate, and the large distance between the gate electrode and the interface. We experimentally demonstrate one consequence of this effect by directly imaging current distributions in gated heterostructures, finding that insulating regions nucleate at the edges of the device due to the gate. Our results suggest that device geometry and choice of dielectric materials control the charge distribution in 2D systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Models for randomly distributed nanoscopic domains on spherical vesicles

The existence of lipid domains in the plasma membrane of biological systems has proven controversial, primarily due to their nanoscopic size—a length scale difficult to interrogate with most commonly used experimental techniques. Scattering techniques have recently proven capable of studying nanoscopic lipid domains populating spherical vesicles. However, the development of analytical methods able of predicting and analyzing domain pair correlations from such experiments has not kept pace. In our work, we developed models for the random distribution of monodisperse, circular nanoscopic domains averaged on the surface of a spherical vesicle. Specifically, the models take into account (i) intradomain correlations corresponding to form factors and interdomain correlations corresponding to pair distribution functions, and (ii) the analytical computation of interdomain correlations for cases of two and three domains on a spherical vesicle. In the case of more than three domains, these correlations are treated either by Monte Carlo simulations or by spherical analogs of the Ornstein-Zernike and Percus-Yevick (PY) equations. Importantly, the spherical analog of the PY equation works best in the case of nanoscopic size domains, a length scale that is mostly inaccessible by experimental approaches such as, for example, fluorescent techniques and optical microscopies. The analytical form factors and structure factors of nanoscopic domains populating a spherical vesicle provide a new and important framework for the quantitative analysis of experimental data from commonly studied phase-separated vesicles used in a wide range of biophysical studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Probabilistic neural networks for fluid flow surrogate modeling and data recovery

We consider the use of probabilistic neural networks for fluid flow surrogate modeling and data recovery. This framework is constructed by assuming that the target variables are sampled from a Gaussian distribution conditioned on the inputs. Consequently, the overall formulation sets up a procedure to predict the hyperparameters of this distribution which are then used to compute an objective function given training data. We demonstrate that this framework has the ability to provide for prediction confidence intervals based on the assumption of a probabilistic posterior, given an appropriate model architecture and adequate training data. The applicability of the present framework to cases with noisy measurements and limited observations is also assessed. To demonstrate the capabilities of this framework, we consider canonical regression problems of fluid dynamics from the viewpoint of reduced-order modeling and spatial data recovery for four canonical data sets. The examples considered in this study arise from (i) the shallow-water equations, (ii) a two-dimensional cylinder flow, (iii) the wake of a NACA0012 airfoil with a Gurney flap, and (iv) the NOAA sea surface temperature data set. Furthermore, the present results indicate that the probabilistic neural network not only produces a machine-learning-based fluid flow surrogate model but also systematically quantifies the uncertainty therein to assist with model interpretability.

42 ENGINEERING↗
DOE OSTI2018

Scalable Proximity-Based Methods for Large-Scale Analysis of Atom Probe Data

Powered by recent advances in data acquisition technologies, today's state-of-the-art atom probe microscopes yield data sets with sizes ranging from a few million atoms to billions of atoms. Analysis of these atomic data sets within rea-sonable turnaround times is a pressing data analysis challenge for material scientists currently equipped with software systems that do not scale to these massive data sets. Here, we present the shared memory component of a larger ongoing effort to develop a multi-feature data analysis framework capable of analyzing atom probe data of all sizes and scales from desktop multicore machines to large-scale high-performance computing platforms with hybrid (shared and distributed memory) architectures. Our focus here is on a broad class of popular atom probe data analysis methods that rely on core time-consuming k-NN queries. We present a scalable, heuristic algorithm for k-NN queries using three-dimensional range trees. To demonstrate its efficacy, the k-NN algorithm is integrated with two use cases of atom probe data analysis methods and the resulting analysis times are shown to speedup by over 20X on a 32-core Cray XC40 node using workloads up to 8 million atoms, which is already beyond the at-scale capabilities of existing atom probe software. Using this k-NN algorithm, we also introduce a novel parameter estimation method for a class of cluster finding methods, called friends-of-friends (FoF) methods, to completely bypass their expensive pre-processing steps. In each case, we validate the results on a variety of control data sets.

Lu, Hao↗
DOE OSTI2018

Modular Spiking Neural Circuits for Mapping Long Short-Term Memory on a Neurosynaptic Processor

Due to the distributed and asynchronous nature of neural computation through low-energy spikes, brain-inspired hardware systems offer high energy efficiency and massive parallelism. One such platform is the IBM TrueNorth neurosynaptic system. Recently, TrueNorth compatible representation learning algorithms have emerged, achieving close to the state-of-the-art performance in various data sets. However, its application in temporal sequence processing models, such as recurrent neural networks (RNNs), is still only at the proof of concept level. There is an inherent difficulty in capturing temporal dynamics of an RNN using spiking neurons, which is only exasperated by the hardware constraints in connectivity and synaptic weight resolution. This paper presents a design flow that overcomes these difficulties and maps a special case of recurrent networks called long short-term memory (LSTM) onto a spike-based platform. The framework utilizes various approximation techniques, such as activation discretization, weight quantization, and scaling and rounding, spiking neural circuits that implement the complex gating mechanisms, and a store-and-release technique to enable neuron synchronization and faithful storage. While the presented techniques can be applied to map LSTM to any spiking neural network (SNN) simulator/emulator, here we choose the TrueNorth chip as the target platform by adhering to its hardware constraints. Three LSTM applications, parity check, extended Reber grammar, and question classification, are evaluated. The tradeoffs among accuracy, performance, and energy tradeoffs achieved on TrueNorth are demonstrated. Finally, this is compared with the performance on an SNN platform without hardware constraints, which represents the upper bound of the achievable accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Time Sequence Machine Learning-Based Data Intrusion Detection for Smart Voltage Source Converter-Enabled Power Grid

Smart inverters of distributed energy resources can enable cloud computing, condition monitoring, result visualization, remote control, and peer-to-peer energy trading in advanced power systems. However, the advent of data injection attacks in the communication architecture can alter measurement characteristics of power grids and have devastating consequences. In this article, we propose a time sequence machine learning-based anomaly detection methodology for detecting cyber intrusion into control signal setpoints and dc voltage signal measurement bias of the voltage source converter (VSC) in wind generators. We first investigated the effects of four types of denial of service, tampering signal, and stealthy-type data intrusion attacks on smart VSCs and overall wind farms. We then proposed a novel time sequence machine learning-based intrusion detection framework that can be implemented to detect different cyberattacks in the VSCs. The performance of the proposed framework has been compared with that of autoencoder and clustering-based intrusion detection framework. The proposed framework was validated by using the IEEE 39 bus power system in the presence of four wind farms in different locations. Using several metrics for intrusion detection performance, we validated the effectiveness of the proposed framework.

42 ENGINEERING↗
DOE OSTI2025

Data Management in the Continuum: Cross-facility Object-based Data Transfers

Scientific workflows are evolving from relying on a monolithic storage subsystem at a single High-Performance Computing (HPC) facility to using geographically distributed file systems, repositories, and cloud storage. As a result, storing, accessing, transferring, and managing scientific data have become highly complex and prone to performance inefficiencies. This paper delves into these challenges by exploring an optimized end-to-end interface designed to seamlessly connect various local and remote storage systems, enabling efficient data movement of objects across HPC–Cloud and HPC–HPC environments. We showcase this capability through an object-focused data management runtime system, discuss the effects of relaxed consistency semantics in distributed object scenarios, and illustrate its application in an earthquake simulation workflow. Besides reducing the amount of data by selectively transferring regions of interest, our facility-local results achieved a speedup of 45 × over an optimized HDF5 usage and 15 × over the HDF5 with caching by using the new interface in PDC-XF.

Bez, Jean Luca↗
DOE OSTI2011

Scientific Workflows Composition and Deployment on SOA Frameworks

Scientific workflows normally consist of multiple applications acquiring and transforming data, running data intensive analyses and visualizing the results for scientific discovery. To compose and deploy such scientific workflows, an SOA platform can provide integration of third-party components, services, and tools. In this paper, we present our application of Service-Oriented Architecture (SOA) to compose and deploy systems biology workflows. In developing this application, our solution uses MeDICi a middleware framework built on SOA platforms as an integration layer. We discuss our experience and lessons learnt about this solution that are generally applicable to scientific workflows in other domains.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2012

Modeling and Analysis of Solar Radiation Potentials on Building Rooftops

The active application of photovoltaic for electricity generation could effectively transform neighborhoods and commercial districts into small, localized power plants. This application, however, relies heavily on an accurate estimation of the amount of solar radiation that is available on individual building rooftops. While many solar energy maps exist at higher spatial resolution for concentrated solar energy applications, the data from these maps are not suitable for roof-mounted photovoltaic for several reasons, including lack of data at the appropriate spatial resolution and lack of integration of building-specific characteristics into the models used to generate the maps. To address this problem, we have developed a modeling framework for estimating solar radiation potentials on individual building rooftops that is suitable for utility-scale applications as well as building-specific applications. The framework uses light detection and ranging (LIDAR) data at approximately 1-meter horizontal resolution and 0.3-meter vertical resolution as input for modeling a large number of buildings quickly. One of the strengths of this framework is the ability to parallelize its implementation. Furthermore, the framework accounts for building specific characteristics, such as roof slope, roof aspect, and shadowing effects, that are critical to roof-mounted photovoltaic systems. The resulting data has helped us to identify the so-called solar panel sweet spots on individual building rooftops and obtain accurate statistics of the variation in solar radiation as a function of time of year and geographical location.

computational modeling↗
DOE OSTI2014

SU-E-T-21: A Novel Sampling Algorithm to Reduce Intensity-Modulated Radiation Therapy (IMRT) Optimization Time

Purpose: The IMRT optimization problem requires substantial computer time to find optimal dose distributions because of the large number of variables and constraints. Voxel sampling reduces the number of constraints and accelerates the optimization process, but usually deteriorates the quality of the dose distributions to the organs. We propose a novel sampling algorithm that accelerates the IMRT optimization process without significantly deteriorating the quality of the dose distribution. Methods: We included all boundary voxels, as well as a sampled fraction of interior voxels of organs in the optimization. We selected a fraction of interior voxels using a clustering algorithm, that creates clusters of voxels that have similar influence matrix signatures. A few voxels are selected from each cluster based on the pre-set sampling rate. Results: We ran sampling and no-sampling IMRT plans for de-identified head and neck treatment plans. Testing with the different sampling rates, we found that including 10% of inner voxels produced the good dose distributions. For this optimal sampling rate, the algorithm accelerated IMRT optimization by a factor of 2–3 times with a negligible loss of accuracy that was, on average, 0.3% for common dosimetric planning criteria. Conclusion: We demonstrated that a sampling could be developed that reduces optimization time by more than a factor of 2, without significantly degrading the dose quality.

60 APPLIED LIFE SCIENCES↗