Quark distribution inside a pion in many-flavor ( 2 + 1 )-dimensional QCD using lattice computations: UV listens to IR
Not Available
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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.
Streaming Readout and Remote Compute
Streaming Readout Data Acquisition systems coupled with distributed resources spread over vast geographic distances present new challenges to the next generation of experiments. High bandwidth modern network connectivity opens the possibility to utilize large, general-use, HTC systems that are not necessarily located close to the experiment. Near real-time response rates and workflow colocation can provide high reliability solutions to ensure efficient use of beam time. This talk will focus on a few technologies currently being developed at Jefferson Lab and in collaboration with ESnet to support fully streaming DAQ systems.
Lawrence, David↗
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.
97 MATHEMATICS AND COMPUTING↗
Risk-Aware Measurement Synchronization and Recovery for DSSE With Heterogeneous Data Sources
Power distribution systems are increasingly integrating heterogeneous sensors with varying data reporting rates and types, which pose challenges to achieving observability at the desired temporal resolution of distribution system state estimation (DSSE). Multisensor failures caused by extreme events exacerbate these issues, introducing substantial uncertainties into DSSE. This article proposes a novel solution to these challenges by ensuring high-resolution system observability despite heterogeneous data sources and multisensor failures. First, a deep learning architecture combining long short-term memory (LSTM) and graph convolutional network (GCN) is employed to synchronize meters with different reporting rates, aiming to achieve system observability. A random-walk-model-based approach is introduced to generate pseudo-measurements while properly characterizing their uncertainties under multisensor failures. Finally, a disaster-risk-informed observability metric (RiOM) is defined to quantify the uncertainty associated with state estimation results. The proposed framework offers deeper insights into the system observability on the fly compared with conventional analysis. The effectiveness of the framework is demonstrated on an IEEE standard test case and a large-scale real-world distribution feeder in mid-Minnesota in the U.S.
97 MATHEMATICS AND COMPUTING↗
Adaptive Computing (AC) [SWR-24-106]
The Adaptive Computing (AC) software stack supports goal-based computing, for which a simulation workload is created on the fly adapting to the results of calculations. Application-specific code defines an objective, which may be to solve an optimization problem or to train a surrogate model with minimal uncertainty. Then, the AC driver decides where in the design parameter space to run simulations to best achieve that objective. This process is iterative and online; as new data is returned from simulations, the AC driver chooses new simulations to run. The AC driver can strategically run simulations on distributed hardware resources (including high performance computing machines, cloud resources, and edge devices) to maximize throughput and obey resource constraints.
Griffin, Kevin [National Renewable Energy Laborato↗
Adaptive Computing (AC) (Open Source) [SWR-24-106]
The Adaptive Computing (AC) software stack supports goal-based computing, for which a simulation workload is created on the fly, adapting to the results of calculations. Application-specific code defines an objective, which may be to solve an optimization problem or to train a surrogate model with minimal uncertainty. Then, the AC driver decides where in the design parameter space to run simulations to best achieve that objective. This process is iterative and online; as new data is returned from simulations, the AC driver chooses new simulations to run. The AC driver can strategically run simulations on distributed hardware resources (including high performance computing machines, cloud resources, and edge devices) to maximize throughput and obey resource constraints.
Griffin, Kevin [National Laboratory of the Rockies↗
Standardizing Performance Metrics for Building-Level Electrical Distribution Systems
Building-level electrical distribution systems comprise a myriad of current-carrying equipment, conversion devices, and protection devices that deliver power from the utility or local distributed energy resources to end-use building loads. Electric power has traditionally been generated, transmitted, and distributed in alternating current (AC). However, the last decade has seen a significant increase in the integration of native direct current (DC) equipment that has elevated the importance of DC distribution systems. Numerous studies have comparatively examined the performance of various electrical distribution systems in buildings but have failed to achieve uniform conclusions, primarily because of a lack of consistent and analogous performance evaluation methods. This paper aims to fill this gap by providing a standard set of metrics and measurement boundaries to consistently evaluate the performance of AC, DC, or hybrid AC/DC electrical distribution systems. The efficacy of the proposed approach is evaluated on a representative medium-sized commercial office building model with AC distribution and an equivalent hybrid AC/DC and DC distribution model, wherein the AC distribution model is concluded to be the most efficient. The simulation results show variation in computed metrics with different selected boundaries that verify the effectiveness of the proposed approach in ensuring consistent computation of the performance of building-level electrical distribution systems. This paper provides an initial set of guidelines for building energy system stakeholders to adopt appropriate solutions, thus leading to more efficient energy systems.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Nuclide inventory characterization of EBR-II MOX fuel test pins
Characterization of 3 mixed oxide (MOX) fuel pins from the Experimental Breeder Reactor II (EBR-II) SPA-2/-2B experiment program was performed in support of the Advanced Reactor Experiments for Sodium Fast Reactor Fuels (ARES) joint project between Idaho National Laboratory (INL) and the Japan Atomic Energy Agency (JAEA). The characterization efforts were performed to enable transient testing in the Transient Reactor Test (TREAT) facility at INL and will include post irradiation examination (PIE) and other analyses. MOX fuel pins UW02009, 02011, and 06024 were historically irradiated from 1989 to 1994 for a total of 822.42 effective full power days (EFPDs) and peak burnup of approximately 14.3 at.% (atomic percent of heavy metal atoms, ∼134.4 GWd/t). They had since been placed in storage until a future use was identified. Characterization of the fission products and activation of each fuel pin was necessary to enable removal from storage and subsequent irradiation testing or PIE activities. The initial fuel pin geometry and composition were established using historical documentation. Irradiation history details were utilized to compute irradiated and decayed fuel pin masses, atomic densities, and activities. A pellet-wise axial neutron flux was also computed to assist in evaluation of the axial distribution of {sup 235}U and {sup 239}Pu, per pellet, within each of the test fuel pins. The results computed herein supported experiment design for advanced high-burnup MOX fuel designs under slow transient overpower (MOXTOP) conditions, which was Phase I of the ARES project. (authors)
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
Fast resonance decays in nuclear collisions
Here, we present a new method to calculate the final decay spectrum of direct resonance decays directly from hydrodynamic fields on a freeze-out surface. The method is based on identifying components of the final particle spectrum that transform in an irreducible way under rotations in the fluid-restframe. Corresponding distribution functions can be pre-computed including all resonance decays. Just a few of easily tabulated scalar functions then determine the Lorentz invariant decay spectrum from each space-time point, and simple integrals of these scalar functions over the freeze-out surface determine the final decay products. This by-passes numerically costly event-by-event calculations of the intermediate resonances. The method is of considerable practical use for making realistic data to model comparisons of the identified particle yields and flow harmonics, and for studying the viscous corrections to the freeze-out distribution function.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Implementation of the Glued Sphere Discrete Element Model for Non-Spherical Particles in MFiX Software
To enhance solver capabilities, simulation flexibility and model validation within the MFiX software, the U.S. Department of Energy (DOE) is funding efforts to develop and integrate the glued-sphere discrete element method into the latest version of MFiX as a dedicated computational module. The glued-sphere discrete element method is a numerical technique to depict the behavior of non-spherical particles in granular flows or particulate systems by representing them as a collection of component spheres. These spheres are bonded together to approximate the shape and mechanical/chemical properties of a more complex particle. The method effectively reuses the existing sphere-sphere collision algorithm, interphase momentum and heat transfer calculations utilized in the traditional discrete element method, extending these capabilities to non-spherical particles. Additionally, this method explicitly resolves intra-particle temperature and species distributions. The MFiX glued-sphere computational module includes tools for generating glued sphere configurations, a dedicated solver, and visualization capabilities in post-processing. More specifically within the computational module, collision detection and calculations were first performed on component spheres and then mapped onto non-spherical particles. The linear spring-dashpot model was utilized to simulate the sphere-sphere interactions.
Ke, Renjie↗
Linear Solver for Electromagnetic Simulation of General Distribution Feeders
High-fidelity electromagnetic transient (EMT) modeling is required for accurate simulation and analysis of power system dynamics in modern distribution feeders. However, the high-fidelity of EMT models often leads to significant computational challenges, particularly in terms of computational resources and simulation time. This paper investigates the development and application of a detailed EMT model for general distribution feeders, with a focus on improving computational efficiency. A direct linear solver is proposed for a bordered block diagonal (BBD) matrix structure commonly encountered in a EMT model of distribution feeders. The solver integrates the Schur complement method with the block tridiagonal matrix algorithm to enhance the computational performance. The proposed solver is validated using the primary feeder of the IEEE 342-node test system, demonstrating its accuracy and efficiency in EMT simulations. Furthermore, the solver’s performance is benchmarked against MATLAB’s built-in linear solvers, showing significant improvements in computation time while maintaining high fidelity and accuracy in simulation results.
Choi, Jongchan [ORNL] (ORCID:000000025952455X)↗
Decentralized Low-Rank State Estimation for Power Distribution Systems
This article considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effective technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes computationally challenging for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.
41 EE - Solar Energy Technologies Office (EE-4S)↗
Viewing is understanding: Graphite microstructure effects on infiltrated molten salt distribution revealed by 3D neutron tomography
Molten salt infiltration in the pore network of nuclear graphite may cause unwanted changes to graphite's local structure and mechanical and thermal properties. A detailed and comprehensive understanding of molten salt intrusion (distribution across sample cross section and penetration depth) is needed to assess its effects. Here, in this work, we report on an improved methodology for the use of neutron imaging (computed tomography) to evaluate salt penetration and distribution of a wide range of graphite grades with diverse microstructures. Neutron tomography data were acquired on the same graphite sample before and after salt intrusion; the 3D reconstructed volumes were digitally co-registered and subtracted. The difference in neutron attenuation coefficient represents direct visualization of FLiNaK (LiF–NaF–KF) salt distribution in the salt-impregnated graphite samples. This improved methodology was applied to investigate the effect of exposure times (12 h and 336 h) and of graphite microstructure when exposed to FLiNaK at 750 °C and 3 bar (gauge) pressure, starting from flowing argon at near atmospheric pressure. The results show that medium-grained and fine-grained graphites evolve to equilibrium at significantly different rates: fast salt uptake in medium-grained graphites produces salt deposits throughout the volume of graphite specimens, whereas salt infiltration in fine-grained graphites is much slower and limited to exposed surfaces.
FLiNaK infiltration↗
Forecasting high-dimensional spatio-temporal systems from sparse measurements
This paper introduces a new neural network architecture designed to forecast high-dimensional spatio-temporal data using only sparse measurements. The architecture uses a two-stage end-to-end framework that combines neural ordinary differential equations (NODEs) with vision transformers. Initially, our approach models the underlying dynamics of complex systems within a low-dimensional space; and then it reconstructs the corresponding high-dimensional spatial fields. Many traditional methods involve decoding high-dimensional spatial fields before modeling the dynamics, while some other methods use an encoder to transition from high-dimensional observations to a latent space for dynamic modeling. In contrast, our approach directly uses sparse measurements to model the dynamics, bypassing the need for an encoder. This direct approach simplifies the modeling process, reduces computational complexity, and enhances the efficiency and scalability of the method for large datasets. We demonstrate the effectiveness of our framework through applications to various spatio-temporal systems, including fluid flows and global weather patterns. Although sparse measurements have limitations, our experiments reveal that they are sufficient to forecast system dynamics accurately over long time horizons. Our results also indicate that the performance of our proposed method remains robust across different sensor placement strategies, with further improvements as the number of sensors increases. This robustness underscores the flexibility of our architecture, particularly in real-world scenarios where sensor data is often sparse and unevenly distributed.
97 MATHEMATICS AND COMPUTING↗
Flexible Machine Learning-Based Cyberattack Detection Using Spatiotemporal Patterns for Distribution Systems
This letter develops a flexible machine learning detection method for cyberattacks in distribution systems considering spatiotemporal patterns. Spatiotemporal patterns are recognized by the graph Laplacian based on system-wide measurements. A flexible Bayes classifier (BC) is used to train spatiotemporal patterns which could be violated when cyberattacks occur. Cyberattacks are detected by using flexible BCs online. The effectiveness of the developed method is demonstrated through standard IEEE 13- and 123-node test feeders.
97 MATHEMATICS AND COMPUTING↗
Evidence of Skewness and Sub-Gaussian Character in Temperature-Dependent Distributions of One Million Electronic Excitation Energies in PbS Quantum Dots
Obtaining statistical distributions by sampling a large number of conformations is vital for an accurate description of temperature-dependent properties of chemical systems. However, constructing distributions with 105??106 samples is computationally challenging because of the prohibitively high computational cost of performing rst-principles quantum-mechanical calculations. In this work, we present a new technique called the Eective Stochastic Potential Conguration Interaction Singles (ESP-CIS) method to obtain excitation energies. The ESP-CIS method uses random matrix theory for the construction of an eective stochastic representation of the Fock operator and combines it with linear-response theory. Here, we perform excitation calculations on PbS quantum dots (0.75-1.75 nm) at temperatures of 200-400 K. Results from a total of 15 million excitation energy calculations (1 million samples for each of the three dots at ve dierent temperatures) revealed the distributions to be sub-Gaussian in nature with negative skewness. The distributions progressively became red-shifted with increasing temperature. The study shows that random distortions in structure from the minimum-energy geometry of these quantum dots are more likely to lower the excitation energies.
Scher, Jeremy A.↗
Mochi: Composing Data Services for High-Performance Computing Environments
Technology enhancements and the growing breadth of application workflows running on high-performance computing (HPC) platforms drive the development of new data services that provide high performance on these new platforms, provide capable and productive interfaces and abstractions for a variety of applications, and are readily adapted when new technologies are deployed. The Mochi framework enables composition of specialized distributed data services from a collection of connectable modules and subservices. Rather than forcing all applications to use a one-size-fits-all data staging and I/O software configuration, Mochi allows each application to use a data service specialized to its needs and access patterns. This paper introduces the Mochi framework and methodology. The Mochi core components and microservices are described. Examples of the application of the Mochi methodology to the development of four specialized services are detailed. Finally, a performance evaluation of a Mochi core component, a Mochi microservice, and a composed service providing an object model is performed. The paper concludes by positioning Mochi relative to related work in the HPC space and indicating directions for future work.
97 MATHEMATICS AND COMPUTING↗