Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithms”

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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Entrainment and aerosol effects on marine boundary-layer clouds: An investigation using ACE-ENA data from HOLODEC, G1, Pico and ACTOS (Final Report on Project Activities)

Marine boundary-layer clouds cover large regions of the globe and are known to strongly influence radiative balances. The microphysical properties and persistence of these clouds are tightly coupled with cloud-top entrainment and aerosol properties within both the boundary layer and the overlying free troposphere. This work addressed the microphysical response to entrainment and aerosol properties in marine stratocumulus clouds, using data from the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) project. Specifically, emphasis was placed on 1. extensive in situ measurements taken with the Atmospheric Radiation Measurement (ARM) G1 aircraft using the Holographic Detector for Clouds (Holodec) instrument; 2. airborne measurements obtained with the helicopter-borne Airborne Cloud Turbulence Observation System (ACTOS) operated by the Leibniz Institute for Tropospheric Research (TROPOS) during the first phase of ACE-ENA; and 3. above-boundary-layer, mountain-top measurements taken at the Pico Mountain Observatory (OMP) by the research group of the co-investigator and scientists from TROPOS during the first phase of ACE-ENA. The work is aligned with the topic “Warm Boundary-Layer Atmospheric Processes.” Key results include the following. Data from the Holographic Detector for Clouds (Holodec) were reprocessed, refined, and validated through a careful instrument intercomparison, resulting in a high-quality dataset available on the ARM archive for ACE-ENA. High-resolution ACTOS measurements of thermodynamics, microphysical, and turbulence properties were analyzed to explore the behavior of the entrainment velocity at cloud top. Analysis of the vertical variability of cloud droplet size distribution shape suggests that mixing is more inhomogeneous near cloud top, and more homogeneous deeper into the cloud. Analysis of aerosol measurements from OMP explored the mixing state and cloud condensation nucleus properties, as well as the implications for radiative forcing. Finally, a machine learning algorithm was developed for identifying characteristic cloud droplet size distributions, and was employed to explore microphysical regimes in stratocumulus clouds observed during ACE-ENA. The characteristic size distributions are narrow, and only when spatially averaged do they produce the broad “gamma” distributions typically assumed in models. This implies that precipitation development should account for variability and correlations in the distribution shape as well as the number concentration of cloud droplets.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Towards Resilient Design of Leader-following Consensus with Attack Identification and Privacy Preservation Capabilities

This paper considers a leader-following consensus in the presence of unknown but bounded cyber-attacks. Specifically, we consider the following cyber-attack scenarios: (i) an attacker aims to destabilize the consensus dynamics by injecting exogenous signals to both the actuators of the followers and/or the communication network, (ii) an eavesdropper adversary aims to obtain information on the physical state of the agents. To this end, a novel resilient leader-following consensus algorithm based on a competitive interaction method is proposed. In addition, it is demonstrated that by appropriately choosing the information exchanged between the agents, the proposed control framework also enables the cooperative system to either distributively identify the compromised communication links in real-time or to protect the privacy of the physical state of the agents from the eavesdropper. Here, a numerical example is provided to illustrate the proposed resilient control algorithms.

Gusrialdi, Azwirman↗
DOE OSTI2018

Robust Localization of an Arbitrary Distribution of Radioactive Sources for Aerial Inspection - 18094

Radiation source detection has seen various applications in the past decade, ranging from the detection of dirty bombs in public places to scanning critical nuclear facilities for leakage or flaws, and in the autonomous inspection of nuclear sites. Despite the success in detecting single point sources, or a small number of spatially separated point sources, most of the existing algorithms fail to localize sources in complex scenarios with a large number of point sources or non-trivial distributions and bulk sources. Even in simpler environments, most existing algorithms are not scalable to larger regions and/or higher dimensional spaces. For effective autonomous inspection, we not only need to estimate the positions of the sources, but also the number, distribution and intensities of each of them. In this paper, we present a novel algorithm for the robust localization of an arbitrary distribution of radiation sources using multi-layer sequential Monte Carlo methods coupled with suitable clustering algorithms. We achieve near-perfect accuracy, in terms of F1-scores (> 0.95), while allowing the algorithm to scale, both to large regions in space, and to higher dimensional spaces (5 tested). (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2018

A Parallel Solver for Graph Laplacians

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.

Konolige, Tristan↗
DOE OSTI2017

Casimir meets Poisson: improved quark/gluon discrimination with counting observables

Charged track multiplicity is among the most powerful observables for discriminating quark- from gluon-initiated jets. Despite its utility, it is not infrared and collinear (IRC) safe, so perturbative calculations are limited to studying the energy evolution of multiplicity moments. While IRC-safe observables, like jet mass, are perturbatively calculable, their distributions often exhibit Casimir scaling, such that their quark/gluon discrimination power is limited by the ratio of quark to gluon color factors. In this paper, we introduce new IRC-safe counting observables whose discrimination performance exceeds that of jet mass and approaches that of track multiplicity. The key observation is that track multiplicity is approximately Poisson distributed, with more suppressed tails than the Sudakov peak structure from jet mass. By using an iterated version of the soft drop jet grooming algorithm, we can define a “soft drop multiplicity” which is Poisson distributed at leading-logarithmic accuracy. In addition, we calculate the next-to-leading-logarithmic corrections to this Poisson structure. If we allow the soft drop groomer to proceed to the end of the jet branching history, we can define a collinear-unsafe (but still infrared-safe) counting observable. Exploiting the universality of the collinear limit, we define generalized fragmentation functions to study the perturbative energy evolution of collinear-unsafe multiplicity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

An efficient reconstruction algorithm for differential phase-contrast tomographic images from a limited number of views

The main focus of this paper is reconstruction of tomographic phase-contrast image from a set of projections. We propose an efficient reconstruction algorithm for differential phase-contrast computed tomography that can considerably reduce the number of projections required for reconstruction. The key result underlying this research is a projection theorem that states that the second derivative of the projection set is linearly related to the Laplacian of the tomographic image. The proposed algorithm first reconstructs the Laplacian image of the phase-shift distribution from the second-derivative of the projections using total variation regularization. The second step is to obtain the phase-shift distribution by solving a Poisson equation whose source is the Laplacian image previously reconstructed under the Dirichlet condition. We demonstrate the efficacy of this algorithm using both synthetically generated simulation data and projection data acquired experimentally at a synchrotron. The experimental phase data were acquired from a human coronary artery specimen using dark-field-imaging optics pioneered by our group. Our results demonstrate that the proposed algorithm can reduce the number of projections to approximately 33% as compared with the conventional filtered backprojection method, without any detrimental effect on the image quality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Select Advances in Computational Accelerator Physics

Computational accelerator physics has changed and broadened over the last decade or so. Part of the change is due to the advent of multiple ways of parallel computing. Another part comes from algorithmic developments. The multiple ways of parallel computing include distributed memory parallelism and on-chip parallelism, with the latter coming from architectures (CPU and GPU) having multiple processing elements (cores or streaming multiprocessors) and wide vector (SIMD) instruction units. The basics of these new architectures and their application to computational accelerator physics are briefly reviewed. Algorithmic advances in the select areas of spin tracking, cavity calculations, plasma acceleration, and electron cooling are also reviewed. In some cases the algorithms provide increased fidelity improving the overall accuracy, while in other cases, such as controlled dispersion, the algorithms provide increased fidelity by better modeling the essential physical interaction. Finally, the use of computational frameworks, which provide the basic computational infrastructure, while allowing the capability developer to concentrate on the math and physics, is reviewed in the context of the Vorpal application, which has found use across accelerator physics and many other fields.

Engineering↗
DOE OSTI2018

Machine learning based energy management system for grid disaster mitigation

The recent increase in infiltration of distributed resources has challenged the traditional operation of power systems. Simultaneously, devastating effects of recent natural disasters have questioned the resilience of power infrastructure for an electricity dependent community. In this study, a solution has been presented in the form of a resilient smart grid network which utilizes Distributed Energy Resources (DERs) and Machine Learning (ML) algorithms to improve the power availability during disastrous events. In addition to power electronics with load categorization features, the presented system utilizes ML tools to use the information from neighbouring units and external sources to make complicated logical decisions directed towards provide power to critical loads at all times. Furthermore, provided model encourages consideration of ML tools as a part of smart grid design process together with power electronics and controls, not as an additional feature.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Cloud-based Testbed for Adaptive Under-Frequency Load Shedding with High DER Penetration

Increasing penetration of distributed energy resources and behind-the-meter renewables may soon disrupt the efficacy of critical protection schemes, such as under-frequency load shedding (UFLS). Improved data exchange and coordination across the transmission-distribution boundary will be required to maintain reliability of bulk electric system. Standards-based data integration platforms using agreed-upon semantic vocabularies, such as the Common Information Model, will be key to enabling adaptive protection schemes requiring synthesized data from both the bulk power system and behind-the-meter resources. This paper introduces a cloud-based open-source data integration environment and UFLS clustering algorithm being developed to enable adaptive relay coordination between transmission and distribution utilities in the state of Vermont.

Anderson, Alexander A.↗
DOE OSTI2018

A New LMP-Sensitivity-Based Heterogeneous Decomposition for Transmission and Distribution Coordinated Economic Dispatch

Transmission and distribution coordinated economic dispatch (TDCED) will be necessary to settle the problems caused by high penetrations of distributed generators in future grids. An efficient heterogeneous decomposition algorithm (HGD) was proposed to solve the TDCED, but it may diverge occasionally. To overcome this shortcoming, a new HGD (N-HGD) with enhanced convergency is proposed and studied in this paper. Compared with the previous HGD, the N-HGD similarly decomposes the TDCED into transmission ED and distribution ED subproblems, but it considers the sensitivity of the boundary locational marginal price to load injections to enhance convergency and avoid divergence. Two kinds of sensitivity computing methods, M-c and M-p, are studied. M-c is based on a centralized sensitivity equation, executed on the transmission side. M-p is based on a probing mechanism and can be executed distributedly on the distribution side. The reason for the N-HGD's improved convergency is theoretically analyzed, and the optimality is proven. Numerical tests show that N-HGD performs better than the original HGD, as well as a penalty-based modified HGD that needs a careful parametertuning process. Furthermore, compared with M-c, an M-p-based N-HGD is preferable because it has a much lower computational cost and no additional communicational cost.

distribution↗
DOE OSTI2014

A nonvoxel-based dose convolution/superposition algorithm optimized for scalable GPU architectures

Purpose: Real-time adaptive planning and treatment has been infeasible due in part to its high computational complexity. There have been many recent efforts to utilize graphics processing units (GPUs) to accelerate the computational performance and dose accuracy in radiation therapy. Data structure and memory access patterns are the key GPU factors that determine the computational performance and accuracy. In this paper, the authors present a nonvoxel-based (NVB) approach to maximize computational and memory access efficiency and throughput on the GPU. Methods: The proposed algorithm employs a ray-tracing mechanism to restructure the 3D data sets computed from the CT anatomy into a nonvoxel-based framework. In a process that takes only a few milliseconds of computing time, the algorithm restructured the data sets by ray-tracing through precalculated CT volumes to realign the coordinate system along the convolution direction, as defined by zenithal and azimuthal angles. During the ray-tracing step, the data were resampled according to radial sampling and parallel ray-spacing parameters making the algorithm independent of the original CT resolution. The nonvoxel-based algorithm presented in this paper also demonstrated a trade-off in computational performance and dose accuracy for different coordinate system configurations. In order to find the best balance between the computed speedup and the accuracy, the authors employed an exhaustive parameter search on all sampling parameters that defined the coordinate system configuration: zenithal, azimuthal, and radial sampling of the convolution algorithm, as well as the parallel ray spacing during ray tracing. The angular sampling parameters were varied between 4 and 48 discrete angles, while both radial sampling and parallel ray spacing were varied from 0.5 to 10 mm. The gamma distribution analysis method (γ) was used to compare the dose distributions using 2% and 2 mm dose difference and distance-to-agreement criteria, respectively. Accuracy was investigated using three distinct phantoms with varied geometries and heterogeneities and on a series of 14 segmented lung CT data sets. Performance gains were calculated using three 256 mm cube homogenous water phantoms, with isotropic voxel dimensions of 1, 2, and 4 mm. Results: The nonvoxel-based GPU algorithm was independent of the data size and provided significant computational gains over the CPU algorithm for large CT data sizes. The parameter search analysis also showed that the ray combination of 8 zenithal and 8 azimuthal angles along with 1 mm radial sampling and 2 mm parallel ray spacing maintained dose accuracy with greater than 99% of voxels passing the γ test. Combining the acceleration obtained from GPU parallelization with the sampling optimization, the authors achieved a total performance improvement factor of >175 000 when compared to our voxel-based ground truth CPU benchmark and a factor of 20 compared with a voxel-based GPU dose convolution method. Conclusions: The nonvoxel-based convolution method yielded substantial performance improvements over a generic GPU implementation, while maintaining accuracy as compared to a CPU computed ground truth dose distribution. Such an algorithm can be a key contribution toward developing tools for adaptive radiation therapy systems.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Quasi-separatrix layers induced by ballooning instability in the near-Earth magnetotail

Magnetic reconnection processes in the near-Earth magnetotail can be highly three-dimensional (3-D) in geometry and dynamics, even though the magnetotail configuration itself is nearly two-dimensional due to the symmetry in the dusk–dawn direction. Such reconnection processes can be induced by the 3-D dynamics of nonlinear ballooning instability. In this work, we explore the global 3-D geometry of the reconnection process induced by ballooning instability in the near-Earth magnetotail by examining the distribution of quasi-separatrix layers associated with plasmoid formation in the entire 3-D domain of magnetotail configuration, using an algorithm previously developed in the context of solar physics. The 3-D distribution of quasi-separatrix layers (QSLs) as well as their evolution directly follow the plasmoid formation during the nonlinear development of ballooning instability in both time and space. Such a close correlation demonstrates a strong coupling between the ballooning and the corresponding reconnection processes. It further confirms the intrinsic 3-D nature of the ballooning-induced plasmoid formation and reconnection processes, in both geometry and dynamics. In addition, the reconstruction of the 3-D QSL geometry may provide an alternative means of identifying the location and timing of 3-D reconnection sites in the magnetotail from both numerical simulations and satellite observations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗
DOE OSTI2015

Evaluation of an empirical monitor output estimation in carbon ion radiotherapy

Purpose: A conventional broad beam method is applied to carbon ion radiotherapy at Gunma University Heavy Ion Medical Center. According to this method, accelerated carbon ions are scattered by various beam line devices to form 3D dose distribution. The physical dose per monitor unit (d/MU) at the isocenter, therefore, depends on beam line parameters and should be calibrated by a measurement in clinical practice. This study aims to develop a calculation algorithm for d/MU using beam line parameters. Methods: Two major factors, the range shifter dependence and the field aperture effect, are measured via PinPoint chamber in a water phantom, which is an identical setup as that used for monitor calibration in clinical practice. An empirical monitor calibration method based on measurement results is developed using a simple algorithm utilizing a linear function and a double Gaussian pencil beam distribution to express the range shifter dependence and the field aperture effect. Results: The range shifter dependence and the field aperture effect are evaluated to have errors of 0.2% and 0.5%, respectively. The proposed method has successfully estimated d/MU with a difference of less than 1% with respect to the measurement results. Taking the measurement deviation of about 0.3% into account, this result is sufficiently accurate for clinical applications. Conclusions: An empirical procedure to estimate d/MU with a simple algorithm is established in this research. This procedure allows them to use the beam time for more treatments, quality assurances, and other research endeavors.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study

Traditional implementations of parallel graph operations on distributed memory platforms are written using Message Passing Interface (MPI) point to point communication primitives such as Send-Recv (blocking and nonblocking). Apart from this classical model, the MPI community has over the years added other communication models; however, their suitability for handling the irregular traffic workloads typical of graph operations remain comparatively less explored. Our aim in this paper is to study these relatively underutilized communication models of MPI for graph applications. More specifically, we evaluate MPI’s one-sided programming, or Remote Memory Access (RMA), and nearest neighborhood collectives using a process graph topology. There are features in these newer models that are intended to better map to irregular communication patterns, as exemplified in graph algorithms. As a concrete application for our case study, we use distributed memory implementations of a weighted graph matching algorithm to investigate performances of MPI-3 RMA and neighborhood collective operations compared to nonblocking Send- Recv. A matching in a graph is a subset of edges such that no two matched edges are incident on the same vertex. A maximum weight matching is a matching of maximum weight computed as the sum of the weights of matched edges. Algorithms for optimal matching have quadratic complexity and are difficult to parallelize. More importantly, execution of graph matching is dominated by high volume of irregular memory accesses, making it an ideal candidate for studying the effects of various MPI communication models on graph applications at scale. Our neighborhood collectives and RMA implementations yields up to 6× speedup over traditional optimized nonblocking Send-Recv implementations, on thousands of cores of the NERSC Cori supercomputer. We believe the lessons learned from this case study can be adopted to benefit a wider range of graph application codes.

Ghosh, Sayan↗
DOE OSTI2024

A remote sensing algorithm for vertically resolved cloud condensation nuclei number concentrations from airborne and spaceborne lidar observations

Cloud condensation nuclei (CCN) are mediators of aerosol–cloud interactions (ACIs), contributing to the largest uncertainties in the understandings of global climate change. We present a novel remote-sensing-based algorithm that quantifies the vertically resolved CCN number concentrations (N CCN ) using aerosol optical properties measured by a multiwavelength lidar. The algorithm considers five distinct aerosol subtypes with bimodal size distributions. The inversion used the lookup tables developed in this study, based on the observations from the Aerosol Robotic Network, to efficiently retrieve optimal particle size distributions from lidar measurements. The method derives dry aerosol optical properties by implementing hygroscopic enhancement factors in lidar measurements. The retrieved optically equivalent particle size distributions and aerosol-type-dependent particle composition are utilized to calculate critical diameters using κ-Köhler theory and N CCN at six supersaturations ranging from 0.07 % to 1.0 %. Sensitivity analyses indicate that uncertainties in extinction coefficients and relative humidity greatly influence the retrieval error in N CCN . The potential of this algorithm is further evaluated by retrieving N CCN using airborne lidar from the NASA ObseRvations of Aerosols above CLouds and their intEractionS (ORACLES) campaign and is validated against simultaneous measurements from the CCN counter. The independent validation with robust correlation demonstrates promising results. Furthermore, the N CCN has been retrieved for the first time using a proposed algorithm from spaceborne lidar – Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) – measurements. The application of this new capability demonstrates the potential for constructing a 3D CCN climatology at a global scale, which helps to better quantify ACI effects and thus reduce the uncertainty in aerosol climate forcing.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2015

A Distributed Cooperative Power Allocation Method for Campus Buildings

We propose a coordination algorithm for cooperative power allocation among a collection of commercial buildings within a campus. We introduced thermal and power models of a typical commercial building Heating, Ventilation, and Air Conditioning (HVAC) system, and utilize model predictive control to characterize their power flexibility. The power allocation problem is formulated as a cooperative game using the Nash Bargaining Solution (NBS) concept, in which buildings collectively maximize the product of their utilities subject to their local flexibility constraints and a total power limit set by the campus coordinator. To solve the optimal allocation problem, a distributed protocol is designed using dual decomposition of the Nash bargaining problem. Numerical simulations are performed to demonstrate the efficacy of our proposed allocation method

Hao, He↗
DOE OSTI2023

Hardware-in-the-Loop Evaluation of Grid-Edge DER Chip Integration Into Next-Generation Smart Meters

To facilitate the implementation of distributed energy resource management systems (DERMS), we propose to insert a grid-edge distributed energy resource (DER) chip hosting a DERMS algorithm into the next generation of smart meters. This will create a pathway for the wide adoption of DERMS technology because many utilities plan to invest in advanced metering infrastructure in the near future. This will also bridge the gap between an electrical power utility and DERs behind the meter. The DER chip is designed to follow power direction signals from the DERMS coordinator while balancing its local objectives. We tested the chip using a controller- and power-hardware-in-the-loop evaluation under three scenarios that a DERMS could face in the real world. The DER chip was capable of and effective at directing four heterogeneous DERs to respond to a DERMS coordinator for grid services (e.g., voltage regulation and a virtual power plant).

distributed energy resource management system↗