Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithm”

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,315 records · Page 73

Search for a Signature of Interaction between Relativistic Jet and Progenitor in Gamma-Ray Bursts

The time variability of prompt emission in gamma-ray bursts (GRBs) is expected to originate from the temporal behavior of the central engine activity and the jet propagation in the massive stellar envelope. Using a pulse search algorithm for bright GRBs, we investigate the time variability of gamma-ray light curves to search a signature of the interaction between the jet and the inner structure of the progenitor. Since this signature might appear in the earlier phase of prompt emission, we divide the light curves into the initial phase and the late phase by referring to the trigger time and the burst duration of each GRB. We also adopt this algorithm for GRBs associated with supernovae/hypernovae that certainly are accompanied by massive stars. However, there is no difference between each pulse interval distribution described by a lognorma distribution in the two phases. We confirm that this result can be explained by the photospheric emission model if the energy injection of the central engine is not steady or completely periodic but episodic and described by the lognormal distribution with a mean of ∼1 s.

79 ASTRONOMY AND ASTROPHYSICS↗

Improving the efficiency of configurational-bias Monte Carlo: A density-guided method for generating bending angle trials for linear and branched molecules

A new method has been developed to generate bending angle trials to improve the acceptance rate and the speed of configurational-bias Monte Carlo. Whereas traditionally the trial geometries are generated from a uniform distribution, in this method we attempt to use the exact probability density function so that each geometry generated is likely to be accepted. In actual practice, due to the complexity of this probability density function, a numerical representation of this distribution function would be required. This numerical table can be generated a priori from the distribution function. This method has been tested on a united-atom model of alkanes including propane, 2-methylpropane, and 2,2-dimethylpropane, that are good representatives of both linear and branched molecules. It has been shown from these test cases that reasonable approximations can be made especially for the highly branched molecules to reduce drastically the dimensionality and correspondingly the amount of the tabulated data that is needed to be stored. Despite these approximations, the dependencies between the various geometrical variables can be still well considered, as evident from a nearly perfect acceptance rate achieved. For all cases, the bending angles were shown to be sampled correctly by this method with an acceptance rate of at least 96% for 2,2-dimethylpropane to more than 99% for propane. Since only one trial is required to be generated for each bending angle (instead of thousands of trials required by the conventional algorithm), this method can dramatically reduce the simulation time. The profiling results of our Monte Carlo simulation code show that trial generation, which used to be the most time consuming process, is no longer the time dominating component of the simulation.

2-2-DIMETHYLPROPANE↗

Hierarchical Linear Regression (Rev. 1)

We describe an algorithm for making inferences in a hierarchical linear model. The model allows different slopes and intercepts for different groups, and ties together the different slopes by representing them as samples from a higher level distribution. (The intercepts are treated as statistically independent.) Our model and code permit many options for the variance of this hierarchical distribution for the slopes, including gamma distributions on the precision, t-distributions on the standard error, pooled slopes (all equal), and independent slopes. The algorithm is described in the paper; an implementation of the algorithm in R is available on request.

97 MATHEMATICS AND COMPUTING↗

The local dark matter phase-space density and impact on WIMP direct detection

We present a new determination of the local dark matter phase-space density. This result is obtained implementing, in the limit of isotropic velocity distribution and spherical symmetry, Eddington's inversion formula, which links univocally the dark matter distribution function to the density profile, and applying, within a Bayesian framework, a Markov Chain Monte Carlo algorithm to sample mass models for the Milky Way against a broad and variegated sample of dynamical constraints. We consider three possible choices for the dark matter density profile, namely the Einasto, NFW and Burkert profiles, finding that the velocity dispersion, which characterizes the width in the distribution, tends to be larger for the Burkert case, while the escape velocity depends very weakly on the profile, with the mean value we obtain being in very good agreement with estimates from stellar kinematics. The derived dark matter phase-space densities differ significantly — most dramatically in the high velocity tails — from the model usually taken as a reference in dark matter detection studies, a Maxwell-Boltzmann distribution with velocity dispersion fixed in terms of the local circular velocity and with a sharp truncation at a given value of the escape velocity. We discuss the impact of astrophysical uncertainties on dark matter scattering rates and direct detection exclusion limits, considering a few sample cases and showing that the most sensitive ones are those for light dark matter particles and for particles scattering inelastically. As a general trend, regardless of the assumed profile, when adopting a self-consistent phase-space density, we find that rates are larger, and hence exclusion limits stronger, than with the standard Maxwell-Boltzmann approximation. Tools for applying our result on the local dark matter phase-space density to other dark matter candidates or experimental setups are provided.

79 ASTRONOMY AND ASTROPHYSICS↗

Modular performance prediction for scientific workflows using Machine Learning

Scientific workflows provide an opportunity for declarative computational experiment design in an intuitive and efficient way. A distributed workflow is typically executed on a variety of resources, and it uses a variety of computational algorithms or tools to achieve the desired outcomes. Such a variety imposes additional complexity in scheduling these workflows on large scale computers. As computation becomes more distributed, insights into expected workload that a workflow presents become critical for effective resource allocation. In this paper, we present a modular framework that leverages Machine Learning for creating precise performance predictions of a workflow. The central idea is to partition a workflow in such a way that makes the task of forecasting each atomic unit manageable and gives us a way to combine the individual predictions efficiently. We recognize a combination of an executable and a specific physical resource as a single module. This gives us a handle to characterize workload and machine power as a single unit of prediction. Overall, our modular technique of creating atomic modules and deployment of longest-path approach to estimate workflow performance, allows the framework to adapt to highly complex nested directed acyclic workflows and scale to new scenarios, since it does not make assumptions of underlying workflow structure. We present performance estimation results of independent workflow modules executed on the XSEDE SDSC Comet cluster using various Machine Learning algorithms. The results provide insights into the behavior and effectiveness of different algorithms in the context of scientific workflow performance prediction.

97 MATHEMATICS AND COMPUTING↗

TH-A-19A-10: Fast Four Dimensional Monte Carlo Dose Computations for Proton Therapy of Lung Cancer

Purpose: To develop and validate a fast and accurate four dimensional (4D) Monte Carlo (MC) dose computation system for proton therapy of lung cancer and other thoracic and abdominal malignancies in which the delivered dose distributions can be affected by respiratory motion of the patient. Methods: A 4D computer tomography (CT) scan for a lung cancer patient treated with protons in our clinic was used to create a time dependent patient model using our in-house, MCNPX-based Monte Carlo system (“MC{sup 2}”). The beam line configurations for two passively scattered proton beams used in the actual treatment were extracted from the clinical treatment plan and a set of input files was created automatically using MC{sup 2}. A full MC simulation of the beam line was computed using MCNPX and a set of phase space files for each beam was collected at the distal surface of the range compensator. The particles from these phase space files were transported through the 10 voxelized patient models corresponding to the 10 phases of the breathing cycle in the 4DCT, using MCNPX and an accelerated (fast) MC code called “FDC”, developed by us and which is based on the track repeating algorithm. The accuracy of the fast algorithm was assessed by comparing the two time dependent dose distributions. Results: The error of less than 1% in 100% of the voxels in all phases of the breathing cycle was achieved using this method with a speedup of more than 1000 times. Conclusion: The proposed method, which uses full MC to simulate the beam line and the accelerated MC code FDC for the time consuming particle transport inside the complex, time dependent, geometry of the patient shows excellent accuracy together with an extraordinary speed.

60 APPLIED LIFE SCIENCES↗

CityLearn v2: energy-flexible, resilient, occupant-centric, and carbon-aware management of grid-interactive communities

As more distributed energy resources become part of the demand-side infrastructure, quantifying their energy flexibility on a community scale is crucial. CityLearn v1 provided an environment for benchmarking control algorithms. However, there is no standardized environment utilizing realistic building-stock datasets for distributed energy resource control benchmarking without co-simulation or third-party frameworks. CityLearn v2 extends CityLearn v1 by providing a stand-alone simulation environment that leverages the End-Use Load Profiles for the U.S. Building Stock dataset to create grid-interactive communities for resilient, multi-agent, and objective control of distributed energy resources with dynamic occupant feedback. While the v1 environment used pre-simulated building thermal loads, the v2 environment uses data-driven thermal dynamics and eliminates the need for co-simulation with building energy performance software. This work details the v2 environment and provides application examples that use reinforcement learning control to manage battery energy storage system, vehicle-to-grid control, and thermal comfort during heat pump power modulation.

Nweye, Kingsley↗

Parallel Programming Models and Systems for High Performance Computing. In: Emerging Research in Cloud Distributed Computing Systems

A parallel programming model is an abstraction of a parallel system that allows expression of both algorithms and shared data structures. To accommodate the diversity in parallel system architectures and user requirements, there are a variety of programming models including the models providing a shared memory view or a distributed memory view of the system. The programming models are implemented as libraries, language extensions, or compiler directives. This chapter provides a discussion on programming models and its implementations aimed at application developers, system software researchers, and hardware architects. The first part provides an overview of the programming models. The second part is an in-depth discussion on high-performance networking interface to implement the programming model. The last part of the chapter discusses implementation of a programming model with a case study. Each part of the chapter concludes with a discussion on current research trends and its impact on future architectures.

Venkata, Manjunath Gorentia↗

Determination of nuclear PDFs using Markov chain Monte Carlo methods

Global QCD analyses of nuclear parton distribution functions (nPDFs) have traditionally relied on the Hessian method for uncertainty estimation. However, the inherent Gaussian approximation and reliance on local curvature often prove insufficient for nPDF fits, which are frequently characterized by limited data constraints and non-Gaussian likelihoods. In this paper, we present the first nPDF determination based on Markov Chain Monte Carlo (MCMC) techniques, implemented within the nCTEQ framework using an adaptive Metropolis-Hastings algorithm. The MCMC approach enables a direct mapping of the posterior distribution and reveals a highly nontrivial parameter-space structure, including multiple modes and pronounced non-Gaussian behavior, particularly for the valence PDFs. We perform the first single-nucleus global analysis of lead PDFs using exclusively lead data and compare it to a multi-nuclei fit employing a standard analytic A dependence. The inclusion of lighter nuclei reduces quark uncertainties and modifies the shape of the lead PDFs, while leaving the gluon distribution largely unaffected. A complementary Hessian analysis exposes systematic limitations of the Gaussian approximation. Our results demonstrate that MCMC methods provide a more reliable framework for uncertainty quantification in nPDF determinations.

Derakhshanian, N. [Institute of Nuclear Physics Po↗

Continuum electromagnetic gyrokinetic simulations of turbulence in the tokamak scrape-off layer and laboratory devices

Here, we present algorithms and results from Gkeyll, a full-f continuum, electromagnetic gyrokinetic code, designed to study turbulence in the edge region of fusion devices. The edge is computationally very challenging, requiring robust algorithms that can handle large-amplitude fluctuations and stable interactions with plasma sheaths. We present an energy-conserving high-order discontinuous Galerkin scheme that solves gyrokinetic equations in Hamiltonian form. Efficiency is improved by a careful choice of basis functions and automatically generated computation kernels. Previous verification tests were performed in the straight-field-line large plasma device [Shi et al., J. Plasma Phys. 83, 905830304 (2017)] and the Texas Helimak, a simple magnetized torus [Bernard et al., Phys. Plasmas 26, 042301 (2019)], including the effect of end-plate biasing on turbulence. Results for the scrape-off layer for NSTX parameters with a model helical magnetic geometry with bad curvature have been obtained [Shi et al., Phys. Plasmas 26, 012307 (2019)]. In this paper, we present algorithms for the two formulations of electromagnetic gyrokinetics: the Hamiltonian and the symplectic. We describe each formulation and show results of benchmark tests. Although our scheme works for the Hamiltonian formulation, the presence of spurious numerical modes for high-β and large $k^2_⊥ρ^2_s$ regimes shows that the symplectic formulation is more robust. We then review our recent algorithm for the symplectic formulation [Mandell et al., J. Plasma Phys. 86, 905860109 (2020)], along with example application of this new capability. Maintaining positivity of the distribution function can be challenging, and we describe a new and novel exponential recovery based algorithm to address this.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ADAPTIVE ANNEALED IMPORTANCE SAMPLING FOR MULTIMODAL POSTERIOR EXPLORATION AND MODEL SELECTION WITH APPLICATION TO EXTRASOLAR PLANET DETECTION

We describe an algorithm that can adaptively provide mixture summaries of multimodal posterior distributions. The parameter space of the involved posteriors ranges in size from a few dimensions to dozens of dimensions. This work was motivated by an astrophysical problem called extrasolar planet (exoplanet) detection, wherein the computation of stochastic integrals that are required for Bayesian model comparison is challenging. The difficulty comes from the highly nonlinear models that lead to multimodal posterior distributions. We resort to importance sampling (IS) to estimate the integrals, and thus translate the problem to be how to find a parametric approximation of the posterior. To capture the multimodal structure in the posterior, we initialize a mixture proposal distribution and then tailor its parameters elaborately to make it resemble the posterior to the greatest extent possible. We use the effective sample size (ESS) calculated based on the IS draws to measure the degree of approximation. The bigger the ESS is, the better the proposal resembles the posterior. A difficulty within this tailoring operation lies in the adjustment of the number of mixing components in the mixture proposal. Brute force methods just preset it as a large constant, which leads to an increase in the required computational resources. We provide an iterative delete/merge/add process, which works in tandem with an expectation-maximization step to tailor such a number online. The efficiency of our proposed method is tested via both simulation studies and real exoplanet data analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Acoustic field distribution of sawtooth wave with nonlinear SBE model

For precise prediction of the acoustic field distribution of extracorporeal shock wave lithotripsy with an ellipsoid transducer, the nonlinear spheroidal beam equations (SBE) are employed to model acoustic wave propagation in medium. To solve the SBE model with frequency domain algorithm, boundary conditions are obtained for monochromatic and sawtooth waves based on the phase compensation. In numerical analysis, the influence of sinusoidal wave and sawtooth wave on axial pressure distributions are investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hanford External Dosimetry Technical Basis Manual PNL-MA-842

The Hanford External Dosimetry Technical Basis Manual PNL-MA-842 documents the design and implementation of the external dosimetry system used at Hanford. The manual describes the dosimeter design, processing protocols, dose calculation methodology, radiation fields encountered, dosimeter response characteristics, limitations of dosimeter design under field conditions, and makes recommendations for effective use of the dosimeters in the field. The manual describes the technical basis for the dosimetry system in a manner intended to help ensure defensibility of the dose of record at Hanford and to demonstrate compliance with 10 CFR 835, DOELAP, DOE-RL, ORP, PNSO, and Hanford contractor requirements. The dosimetry system is operated by PNNL’s Hanford External Dosimetry Program (HEDP) which provides dosimetry services to all Hanford contractors. The primary users of this manual are DOE and DOE contractors at Hanford using the dosimetry services of PNNL. Development and maintenance of this manual is funded directly by DOE and DOE contractors. Its contents have been reviewed and approved by DOE and DOE contractors at Hanford through the Hanford Personnel Dosimetry Advisory Committee (HPDAC) which is chartered and chaired by DOE-RL and serves as means of coordinating dosimetry practices across contractors at Hanford. This manual was established in 1996. Since its inception, it has been revised many times and maintained by PNNL as a controlled document with controlled distribution. The first revision to be released through PNNL’s Electronic Records & Information Capture Architecture (ERICA) database was designated Revision 0. Revision numbers that are whole numbers reflect major revisions typically involving significant changes to all chapters in the document. Revision numbers that include a decimal fraction reflect minor revisions, usually restricted to selected chapters or selected pages in the document. Maintenance and distribution of controlled hard copies of the manual by PNNL was discontinued beginning with Revision 0.2. Revision Log: Rev. 0 (2/25/2005) Major revision and expansion. Rev. 0.1 (3/12/2007) Updated Chapters 5, 6 and 9 to reflect change in default ring calibration factor used in HEDP dose calculation software. Factor changed from 1.5 to 2.0 beginning January 1, 2007. Pages on which changes were made are as follows: 5.23, 5.69, 5.78, 5.80, 5.82, 6.3, 6.5, 6.29, and 9.2. Rev 0.2 (8/28/2009) Updated Chapters 3, 5, 6, 8 and 9. Chapters 6 and 8 were significantly expanded. References in the Preface and Chapters 1, 2, 4, and 7 were updated to reflect updates to DOE documents. Approved by HPDAC on 6/2/2009. Rev 1.0 (1/1/2010) Major revision. Updated all chapters to reflect the Hanford site wide implementation on January 1, 2010 of new DOE requirements for occupational radiation protection. The new requirements are given in the June 8, 2007 amendment to 10 CFR 835 Occupational Radiation Protection (Federal Register, June 8, 2007. Title 10 Part 835. U.S., Code of Federal Regulations, Vol. 72, No. 110, 31904-31941). Revision 1.0 to the manual replaces ICRP 26 dosimetry concepts and terminology with ICRP 60 dosimetry concepts and terminology and replaces external dose conversion factors from ICRP 51 with those from ICRP 74 for use in measurement of operational quantities with dosimeters. Descriptions of dose algorithms and dosimeter response characteristics, and field performance were updated to reflect changes in the neutron quality factors used in the measurement of operational quantities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dynamic Restoration Strategy for Distribution System Resilience Enhancement

In electric power distribution systems, distributed energy resources (DERs) can act as controllable power sources and support utility operators to minimize power outages after extreme weather events (e.g., hurricane, earthquake, wildfire) and thus help enhance the grid's resilience. Meanwhile, the influences of extreme events and the capabilities of DERs are dynamic and difficult to predict. Hence, the desired distribution system restoration strategy should be able to evolve according to real-time fault/dis-turbance information and the availability of DERs. In this paper, we propose a new dynamic restoration strategy for distribution systems to enhance system resilience against potential hazards. An efficient reconfiguration algorithm is developed to eliminate the use of integer variables to relieve the computational burden. Model predictive control is implemented to adjust the system topology and DER operation set points based on the updated fault information and DER forecasts. The effectiveness of the proposed restoration model in enhancing distribution system resilience is validated through an IEEE 123-bus test system. Simulation results also validate that the proposed restoration model can mitigate the occurrence of unexpected events and the fluctuations of DERs.

distributed energy resources (DERs)↗

Resilient off-grid microgrids: Capacity planning and N-1 security

Over the past century the electric power industry has evolved to support the delivery of power over long distances with highly interconnected transmission systems. Despite this evolution, some remote communities are not connected to these systems. These communities rely on small, disconnected distribution systems, i.e., microgrids to deliver power. However, as microgrids often are not held to the same reliability standards as transmission grids, remote communities can be at risk for extended blackouts. To address this issue, we develop an optimization model and an algorithm for capacity planning and operations of microgrids that include N-1 security and other practical modeling features like AC power flow physics, component efficiencies and thermal limits. Lastly, we demonstrate the computational effectiveness of our approach on two test systems; a modified version of the IEEE 13 node test feeder and a model of a distribution system in a remote community in Alaska.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization of Workload Distribution of Data Centers Based on a Self-Learning In Situ Adaptive Tabulation Model

Data center cooling typically involves non-uniform airflow and temperature distributions, which are affected by the IT workload distribution. It is helpful to simulate the airflow and temperature to optimize the workload distribution. Traditional computational fluid dynamics (CFD) simulation is usually time-consuming while conventional reduced order models (ROMs), though computationally fast, may generate inaccurate results even after being fully trained. In Situ Adaptive Tabulation (ISAT), contracting to conventional ROM, can make prediction with error lower than a user-specified tolerance. To demonstrate using of ISAT for optimal workload distribution in data center, this paper presents a preliminary study of an ISAT-based genetic algorithm optimization platform. The ISAT is trained offline by using the results from CFD simulations using a hypothetical simple data center. The optimal workload distribution determined by the platform leads to approximately 6.8% of energy savings when compared to the benchmark with a uniform workload distribution. We note that the time cost for the entire optimization process, including the training of ISAT is about 4 hours, which is acceptable in the design phase.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Dynamic Restoration Strategy for Distribution System Resilience Enhancement

In electric power distribution systems, distributed energy resources (DERs) can act as controllable power sources and support utility operators to minimize power outages after extreme weather events (e.g., hurricane, earthquake, wildfire) and thus help enhance the grid's resilience. Meanwhile, the influences of extreme events and the capabilities of DERs are dynamic and difficult to predict. Hence, the desired distribution system restoration strategy should be able to evolve according to real-time fault/disturbance information and the availability of DERs. In this paper, we propose a new dynamic restoration strategy for distribution systems to enhance system resilience against potential hazards. An efficient reconfiguration algorithm is developed to eliminate the use of integer variables to relieve the computational burden. Model predictive control is implemented to adjust the system topology and DER operation set points based on the updated fault information and DER forecasts. The effectiveness of the proposed restoration model in enhancing distribution system resilience is validated through an IEEE 123-bus test system. Simulation results also validate that the proposed restoration model can mitigate the occurrence of unexpected events and the fluctuations of DERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems

Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.

97 MATHEMATICS AND COMPUTING↗