Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “massive parallelization”

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 847 records · Page 47

h5bench: A unified benchmark suite for evaluating HDF5 I/O performance on pre‐exascale platforms

Summary Parallel I/O is a critical technique for moving data between compute and storage subsystems of supercomputers. With massive amounts of data produced or consumed by compute nodes, high‐performant parallel I/O is essential. I/O benchmarks play an important role in this process; however, there is a scarcity of I/O benchmarks representative of current workloads on HPC systems. Toward creating representative I/O kernels from real‐world applications, we have created h5bench , a set of I/O kernels that exercise hierarchical data format version 5 (HDF5) I/O on parallel file systems in numerous dimensions. Our focus on HDF5 is due to the parallel I/O library's heavy usage in various scientific applications running on supercomputing systems. The various tests benchmarked in the h5bench suite include I/O operations (read and write), data locality (arrays of basic data types and arrays of structures), array dimensionality (one‐dimensional arrays, two‐dimensional meshes, three‐dimensional cubes), I/O modes (synchronous and asynchronous). In this paper, we present the observed performance of h5bench executed along several of these dimensions on existing supercomputers (Cori and Summit) and pre‐exascale platforms (Perlmutter, Theta, and Polaris). h5bench measurements can be used to identify performance bottlenecks and their root causes and evaluate I/O optimizations. As the I/O patterns of h5bench are diverse and capture the I/O behaviors of various HPC applications, this study will be helpful to the broader supercomputing and I/O community.

97 MATHEMATICS AND COMPUTING↗

Realistic gravitational focusing of meteoroid streams

A meteor shower can be modeled, to first order, as a parallel stream of particles encountering the Earth. Gravity bends the trajectories of these particles inward, producing an increase in flux both near the planet and along the anti-radiant line. This effect is known as gravitational focusing, and the interception of a portion of meteoroid trajectories by the Earth or another massive body is known as planetary shielding. For a perfectly parallel meteoroid stream, gravitational focusing produces a flux singularity along the anti-radiant line, near which intense enhancements in flux occur. In reality, meteoroids will exhibit some dispersion in their motion that removes this singularity. We present a modified analytic treatment of gravitational focusing and planetary shielding that takes this dispersion into account and discuss its ramifications for several problems in meteor astronomy.

Althea Valkyrie Moorhead↗

Towards Efficient Scientific Data Management Using Cloud Storage

A software prototype allows users to backup and restore data to/from both public and private cloud storage such as Amazon's S3 and NASA's Nebula. Unlike other off-the-shelf tools, this software ensures user data security in the cloud (through encryption), and minimizes users operating costs by using space- and bandwidth-efficient compression and incremental backup. Parallel data processing utilities have also been developed by using massively scalable cloud computing in conjunction with cloud storage. One of the innovations in this software is using modified open source components to work with a private cloud like NASA Nebula. Another innovation is porting the complex backup to- cloud software to embedded Linux, running on the home networking devices, in order to benefit more users.

He, Qiming↗

A Partitioned -Task Parallel Implementation of the NASA Multiscale Analysis Tool for High Performance Computing

The NASA Multiscale Analysis Tool (NASMAT) is a “plug and play” software package that allows users to conduct massively multiscale modeling of hierarchical and nonlinear materials. This work extends the scalability and improves the High Performance Computing friendliness of NASMAT by adopting a Partitioned Task-Parallel approach. Interoperability of NASMAT with external software is enhanced through preCICE, a open source library for multiphysics coupling in a partitioned manner. Enhancement through preCICE allows for easy integration of NASMAT to other macro solvers and dissociates the parallelization strategy adopted within NASMAT from the macro solver. The task-parallel framework based on Master-Worker approach is implemented as the parallelization scheme. The scheme accounts for hierarchy of multiple scales (task-dependence) and heterogeneous nature (dynamic load balancing) of computations. The applicability and scalability of the framework will be evaluated by analyzing large scale engineering problems through massively multiscale methods.

NASMAT↗

DIMPLES: Distributed Influence Maximization for Pandemic pLanning on Exascale Systems

We study exascale parallel algorithms for the selection of intervention or monitoring strategies in massive realistic socio-technical networks through scalable Influence Maximization (InfMax) algorithms. We employ novel techniques to enable efficient scaling on up to 8k nodes of OLCF Frontier, with 65k AMD GPUs and 458k AMD CPU cores. Current state-of-the-art InfMax tools are limited to networks with only a few million actors (vertices) and a few hundred million interactions (edges). By overcoming these limitations, we show that our approach is capable of processing a realistic social contact network of the United States with 285 million nodes and about 8 billion edges. This two orders-of-magnitude improvement over the previous state-of-the-art is obtained by leveraging algorithmic advancements for the InfMax problem and designing several problem-specific approaches to overlap communication with computation, improve GPU efficiency, and lower the application’s memory requirements. We evaluate strong scaling for computing 10k most influential seeds using up to 8k nodes of an exascale system, and weak scaling from 128 to 8k system nodes for seed sets ranging from 625 to 40k seeds. We achieve the fastest-known runtime of 25 minutes while performing 48 million diffusion simulations totaling 2.31 petabytes to identify 40k influential seeds using 8k nodes, and take 5.75 minutes to identify 10k seeds while using 4k nodes.

Minutoli, Marco [Pacific Northwest National Labora↗

TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graph analytics has emerged as an important tool in the analysis of large scale data from diverse application domains such as social networks, cyber security and bioinformatics. Counting the number of triangles in a graph is a fundamental kernel with several applications such as detecting the community structure of a graph or in identifying important vertices in a graph. The ubiquity of massive datasets is driving the need to scale graph analytics on parallel systems. However, numerous challenges exist in efficiently parallelizing graph algorithms, especially on distributed-memory systems. Irregular memory accesses and communication patterns, low computation to communication ratios, and the need for frequent synchronization are some of the leading challenges. In this paper, we present TriC, our distributed-memory implementation of triangle counting in graphs using the Message Passing Interface (MPI), as a submission to the 2020 GraphChallenge competition. Using a set of synthetic and real-world inputs from the challenge, we demonstrate a speedup of up to 90x relative to previous work on 32 processor-cores of a NERSC Cori node. We also provide details from distributed runs with up to8192 processes along with strong scaling results. The observations presented in this work provide an understanding of the system-level bottlenecks at scale that specifically impact sparse-irregular workloads and will therefore benefit other efforts to parallelize graph algorithms.

Halappanavar, Mahantesh↗

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗

Massive, long-lived electrostatic potentials in a rotating mirror plasma

Abstract Hot plasma is highly conductive in the direction parallel to a magnetic field. This often means that the electrical potential will be nearly constant along any given field line. When this is the case, the cross-field voltage drops in open-field-line magnetic confinement devices are limited by the tolerances of the solid materials wherever the field lines impinge on the plasma-facing components. To circumvent this voltage limitation, it is proposed to arrange large voltage drops in the interior of a device, but coexist with much smaller drops on the boundaries. To avoid prohibitively large dissipation requires both preventing substantial drift-flow shear within flux surfaces and preventing large parallel electric fields from driving large parallel currents. It is demonstrated here that both requirements can be met simultaneously, which opens up the possibility for magnetized plasma tolerating steady-state voltage drops far larger than what might be tolerated in material media.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

IMS Rapid Response 2024 Summary Report: A Machine Learning Potential for the Periodic Table

Stockpile stewardship and nuclear waste remediation are inherently chemically complex, involving practically the full diversity of the periodic table, but existing methods are too expensive or not functional for a large diversity of atom types. Overall, the field of machine learning interatomic potentials (MLIPs) has advanced dramatically in 2024 with large high-accuracy datasets existing for bulk, surface, and organic chemical systems and new online leaderboards for diverse chemistry. To participate in, and bring LANL interests into this ecosystem, here, we have built upon existing technologies created by LANL to create a framework capable of creating machine learning interatomic potentials (MLIPs) for over 90 atom types. Our results have created a massively diverse coordination complex training dataset more than 3 times the size of existing datasets, parallelized MLIP training over multiple GPUs, enabling the training of an MLIP spanning the periodic table at 20 times the speed of prior training on 32 GPUs. These advances are substantial towards creation on foundational MLIPs for LANL-specific application areas.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Overview of the TCV tokamak program: Scientific progress and facility upgrades

The TCV tokamak is augmenting its unique historical capabilities (strong shaping, strong electron heating) with ion heating, additional electron heating compatible with high densities, and variable divertor geometry, in a multifaceted upgrade program designed to broaden its operational range without sacrificing its fundamental flexibility. The TCV program is rooted in a three-pronged approach aimed at ITER support, explorations towards DEMO, and fundamental research. A 1 MW, tangential neutral beam injector (NBI) was recently installed and promptly extended the TCV parameter range, with record ion temperatures and toroidal rotation velocities and measurable neutral-beam current drive. ITER-relevant scenario development has received particular attention, with strategies aimed at maximizing performance through optimized discharge trajectories to avoid MHD instabilities, such as peeling-ballooning and neoclassical tearing modes. Experiments on exhaust physics have focused particularly on detachment, a necessary step to a DEMO reactor, in a comprehensive set of conventional and advanced divertor concepts. The specific theoretical prediction of an enhanced radiation region between the two X-points in the low-field-side snowflake-minus configuration was experimentally confirmed. Fundamental investigations of the power decay length in the scrape-off layer (SOL) are progressing rapidly, again in widely varying configurations and in both D and He plasmas; in particular, the double decay length in L-mode limited plasmas was found to be replaced by a single length at high SOL resistivity. Experiments on disruption mitigation by massive gas injection and electron-cyclotron resonance heating (ECRH) have begun in earnest, in parallel with studies of runaway electron generation and control, in both stable and disruptive conditions; a quiescent runaway beam carrying the entire electrical current appears to develop in some cases. Developments in plasma control have benefited from progress in individual controller design and have evolved steadily towards controller integration, mostly within an environment supervised by a tokamak profile control simulator. TCV has demonstrated effective wall conditioning with ECRH in He in support of the preparations for JT-60SA operation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dynamic Imbalance Would Counter Offcenter Thrust

Dynamic imbalance generated by offcenter thrust on rotating body eliminated by shifting some of mass of body to generate opposing dynamic imbalance. Technique proposed originally for spacecraft including massive crew module connected via long, lightweight intermediate structure to massive engine module, such that artificial gravitation in crew module generated by rotating spacecraft around axis parallel to thrust generated by engine. Also applicable to dynamic balancing of rotating terrestrial equipment to which offcenter forces applied.

Mccanna, Jason↗

Coincident Capture through Post-processing PTRAC [Slides]

This presentation discusses the new PTRAC capabilities and workflows. The PTRAC capability in MCNP6.3 has seen a massive overhaul since MCNP6.2. The new HDF5 file format allows for both MPI- and thread-based parallelism. MCNPTools has been updated to handle the new HDF5 PTRAC format and is now open sourced on GitHub. Built-in capabilities, such as the pulse-height tally coincident capture special treatment, can largely be replicated through separate postprocessing scripts that leverage both PTRAC and MCNPTools. This allows for greater flexibility in user-specified and controlled detector response functionality, ultimately using the MCNP code for what it is best at (i.e., particle transport).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hubble Space Telescope Observations within the Sphere of Influence of the Powerful Supermassive Black Hole in PKS 0745-191

We present Space Telescope Imaging Spectrograph observations from the Hubble Space Telescope of the supermassive black hole (SMBH) at the center of PKS 0745-191, a brightest cluster galaxy (BCG) undergoing powerful radio-mode active galactic nucleus (AGN) feedback (P cav ~ 5 × 10 45 erg s -1 ). These high-resolution data offer the first spatially resolved map of gas dynamics within an SMBH's sphere of influence under such powerful feedback. Our results reveal the presence of highly chaotic, nondrotational ionized gas flows on subkiloparsec scales, in contrast to the more coherent flows observed on larger scales. While radio-mode feedback effectively thermalizes hot gas in galaxy clusters on kiloparsec scales, within the core, the hot gas flow may decouple, leading to a reduction in angular momentum and supplying ionized gas through cooling, which could enhance accretion onto the SMBH. This process could, in turn, lead to a self-regulating feedback loop. Compared to other BCGs with weaker radio-mode feedback, where rotation is more stable, intense feedback may lead to more chaotic flows, indicating a stronger coupling between jet activity and gas dynamics. Additionally, we observe a sharp increase in velocity dispersion near the nucleus, consistent with a very massive M BH ~ 1.5 × 10 10 M ⊙ SMBH. The density profile of the ionized gas is also notably flat, paralleling the profiles observed in X-ray gas around galaxies where the Bondi radius is resolved. These results provide valuable insights into the complex mechanisms driving galaxy evolution, highlighting the intricate relationship between SMBH fueling and AGN feedback within the host galaxy.

79 ASTRONOMY AND ASTROPHYSICS↗

The cosmological bootstrap: inflationary correlators from symmetries and singularities

Scattering amplitudes at weak coupling are highly constrained by Lorentz invariance, locality and unitarity, and depend on model details only through coupling constants and the particle content of the theory. For example, four-particle amplitudes are analytic for contact interactions and have simple poles with appropriately positive residues for tree-level exchange. In this paper, we develop an understanding of inflationary correlators which parallels that of flat-space scattering amplitudes. Specifically, we study slow-roll inflation with weak couplings to extra massive particles, for which all correlation functions are controlled by an approximate conformal symmetry on the boundary of the spacetime. After systematically classifying all possible contact terms in de Sitter space, we derive an analytic expression for the four-point function of conformally coupled scalars mediated by the tree-level exchange of massive scalars. Conformal symmetry implies that the correlator satisfies a pair of differential equations with respect to spatial momenta, encoding bulk time evolution in purely boundary terms. The absence of unphysical singularities (and the correct normalization of physical ones) completely fixes this correlator. Moreover, a “spin-raising” operator relates it to the correlators associated with the exchange of particles with spin, while “weight-shifting” operators map it to the four-point function of massless scalars. We explain how these de Sitter four-point functions can be perturbed to obtain inflationary three-point functions. Using our formalism, we reproduce many classic results in the literature, such as the three-point function of slow-roll inflation, and provide a complete classification of all inflationary three- and four-point functions arising from weakly broken conformal symmetry. Remarkably, the inflationary bispectrum associated with the exchange of particles with arbitrary spin is completely characterized by the soft limit of the simplest scalar-exchange four-point function of conformally coupled scalars and a series of contact terms. Finally, we demonstrate that the inflationary correlators contain flat-space scattering amplitudes via a suitable analytic continuation of the external momenta, which can also be directly connected with the signals for particle production seen in the squeezed limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PipeSight: A High-Performance Computing Platform for Pipeline Integrity Management

The Phase I feasibility study completed as part of this project has led to a number of innovative technologies being developed and has laid the foundation for a successful Phase II effort to commercialize a platform for managing the integrity of pipelines for the damage mechanisms of the new, hybrid-energy based economy. To ground the development efforts and direction of the project, an extensive market research and customer discovery effort was undertaken early in Phase I. Through this effort, a number of pipeline owners and operators were interviewed, and the following key findings were discovered about the pipeline industry: • Small pipeline operators do not have the central engineering groups necessary to perform their own independent analysis of inspection data, but instead rely on summarized tally sheets provided to them by inspection service providers. • The time it takes to go from an inspection to a completed engineering assessment, even for small segments of pipeline, can take anywhere from 30-120 days. During this delay, critical threats can (and have been known to) cause failures. • Uncertainty is often not accounted for in the assessment of pipeline integrity. The tally sheets provided by third-party service providers are almost always deterministic in nature, identifying threats that present a concern only to the current (not the future) integrity of the pipeline. • It is uncommon to apply the latest technologies to perform advanced assessments of damaged pipelines. There is a desire to use more advanced analysis capabilities to assess threats. Many pipeline operators indicated that they would often excavate a pipeline to perform an inspection and find that the damage was not as bad as they anticipated, thus using limited resources unnecessarily. Companies are not consistent in their use of inspection data to determine corrosion rates, and those that do only calculate deterministic corrosion rates. • The industry has prominently relied on time-based inspections but has recently started to transition to risk-based inspections. However, there appears to be no uniform guidance on how to do so while properly accounting for all sources of uncertainty. • Companies are not storing inspection data in a manner that allows for the ready determination of temporal trends. • Predictive maintenance principles and practices are beginning to be used by early adopters • Some pipelines are being re-purposed to transport different process fluids than they were designed for, e.g., H 2 and CO 2 rich process streams to serve the new hybrid-energy based economy, which are presenting new integrity concerns for the existing pipeline network that crisscrosses the United States. As a result of these discoveries, we were able to target the development efforts in Phase I to best serve the needs of the industry. In Phase I, we developed a way to correlate multiple large-scale scans of the pipeline to determine a probabilistic corrosion rate that accounts for all sources of error and uncertainty in the inspection process. This probabilistic corrosion rate can be used to predict the future thickness distribution of the pipe wall. We demonstrate how this analysis may be performed in an analytical fashion and has been implemented in such a manner that it can be readily distributed using GPU computing through integration of the Kokkos programming model. We also make a very novel extension of the analytical corrosion rate model to Bayesian Networks (an explainable AI technique) that can account for non-parametric distributions of corrosion rates. With the predictions made above for the probabilistic corrosion rate and corresponding future distribution of the pipe wall thickness, we can assess the integrity of the pipeline through the use of a probabilistic engineering assessment. We developed a novel screening data analysis approach that can rapidly identify ‘hotspots’ (local thin areas) where the integrity of the pipeline is a concern. Once more, we implemented this screening approach in C++ to leverage GPU computing via the Kokkos programming model. After the critical hotspots are identified, we developed a program that can automatically generate an advanced finite element model of the damaged regions. Since the number of damaged regions that require advanced analysis can number in the thousands, we integrated an open-source container-native workflow engine for orchestrating parallel jobs on the cloud. Initially, these advanced numerical models were only designed to account for loading due to internal pressure. However, in a slight pivot from the initial Phase I proposal, we developed a complete pipe stress analysis program (called Simflex) which can simulate the complete pipeline and its response to thermal expansion, pressure, thermal bowing, weight, wind, earthquake, support displacement, support friction and external forces. This pipe stress analysis program was written generically, to handle any piping system, but contains the features needed to model long pipelines (i.e., it incorporates a model for soil mechanics and can account for the nonlinear boundary conditions necessary to simulate long underground pipelines). This pipe stress analysis program can simulate any segment of the pipeline (simple or complex) under any set of conditions and loads, to determine the supplemental loads (axial forces and bending moments) at the location of damage. This enables the most accurate state of stress to be accounted for in the pipeline, which can prove critical when evaluating the integrity of a damaged region. In the process of developing the technologies to perform the integrity assessment of the pipeline, we also extended one of the industry standard approaches for performing the assessment of local thin areas that extend more in the circumferential direction than the longitudinal direction of the pipeline. This approach was presented to the API 579-1/AS ME FFS-1 steering committee in November 2021 for consideration in the next edition of the industry standard for Fitness-For-Service (expected to be released in 2023). To help pipeline operators make decisions with the results on any integrity assessment, we developed a new approach to the life-cycle management of pipelines which uses a Bayesian Decision Network. The network is designed to help pipeline operators plan and prioritize inspection activities and ultimately make smarter, more cost-effective decisions. The Bayesian approach accounts for all sources of uncertainty and carries them through to the final optimal decisions, providing a probabilistic framework for optimizing inspection intervals. The proof-of-concept networks developed in the feasibility study are complete, verified, and are focused on a subset of the pipeline. To expand this novel approach to the scale necessary for an entire network of pipelines in Phase II, we will leverage the DOE-funded Bengi solver for industrial-scale decision making with Bayesian Networks [22]. Once implemented, we will be able to provide the pipeline industry with a much-needed tool for optimal inspection planning using truly explainable artificial intelligence (XAI). To handle all of these advanced capabilities into a cloud-based platform, the architecture of the Equity Engineering Cloud (EEC) was extended to include Argo Workflows, a framework capable of distributing and managing a massive number of jobs that consume their own resources, such that thousands of serial finite element simulations can be run in parallel. As part of this substantial undertaking, we also integrated Argo Continuous Delivery (CD) into the EEC, to aid with the rapid prototyping and iterations that will be imperative to the success of the PipeSight platform’s Agile development process in Phase II. As part of the pipe stress analysis program, we also developed a custom visualizer that leverages the DOE-funded VTK visualization library. We added custom contouring capabilities and a means for interacting visually with both the inputs and outputs of the pipe stress analysis program. We also developed routines for automating the post-processing of the finite element simulations to determine if any failure criteria are met and to visualize the deformations, stresses and strains in ParaView using the exodus II file format (a subset of netCDF).

24 POWER TRANSMISSION AND DISTRIBUTION↗

The relationship between the Eddington limit, the observed upper luminosity limit for massive stars, and the luminous blue variables

The observed upper luminosity limits in the Galaxy and the LMC are compared with the Eddington limit as estimated for plane-parallel LTE model atmospheres which include the full effects of metal line opacities in the ultraviolet. It is shown that the Humphreys-Davidson (HD) limit corresponds to the locus of extremely low effective gravities. This result suggests that stars approaching the HD limit will suffer high mass-loss rates because of the reduction of the effective gravity due to radiation pressure. These high mass-loss rates ultimtely lead to the core mass fraction reaching its critical value and the reversal of the stellar evolution tracks. It is shown that radiation pressure, as an agent for producing enhanced mass loss near the HD limit, can in a natural way explain the kink in the HD limit near T(eff) roughly 10,000 K and the upper luminosity limit for yellow and red supergiants. The high mass-loss rates of the luminous blue variables, their location in the HR diagram, and their evolutionary stage are also discussed.

Lamers, Henny J. G. L. M.↗