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,693 records · Page 94
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

An Optimal Parameterization Framework for Infrasonic Tomography of the Stratospheric Winds Using Non-Local Sources

A method is developed to apply acoustic tomography methods to a localized network of infrasound arrays with intention of monitoring the atmosphere state in the region around the network using non-local sources without requiring knowledge of the precise source location or non-local atmosphere state. Closely spaced arrays provide a means to estimate phase velocities of signals that can provide limiting bounds on certain characteristics of the atmosphere. Larger spacing between such clusters provide a means to estimate celerity from propagation times along multiple unique stratospherically or thermospherically ducted propagation paths and compute more precise estimates of the atmosphere state. In order to avoid the commonly encountered complex, multimodal distributions for parametric atmosphere descriptions and to maximize the computational efficiency of the method, an optimal parametrization framework is constructed. This framework identifies the ideal combination of parameters for tomography studies in specific regions of the atmosphere and statistical model selection analysis shows that high quality corrections to the middle atmosphere winds can be obtained using as few as three parameters. Lastly, comparison of the resulting estimates for synthetic data sets shows qualitative agreement between the middle atmosphere winds and those estimated from infrasonic traveltime observations.

58 GEOSCIENCES↗
DOE OSTI2024

A Fully Decentralized Modulation Scheme for Modular Multilevel Converters

As the number of submodules rapidly increase, control architecture of Modular Multilevel Converters (MMCs) is transforming from centralized to distributed in order to address the challenges of tremendous computational burden and massive wiring. In this digest, we propose a modulation scheme for the MMCs with distributed controls, where each submodule is able to handle both controls and modulation in a decentralized manner. It enables the distributed controllers to synchronize in terms of fast-switching pulse width modulation (PWM). Aiming at this key technical challenge, this research develops a physics-informed PWM control strategy of mirroring the spontaneous synchronization feature of coupled oscillator’s behavior at switching frequency. Thanks to less reliance on wirings and communications, the proposed approach has the potential of i) improving reliability of MMC systems, and ii) reducing cost and space requirements for MMCs. The proposed approach has been preliminarily verified through a simulation tool for power electronics systems.

Lu, Minghui [BATTELLE (PACIFIC NW LAB)]↗
DOE OSTI2021

Peer-to-Peer Energy Systems for Connected Communities: A Review of Recent Advances and Emerging Challenges

After a century of relative stability of the electricity industry, extensive deployment of distributed energy resources and recent advances in computation and communication technologies have changed the nature of how we consume, trade, and apply energy. The power system is facing a transition from its traditional hierarchical structure to a more deregulated model by introducing new energy distribution models such as peer-to- peer (P2P) sharing for connected communities. The proven effectiveness of P2P sharing in benefiting both prosumers and the grid has been demonstrated in many studies and pilot projects. However, there is still no extensive implementation of such sharing models in today’s electricity markets. This paper aims to shed some light on this gap through a comprehensive overview of recent advances in the P2P energy system and an insightful discussion of the challenges that need to be addressed in order to establish P2P sharing as a viable energy management option in today’s electricity market. To this end, in this article, we provide some background on different aspects of P2P sharing. Then, we discuss advances in P2P sharing through a systematic domain-based classification. We also review different pilot projects on P2P sharing across the globe. Finally, we identify and discuss a number of challenges that need to be addressed for scaling up P2P sharing in the electricity market followed by concluding remarks at the end of the paper.

Tushar, Wayes↗
DOE OSTI2022

Atomic structure of an FeCrMoCBY metallic glass revealed by high energy x-ray diffraction

Amorphous bulk metallic glasses with the composition Fe 48 Cr 15 Mo 14 C 15 B 6 Y 2 have been of interest due to their special mechanical and electronic properties, including corrosion resistance, high yield-strength, large elasticity, catalytic performance, and soft ferromagnetism. Here, we apply a reverse Monte Carlo technique to unravel the atomic structure of these glasses. The pair-distribution functions for various atomic pairs are computed based on the high-energy x-ray diffraction data we have taken from an amorphous sample. Monte Carlo cycles are used to move the atomic positions until the model reproduces the experimental pair-distribution function. The resulting fitted model is consistent with our ab initio simulations of the metallic glass. Our study contributes to the understanding of functional properties of Fe-based bulk metallic glasses driven by disorder effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

SU-E-T-184: Clinical VMAT QA Practice Using LINAC Delivery Log Files

Purpose: To evaluate the accuracy of volumetric modulated arc therapy (VMAT) treatment delivery dose clouds by comparing linac log data to doses measured using an ionization chamber and film. Methods: A commercial IMRT quality assurance (QA) process utilizing a DICOM-RT framework was tested for clinical practice using 30 prostate and 30 head and neck VMAT plans. Delivered 3D VMAT dose distributions were independently checked using a PinPoint ionization chamber and radiographic film in a solid water phantom. DICOM RT coordinates were used to extract the corresponding point and planar doses from 3D log file dose distributions. Point doses were evaluated by computing the percent error between log file and chamber measured values. A planar dose evaluation was performed for each plan using a 2D gamma analysis with 3% global dose difference and 3 mm isodose point distance criteria. The same analysis was performed to compare treatment planning system (TPS) doses to measured values to establish a baseline assessment of agreement. Results: The mean percent error between log file and ionization chamber dose was 1.0%±2.1% for prostate VMAT plans and −0.2%±1.4% for head and neck plans. The corresponding TPS calculated and measured ionization chamber values agree within 1.7%±1.6%. The average 2D gamma passing rates for the log file comparison to film are 98.8%±1.0% and 96.2%±4.2% for the prostate and head and neck plans, respectively. The corresponding passing rates for the TPS comparison to film are 99.4%±0.5% and 93.9%±5.1%. Overall, the point dose and film data indicate that log file determined doses are in excellent agreement with measured values. Conclusion: Clinical VMAT QA practice using LINAC treatment log files is a fast and reliable method for patient-specific plan evaluation.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2012

Scalla: Structured Cluster Architecture for Low Latency Access

Scalla is a distributed low-latency file access system that incorporates novel techniques that minimize latency and maximize scalability over a large distributed system with a distributed namespace. Scalla's techniques have shown to be effective in nearly a decade of service for the high-energy physics community using commodity hardware and interconnects. We describe the two components used in Scalla that are instrumental in its ability to provide low-latency, fault-tolerant name resolution and load distribution, and enable its use as a high-throughput, low-latency communication layer in the Qserv system, the Large Synoptic Survey Telescope's (LSST's) prototype astronomical query system. Scalla arguably exceeded its three main design objectives: low latency, scaling, and recoverability. In retrospect, these objectives were met using a simple but effective design. Low latency was met by uniformly using linear or constant time algorithms in all high-use paths, avoiding locks whenever possible, and using compact data structures to maximize the memory caching efficiency. Scaling was achieved by architecting the system as a 64-ary tree. Nodes can be added easily and as the number of nodes increases, search performance increases at an exponential rate. Recoverability is inherent in that no permanent state information is maintained and whatever state information is needed it can be quickly constructed or reconstructed in real time. This allows dynamic changes in a cluster of servers with little impact on over-all performance or usability. Today, Scalla is being deployed in environments and for uses that were never conceived in 2001. This speaks well for the systems adaptability but the underlying reason is that the system can meet its three fundamental objectives at the same time.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2013

A double photomultiplier Compton camera and its readout system for mice imaging

We have designed a Compton Camera (CC) to image the bio-distribution of gamma-emitting radiopharmaceuticals in mice. A CC employs the 'electronic collimation', i.e. a technique that traces the gamma-rays instead of selecting them with physical lead or tungsten collimators. To perform such a task, a CC measures the parameters of the Compton interaction that occurs in the device itself. At least two detectors are required: one (tracker), where the primary gamma undergoes a Compton interaction and a second one (calorimeter), in which the scattered gamma is completely absorbed. Eventually the polar angle and hence a 'cone' of possible incident directions are obtained (event with 'incomplete geometry'). Different solutions for the two detectors are proposed in the literature: our design foresees two similar Position Sensitive Photomultipliers (PMT, Hamamatsu H8500). Each PMT has 64 output channels that are reduced to 4 using a charge multiplexed readout system, i.e. a Series Charge Multiplexing net of resistors. Triggering of the system is provided by the coincidence of fast signals extracted at the last dynode of the PMTs. Assets are the low cost and the simplicity of design and operation, having just one type of device; among drawbacks there is a lower resolution with respect to more sophisticated trackers and full 64 channels Readout. This paper does compare our design of our two-Hamamatsu CC to other solutions and shows how the spatial and energy accuracy is suitable for the inspection of radioactivity in mice.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2016

WE-AB-207B-03: A Computational Methodology for Determination of CTV-To-PTV Margins with Inter Fractional Shape Variations Based On a Statistical Point Distribution Model for Prostate Cancer Radiation Therapy

Purpose: Our assumption was that interfractional shape variations of target volumes could not be negligible for determination of clinical target volume (CTV)-to-planning target volume (PTV) margins. The aim of this study was to investigate this assumption as a simulation study by developing a computational framework of CTV-to-PTV margins with taking the interfractional shape variations into account based on point distribution model (PDM) Methods: The systematic and random errors for interfractional shape variations and translations of target volumes were evaluated for four types of CTV regions (only a prostate, a prostate plus proximal 1-cm seminal vesicles, a prostate plus proximal 2-cm seminal vesicles, and a prostate plus whole seminal vesicles). The CTV regions were delineated depending on prostate cancer risk groups on planning computed tomography (CT) and cone beam CT (CBCT) images of 73 fractions of 10 patients. The random and systematic errors for shape variations of CTV regions were derived from PDMs of CTV surfaces for all fractions of each patient. Systematic errors of shape variations of CTV regions were derived by comparing PDMs between planning CTV surfaces and average CTV surfaces. Finally, anisotropic CTV-to-PTV margins with shape variations in 6 directions (anterior, posterior, superior, inferior, right, and left) were computed by using a van Herk margin formula. Results: Differences between CTV-to-PTV margins with and without shape variations ranged from 0.7 to 1.7 mm in anterior direction, 1.0 to 2.8 mm in posterior direction, 0.8 to 2.8 mm in superior direction, 0.6 to 1.6 mm in inferior direction, 1.4 to 4.4 mm in right direction, and 1.3 to 5.2 mm in left direction. Conclusion: More than 1.0 mm additional margins were needed at least in 3 directions to guarantee CTV coverage due to shape variations. Therefore, shape variations should be taken into account for the determination of CTV-to-PTV margins.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Implementing efficient data compression and encryption in a persistent key-value store for HPC

Recently, persistent data structures, like key-value stores (KVSs), which are stored in a high-performance computing (HPC) system’s nonvolatile memory, provide an attractive solution for a number of emerging challenges like limited I/O performance. Data compression and encryption are two well-known techniques for improving several properties of such data-oriented systems. This article investigates how to efficiently integrate data compression and encryption into persistent KVSs for HPC with the ultimate goal of hiding their costs and complexity in terms of performance and ease of use. Our compression technique exploits deep memory hierarchy in an HPC system to achieve both storage reduction and performance improvement. Our encryption technique provides a practical level of security and enables sharing of sensitive data securely in complex scientific workflows with nearly imperceptible cost. We implement the proposed techniques on top of a distributed embedded KVS to evaluate the benefits and costs of incorporating these capabilities along different points in the dataflow path, illustrating differences in effective bandwidth, latency, and additional computational expense on Swiss National Supercomputing Centre’s Grand Tavé and National Energy Research Scientific Computing Center’s Cori.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

An Optimized Parameterization of Sub‐Grid Scale Advection for Convection Permitting Models

Convection‐permitting models (CPMs) explicitly resolve deep convection yet under‐resolve the organized lateral exchanges among drafts and their environment that control entrainment/detrainment, precipitation efficiency, and mesoscale structure. In this work, we introduce the Optimized Advection Scheme (OAS), which introduces a small rotation of the Cartesian frame of reference for the horizontal winds relative to other variables used in advection that induces cross‐gradient transport to mimic under‐resolved convective mixing. The rotation angle is selected to minimize the Kullback–Leibler divergence between the simulated and satellite observed precipitation intensity distributions, yielding a physically consistent perturbation that is computationally inexpensive and portable. Optimized Advection Scheme is implemented in WRF and evaluated over Amazon (April 2014). It shifts precipitation–precipitable‐water joint distributions toward lighter rain, reduces overly intense rates, and improves mesoscale convective system (MCS) lifetime and propagation. Mechanistically, the added cross‐gradient transport promotes convective detrainment and environmental mixing, which cools and moistens the mid‐troposphere, weakens downward momentum transport, alleviates excessive downwelling shortwave biases, and warms the surface temperature. The optimized rotation angle yields comparable improvements at 4‐km and 1‐km grid spacing, demonstrating resolution‐independent benefits across the CPM gray zone. By targeting the dynamical root of under‐mixed convective circulations, rather than tuning model microphysics or closures, OAS delivers robust, scale‐aware improvements in precipitation statistics, cloud vertical structure, and characteristics of MCS (MCSs), offering a practical pathway to more reliable CPM simulations for weather and climate applications.

CPM↗
DOE OSTI2016

SUPPLEMENT: “THE RATE OF BINARY BLACK HOLE MERGERS INFERRED FROM ADVANCED LIGO OBSERVATIONS SURROUNDING GW150914” (2016, ApJL, 833, L1)

This article provides supplemental information for a Letter reporting the rate of (BBH) coalescences inferred from 16 days of coincident Advanced LIGO observations surrounding the transient (GW) signal GW150914. In that work we reported various rate estimates whose 90% confidence intervals fell in the range 2–600 Gpc{sup −3} yr{sup −1}. Here we give details on our method and computations, including information about our search pipelines, a derivation of our likelihood function for the analysis, a description of the astrophysical search trigger distribution expected from merging BBHs, details on our computational methods, a description of the effects and our model for calibration uncertainty, and an analytic method for estimating our detector sensitivity, which is calibrated to our measurements.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2011

Method and structure for skewed block-cyclic distribution of lower-dimensional data arrays in higher-dimensional processor grids

A method and structure of distributing elements of an array of data in a computer memory to a specific processor of a multi-dimensional mesh of parallel processors includes designating a distribution of elements of at least a portion of the array to be executed by specific processors in the multi-dimensional mesh of parallel processors. The pattern of the designating includes a cyclical repetitive pattern of the parallel processor mesh, as modified to have a skew in at least one dimension so that both a row of data in the array and a column of data in the array map to respective contiguous groupings of the processors such that a dimension of the contiguous groupings is greater than one.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Impact of Real-Time Image Gating on Spot Scanning Proton Therapy for Lung Tumors: A Simulation Study

Purpose: To investigate the effectiveness of real-time-image gated proton beam therapy for lung tumors and to establish a suitable size for the gating window (GW). Methods and Materials: A proton beam gated by a fiducial marker entering a preassigned GW (as monitored by 2 fluoroscopy units) was used with 7 lung cancer patients. Seven treatment plans were generated: real-time-image gated proton beam therapy with GW sizes of ±1, 2, 3, 4, 5, and 8 mm and free-breathing proton therapy. The prescribed dose was 70 Gy (relative biological effectiveness)/10 fractions to 99% of the target. Each of the 3-dimensional marker positions in the time series was associated with the appropriate 4-dimensional computed tomography phase. The 4-dimensional dose calculations were performed. The dose distribution in each respiratory phase was deformed into the end-exhale computed tomography image. The D99 and D5 to D95 of the clinical target volume scaled by the prescribed dose with criteria of D99 >95% and D5 to D95 <5%, V20 for the normal lung, and treatment times were evaluated. Results: Gating windows ≤ ±2 mm fulfilled the CTV criteria for all patients (whereas the criteria were not always met for GWs ≥ ±3 mm) and gave an average reduction in V20 of more than 17.2% relative to free-breathing proton therapy (whereas GWs ≥ ±4 mm resulted in similar or increased V20). The average (maximum) irradiation times were 384 seconds (818 seconds) for the ±1-mm GW, but less than 226 seconds (292 seconds) for the ±2-mm GW. The maximum increased considerably at ±1-mm GW. Conclusion: Real-time-image gated proton beam therapy with a GW of ±2 mm was demonstrated to be suitable, providing good dose distribution without greatly extending treatment time.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2017

Optimum aggregation of geographically distributed flexible resources in strategic smart-grid/microgrid locations

This paper determines optimum aggregation areas for a given distribution network considering spatial distribution of loads and costs of aggregation. An elitist genetic algorithm combined with a hierarchical clustering and a Thevenin network reduction is implemented to compute strategic locations and aggregate demand within each area. The aggregation reduces large distribution networks having thousands of nodes to an equivalent network with few aggregated loads, thereby significantly reducing the computational burden. Furthermore, it not only helps distribution system operators in making faster operational decisions by understanding during which time of the day will be in need of flexibility, from which specific area, and in which amount, but also enables the flexibilities stemming from small distributed resources to be traded in various power/energy markets. A combination of central and local aggregation scheme where a central aggregator enables market participation, while local aggregators materialize the accepted bids, is implemented to realize this concept. The effectiveness of the proposed method is evaluated by comparing network performances with and without aggregation. Finally, for a given network configuration, steady-state performance of aggregated network is significantly accurate (≈ ±1.5% error) compared to very high errors associated with forecast of individual consumer demand.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

New Basis Set Exchange: An Open, Up-to-date Resource for the Molecular Sciences Community

In computational quantum chemistry, the basis set is a fundamental input to many types of simulations, and the choice of basis set can have dramatic effects on both the accuracy and performance of the simulation. Due to this fundamental nature, basis sets have been developed starting at the beginning of the computational chemistry field, and extending to the present day, with new basis sets taking into account new theories and methods now accessible due to increases in computing power. Practically, computations are most comparable when they use the same basis set. However, early distribution channels often led to differing incorporation of basis sets indifferent computational chemistry codes, harming reproducibility and introducing errors in calculations that can go unnoticed. Such errors can be due to many causes, including transcription errors, neglecting publication of the full precision of numerical values, updated values not being incorporated in a timely manner, or development of an ‘improved’ version by different developers that retains the same name as the original basis set. Therefore, there was a need to store basis sets in a central location and make them easily and freely accessible by any researcher. The Basis Set Exchange (BSE) is widely considered by the field to be such a resource.

basis set, ab initio, web application, web interfa↗
DOE OSTI2018

Toward a smart data transfer node

Scientific computing systems are becoming significantly more complex, with distributed teams and complex workflows spanning resources from telescopes and light sources to fast networks and Internet of Things sensor systems. In such settings, no single, centralized administrative team and software stack can coordinate and manage all resources used by a single application. Indeed, we have reached a critical limit in manageability using current human-in-the-loop techniques. We therefore argue that resources must begin to respond automatically, adapting and tuning their behavior in response to observed properties of scientific workflows. Over time, machine learning methods can be used to identify effective strategies for autonomic, goal-driven management behaviors that can be applied end-to-end across the scientific computing landscape. Using the data transfer nodes that are widely deployed in modern research networks as an example, we explore the architecture, methods, and algorithms needed for a smart data transfer node to support future scientific computing systems that self-tune and self-manage.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Computing and Visualizing Reachable Volumes for Maneuvering Satellites

Detecting and predicting maneuvering satellites is an important problem for Space Situational Awareness. The spatial envelope of all possible locations within reach of such a maneuvering satellite is known as the Reachable Volume (RV). As soon as custody of a satellite is lost, calculating the RV and its subsequent time evolution is a critical component in the rapid recovery of the satellite. In this paper, we present a Monte Carlo approach to computing the RV for a given object. Essentially, our approach samples all possible trajectories by randomizing thrust-vectors, thrust magnitudes and time of burn. At any given instance, the distribution of the 'point-cloud' of the virtual particles defines the RV. For short orbital time-scales, the temporal evolution of the point-cloud can result in complex, multi-reentrant manifolds. Visualization plays an important role in gaining insight and understanding into this complex and evolving manifold. In the second part of this paper, we focus on how to effectively visualize the large number of virtual trajectories and the computed RV. We present a real-time out-of-core rendering technique for visualizing the large number of virtual trajectories. We also examine different techniques for visualizing the computed volume of probability density distribution, including volume slicing, convex hull and isosurfacing. We compare and contrast these techniques in terms of computational cost and visualization effectiveness, and describe the main implementation issues encountered during our development process. Finally, we will present some of the results from our end-to-end system for computing and visualizing RVs using examples of maneuvering satellites.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Space charge studies in FFAG using the tracking code Zgoubi

A method is implemented in Zgoubi that allows the computation of space charge effects in 2D distributions and with some restrictions in 3D distributions. It relies on decomposing field maps or analytical elements into slices and applying a space charge kick to the particles. The aim of this study is to investigate the accuracy of this technique, its limitations/advantages by comparisons with other linear/nonlinear computation methods and codes, and to apply it to high power fixed field ring design studies.

43 PARTICLE ACCELERATORS↗