Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed computation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,657 records · Page 92

Transport in Stochastic Media with Random Chord Length Distributions

Thermal radiation transport computations in binary Markovian random mixtures rely almost exclusively on the Levermore-Pomraning (LP) model which is obtained by applying a heuristic closure to the ensemble averaged random medium transport equation. The validity of this model has been extensively tested by comparing numerical results over a broad parameter range (material types and mixing parameters) against benchmark solutions in planar geometry. The conditions under which the LP-model provides useful results and when it breaks down are now well established, but work to date has been largely restricted to homogeneous mixing statistics, i.e., the mean chord lengths of both materials are taken to be spatially constant. In recent work, this limitation was relaxed by allowing the mean chord lengths and, in a consistent fashion, the volume fractions in the LP-model to vary spatially and in a follow-up investigation benchmark solutions were obtained by ensemble averaging results over material realizations sampled from a nonhomogeneous Poisson process (NHPP). Numerical experiments in rod geometry with specifically linear and quadratic spatial dependence of chord lengths showed that the material averaged radiation intensities vary nonmonotonically with depth into the medium, in stark contrast to solutions obtained assuming uniform chord lengths. Moreover, depending on the local optical thickness and strength of scattering, the LP-model results showed locally more nuanced deviations from the benchmark solutions than was the case with constant chord lengths. These limited numerical investigations highlight the nontrivial qualitative and quantitative consequences of nonhomogeneous mixing statistics, in particular that closure approximations may not be uniformly valid or invalid over the problem domain.

42 ENGINEERING↗

Inter-computer communication architecture for a mixed redundancy distributed system

The triply redundant intercomputer network for the Advanced Information Processing System (AIPS), an architecture developed to serve as the core avionics system for a broad range of aerospace vehicles, is discussed. The AIPS intercomputer network provides a high-speed, Byzantine-fault-resilient communication service between processing sites, even in the presence of arbitrary failures of simplex and duplex processing sites on the IC network. The IC network contention poll has evolved from the Laning Poll. An analysis of the failure modes and effects and a simulation of the AIPS contention poll, demonstrate the robustness of the system.

Lala, Jaynarayan H.↗

Regional-scale fault-to-structure earthquake simulations with the EQSIM framework: Workflow maturation and computational performance on GPU-accelerated exascale platforms

Continuous advancements in scientific and engineering understanding of earthquake phenomena, combined with the associated development of representative physics-based models, is providing a foundation for high-performance, fault-to-structure earthquake simulations. However, regional-scale applications of high-performance models have been challenged by the computational requirements at the resolutions required for engineering risk assessments. The EarthQuake SIMulation (EQSIM) framework, a software application development under the US Department of Energy (DOE) Exascale Computing Project, is focused on overcoming the existing computational barriers and enabling routine regional-scale simulations at resolutions relevant to a breadth of engineered systems. This multidisciplinary software development—drawing upon expertise in geophysics, engineering, applied math and computer science—is preparing the advanced computational workflow necessary to fully exploit the DOE’s exaflop computer platforms coming online in the 2023 to 2024 timeframe. Achievement of the computational performance required for high-resolution regional models containing upward of hundreds of billions to trillions of model grid points requires numerical efficiency in every phase of a regional simulation. This includes run time start-up and regional model generation, effective distribution of the computational workload across thousands of computer nodes, efficient coupling of regional geophysics and local engineering models, and application-tailored highly efficient transfer, storage, and interrogation of very large volumes of simulation data. This article summarizes the most recent advancements and refinements incorporated in the workflow design for the EQSIM integrated fault-to-structure framework, which are based on extensive numerical testing across multiple graphics processing unit (GPU)-accelerated platforms, and demonstrates the computational performance achieved on the world’s first exaflop computer platform through representative regional-scale earthquake simulations for the San Francisco Bay Area in California, USA.

58 GEOSCIENCES↗

Nonlinear evolution of dark matter subhalos and applications to warm dark matter

We describe the methodology to include nonlinear evolution, including tidal effects, in the computation of subhalo distribution properties in both cold (CDM) and warm (WDM) dark matter universes. Using semi-analytic modeling, we include effects from dynamical friction, tidal stripping, and tidal heating, allowing us to dynamically evolve the subhalo distribution. We calibrate our nonlinear evolution scheme to the CDM subhalo mass function in the Aquarius N-body simulation, producing a subhalo mass function within the range of simulations. We find tidal effects to be the dominant mechanism of nonlinear evolution in the subhalo population. Finally, we compute the subhalo mass function for m {sub χ} = 1.5 keV WDM including the effects of nonlinear evolution, and compare radial number densities and mass density profiles of subhalos in CDM and WDM models. We show that all three signatures differ between the two dark matter models, suggesting that probes of substructure may be able to differentiate between them.

79 ASTRONOMY AND ASTROPHYSICS↗

Helium escape from the Earth's atmosphere - The charge exchange mechanism revisited

We have studied the escape of neutral helium from the terrestrial atmosphere through exothermic charge exchange reactions between He(+) ions and the major atmospheric constituents N2, O2 and O. Elastic collisions with the neutral background particles were treated quantitatively using a recently developed kinetic theory approach. An interhemispheric plasma transport model was employed to provide a global distribution of He(+) ions as a function of altitude, latitude and local solar time and for different levels of solar ionization. Combining these ion densities with neutral densities from an MSIS model and best estimates for the reaction rate coefficients of the charge exchange reactions, we computed the global distribution of the neutral He escape flux. The escape rates show large diurnal and latitudinal variations, while the global average does not vary by more than a factor of three over a solar cycle. We find that this escape mechanism is potentially important for the overall balance of helium in the Earth's atmosphere. However, more accurate values for the reaction rate coefficients of the charge exchange reactions are required to make a definitive assessment of its importance.

Lie-Svendsen, O.↗

Efficient Agent-Based Cluster Ensembles

Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified clustering. Unfortunately current non-agent-based cluster combining methods do not work in a distributed environment, are not robust to corrupted clusterings and require centralized access to all original clusterings. Overcoming these issues will allow cluster ensembles to be used in fundamentally distributed and failure-prone domains such as data acquisition from satellite constellations, in addition to domains demanding confidentiality such as combining clusterings of user profiles. This paper proposes an efficient, distributed, agent-based clustering ensemble method that addresses these issues. In this approach each agent is assigned a small subset of the data and votes on which final cluster its data points should belong to. The final clustering is then evaluated by a global utility, computed in a distributed way. This clustering is also evaluated using an agent-specific utility that is shown to be easier for the agents to maximize. Results show that agents using the agent-specific utility can achieve better performance than traditional non-agent based methods and are effective even when up to 50% of the agents fail.

Agogino, Adrian↗

Prosumer-Based Distributed Autonomous Cyber-Physical Architecture for Ultra-reliable Green Electricity Internetworks

This project, the first of its kind, proposes a new architecture for decentralized management and control of future electricity grids with millions of decision-makers. These economically motivated decision-makers are called prosumers (producer-consumers). Prosumers can produce, consume, and/or store electricity and make strategic decisions enabled by communication networks. Prosumers can be as large as a utility or as small as an electric vehicle or a smart house with a home energy management system. The report first provides an impression of the functionality envisioned in prosumer-based smart grids and the philosophy behind their design. The architecture is intended to provide a platform for many possibilities in service definition and trading. The functionality of the architecture is identified by functional and non-functional requirements related to decentralized control and optimization. In this report, three key technologies are proposed for enabling distributed operation and control in prosumer-based smart grids. The first technology is a cyber-infrastructure model, which provides an underlying framework for distributed communication and computation in smart grids. The model is based on service-oriented computing paradigm and is compatible with the existing service-oriented technologies, used in enterprise computing, such as Web Services. However, it extends these technologies for handling the hard-to-predict real-time aspects of smart grids by introducing resource-aware service deployment and quality-of-service (QoS)-aware service monitoring phases. The second technology is a distributed frequency regulation (DFR) framework, which can ensure midterm frequency stability while avoiding inter-area oscillations and using a limited control effort. DFR can complement today’s Automatic Generation Control (AGC) systems by providing an advanced protocol for coordination between AGC systems of different prosumers. The main advantage of the DFR technology is that each frequency regulator only needs to communicate with its neighbors in the network. The efficacy of DFR is shown through simulations on real-world electric energy systems of different scale and complexity. The third technology introduced in this project is decentralized unit commitment (DUC) for heterogeneous prosumers. The DUC technology is a new scalable method for formulating and solving a distributed energy scheduling problem. The algorithm extends the alternating direction method of multipliers (ADMM) and includes several heuristics to mitigate oscillations and traps in local optimality that result from the nonconvexity of unit commitment. The main advantages of DUC is that it can solve the unit commitment problem for large-scale power systems of more than 3,000 nodes faster than the state-of-the-art, centralized methods, and that it is scalable to energy scheduling problems of prosumer systems of any size. In summary, this report illustrates that the distributed architecture for prosumer-based power grids is an enabler of transforming aging power grids into sustainable, resilient, reliable, and efficient smart grids with some desirable functionalities similar to the Internet.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗

VORCOR: A computer program for calculating characteristics of wings with edge vortex separation by using a vortex-filament and-core model

A computer code base on an improved vortex filament/vortex core method for predicting aerodynamic characteristics of slender wings with edge vortex separations is developed. The code is applicable to camber wings, straked wings or wings with leading edge vortex flaps at subsonic speeds. The prediction of lifting pressure distribution and the computer time are improved by using a pair of concentrated vortex cores above the wing surface. The main features of this computer program are: (1) arbitrary camber shape may be defined and an option for exactly defining leading edge flap geometry is also provided; (2) the side edge vortex system is incorporated.

Pao, J. L.↗

Expert-System Consultant To Operating Personnel

Artificial intelligence aids engineers and technicians in controlling and monitoring complicated systems. Operations Analyst for Distributed Systems (OPERA) software is developmental suite of expert-system computer programs helping engineers and technicians operating from number of computer workstations to control and monitor spacecraft during prelaunch and launch phases of operation. OPERA designed to serve as consultant to operating engineers and technicians. It preprocesses incoming data, using expertise collected from conglomerate of specialists in design and operation of various parts of system. Driven by menus and mouse-activated commands. Modified versions of OPERA used in chemical-processing plants, factories, banks, and other enterprises in which there are distributed-computer systems including computers that monitor or control other computers.

Heard, Astrid E.↗

Distributed memory parallel Markov random fields using graph partitioning

Markov random fields (MRF) based algorithms have attracted a large amount of interest in image analysis due to their ability to exploit contextual information about data. Image data generated by experimental facilities, though, continues to grow larger and more complex, making it more difficult to analyze in a reasonable amount of time. Applying image processing algorithms to large datasets requires alternative approaches to circumvent performance problems. Aiming to provide scientists with a new tool to recover valuable information from such datasets, we developed a general purpose distributed memory parallel MRF-based image analysis framework (MPI-PMRF). MPI-PMRF overcomes performance and memory limitations by distributing data and computations across processors. The proposed approach was successfully tested with synthetic and experimental datasets. Additionally, the performance of the MPI-PMRF framework is analyzed through a detailed scalability study. We show that a performance increase is obtained while maintaining an accuracy of the segmentation results higher than 98%. The contributions of this paper are: (a) development of a distributed memory MRF framework; (b) measurement of the performance increase of the proposed approach; (c) verification of segmentation accuracy in both synthetic and experimental, real-world datasets

97 MATHEMATICS AND COMPUTING↗

Non-singlet quark helicity $\mathrm{PDF}$s of the nucleon from pseudo-distributions

The non-singlet helicity quark parton distribution functions (PDFs) of the nucleon are determined from lattice QCD, by jointly leveraging pseudo-distributions and the distillation spatial smearing paradigm. A Lorentz decomposition of appropriately isolated space-like matrix elements reveals pseudo-distributions that contain information on the leading-twist helicity PDFs, as well as an invariant amplitude that induces an additional z 2 contamination of the leading-twist signal. An analysis of the short-distance behavior of the space-like matrix elements using matching coefficients computed to next-to-leading order (NLO) exposes the desired PDF up to this additional z 2 contamination. Due to the non-conservation of the axial current, we elect to isolate the helicity PDFs normalized by the nucleon axial charge at the same scale μ 2 . The leading-twist helicity PDFs as well as several sources of systematic error, including higher-twist effects, discretization errors, and the aforementioned z 2 contaminating amplitude are jointly determined by characterizing the computed pseudo-distribution in a basis of Jacobi polynomials. The Akaike Information Criterion is exploited to effectively average over distinct model parameterizations and cuts on the pseudo-distribution. Encouraging agreement is observed with recent global analyses of each non-singlet quark helicity PDF, notably a rather small non-singlet anti-quark helicity PDF for all quark momentum fractions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Gradient-Based Multi-Area Distribution System State Estimation

The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Scalable parallel communications

Coarse-grain parallelism in networking (that is, the use of multiple protocol processors running replicated software sending over several physical channels) can be used to provide gigabit communications for a single application. Since parallel network performance is highly dependent on real issues such as hardware properties (e.g., memory speeds and cache hit rates), operating system overhead (e.g., interrupt handling), and protocol performance (e.g., effect of timeouts), we have performed detailed simulations studies of both a bus-based multiprocessor workstation node (based on the Sun Galaxy MP multiprocessor) and a distributed-memory parallel computer node (based on the Touchstone DELTA) to evaluate the behavior of coarse-grain parallelism. Our results indicate: (1) coarse-grain parallelism can deliver multiple 100 Mbps with currently available hardware platforms and existing networking protocols (such as Transmission Control Protocol/Internet Protocol (TCP/IP) and parallel Fiber Distributed Data Interface (FDDI) rings); (2) scale-up is near linear in n, the number of protocol processors, and channels (for small n and up to a few hundred Mbps); and (3) since these results are based on existing hardware without specialized devices (except perhaps for some simple modifications of the FDDI boards), this is a low cost solution to providing multiple 100 Mbps on current machines. In addition, from both the performance analysis and the properties of these architectures, we conclude: (1) multiple processors providing identical services and the use of space division multiplexing for the physical channels can provide better reliability than monolithic approaches (it also provides graceful degradation and low-cost load balancing); (2) coarse-grain parallelism supports running several transport protocols in parallel to provide different types of service (for example, one TCP handles small messages for many users, other TCP's running in parallel provide high bandwidth service to a single application); and (3) coarse grain parallelism will be able to incorporate many future improvements from related work (e.g., reduced data movement, fast TCP, fine-grain parallelism) also with near linear speed-ups.

Maly, K.↗

Experiential findings for sustainable software ecosystems to support experimental and observational science

In the search for a sustainable approach for software ecosystems that supports experimental and observational science (EOS) across Oak Ridge National Laboratory (ORNL), we conducted a survey to understand the current and future landscape of EOS software and data. This paper describes the survey design we used to identify significant areas of interest, gaps, and potential opportunities, followed by a discussion on the obtained responses. The survey formulates questions about project demographics, technical approach, and skills required for the present and the next five years. Here, the study was conducted among 38 ORNL participants between June and July of 2021 and followed the required guidelines for human subjects training. We plan to use the collected information to help guide a vision for sustainable, community-based, and reusable scientific software ecosystems that need to adapt effectively to: (i) the evolving landscape of heterogeneous hardware in the next generation of instruments and computing (e.g. edge, distributed, accelerators), and (ii) data management requirements for data-driven science using artificial intelligence.

97 MATHEMATICS AND COMPUTING↗

UPC++ Programmer’s Guide (v1.0 2017.9)

UPC++ is a C++11 library that provides Asynchronous Partitioned Global Address Space (APGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The APGAS model is single program, multiple-data (SPMD), with each separate thread of execution (referred to as a rank, a term borrowed from MPI) having access to local memory as it would in C++. However, APGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the ranks. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗