Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high performance and distributed computing”

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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Optical analysis of parabolic dish concentrators for solar dynamic power systems in space

An optical analysis of a parabolic solar collection system operating in Earth orbit was performed using ray tracing techniques. The analysis included the effects of: (1) solar limb darkening, (2) parametric variation of mirror surface error, (3) parametric variation of mirror rim angle, and (4) parametric variation of alignment and pointing error. This ray tracing technique used numerical integration to combine the effects of rays emanating from different parts of the sun at different intensities with the effects of normally distributed mirror-surface errors to compute the angular intensity distribution of rays leaving the mirror surface. A second numerical integration was then performed over the surface of the parabolic mirror to compute the radial distribution of brightness at the mirror focus. Major results of the analysis included: (1) solar energy can be collected at high temperatures with high efficiency, (2) higher absorber temperatures can be achieved at lower efficiencies, or higher efficiencies can be achieved at lower temperatures, and (3) collection efficiency is near its maximum level across a broad plateau of rim angles from 40 deg to 70 deg.

Jefferies, K. S.↗
NASA NTRS2018

Smallholder Crop Area Mapped with Wall-To-Wall WorldView Sub-Meter Panchromatic Image Texture: A Test Case for Tigray, Ethiopia

Global food production in the developing world occurs within sub-hectare fields that are difficult to identify with moderate resolution satellite imagery. Knowledge about the distribution of these fields is critical in food security programs. We developed a semi-automated image segmentation approach using wall-to-wall sub-meter imagery with high-performance computing to map crop area (CA) throughout Tigray, Ethiopia that encompasses over 41,000 km (exp 2). Multiple processing streams were tested to minimize mapping error while applying five unique smoothing kernels to capture differences in land surface texture associated to CA. Typically, very-small fields (mean < 2 ha) have a smooth image roughness compared to natural scrub/shrub woody vegetation at the ~1m scale and these features can be segmented in panchromatic imagery with multi-level histogram thresholding. Multi-temporal very-high resolution (VHR) panchromatic imagery with multi-spectral VHR are sufficient in extracting critical CA information needed in food security programs. A 2011 to 2015 CA map was produced, using over 3000 WorldView-1 panchromatic images wall-to-wall in 1/2 deg mosaics for Tigray, Ethiopia. CA was evaluated with nearly 3000 WorldView-2 2m multispectral 250 X 250 m image subsets by seven expert interpretations, and with in-situ global positioning system photography. CA estimates ranged from 32 to 41% in sub regions of Tigray with median maximum per bin commission and omission errors of 11% and 1% respectively, with most of the error occurring in bins <15%. This empirical, simple, and low direct cost approach via U.S. government license agreement to access commercial VHR data, could be a viable big-data high-performance computing methodology to extract wall-to-wall CA for other regions of the world that have very-small agriculture fields with similar image texture."

Ethiopia↗
DOE OSTI2023

Software Quality Assurance for High Performance Computing Containers

Software containers are a key channel for delivering portable and reproducible scientific software in high performance computing (HPC) environments. HPC environments are different from other types of computing environments primarily due to usage of the message passing interface (MPI) and drivers for specialized hard- ware to enable distributed computing capabilities. This distinction directly impacts how software containers are built for HPC applications and can complicate software quality assurance efforts including portability and performance. This work introduces a strategy for building containers for HPC applications that adopts layering as a mechanism for software quality assurance. The strategy is demonstrated across three different HPC systems, two of them petaflops scale with entirely different interconnect technologies and/or processor chipsets but running the same container. Performance consequences of the containerization strategy are found to be less than 5-14% while still achieving portable and reproducible containers for HPC systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Destabilizing high-capacity high entropy hydrides via earth abundant substitutions: From predictions to experimental validation

The vast chemical space of high entropy alloys (HEAs) makes trial-and-error experimental approaches for materials discovery intractable and often necessitates data-driven and/or first principles computational insights to successfully target materials with desired properties. In the context of materials discovery for hydrogen storage applications, a theoretical prediction-experimental validation approach can vastly accelerate the search for substitution strategies to destabilize high-capacity hydrides based on benchmark HEAs, e.g. TiVNbCr alloys. Here, in this study, machine learning predictions, corroborated by density functional theory calculations, predict substantial hydride destabilization with increasing substitution of earth-abundant Fe content in the (TiVNb) 75 Cr 25-x Fe x system. The as-prepared alloys crystallize in a single-phase bcc lattice for limited Fe content x < 7, while larger Fe content favors the formation of a secondary C14 Laves phase intermetallic. Short range order for alloys with x < 7 can be well described by a random distribution of atoms within the bcc lattice without lattice distortion. Hydrogen absorption experiments performed on selected alloys validate the predicted thermodynamic destabilization of the corresponding fcc hydrides and demonstrate promising lifecycle performance through reversible absorption/desorption. This demonstrates the potential of computationally expedited hydride discovery and points to further opportunities for optimizing bcc alloy ↔ fcc hydrides for practical hydrogen storage applications.

36 MATERIALS SCIENCE↗
DOE OSTI2020

3D microstructure design of lithium-ion battery electrodes assisted by X-ray nano-computed tomography and modelling

Driving range and fast charge capability of electric vehicles are heavily dependent on the 3D microstructure of lithium-ion batteries (LiBs) and substantial fundamental research is required to optimise electrode design for specific operating conditions. Here we have developed a full microstructure-resolved 3D model using a novel X-ray nano-computed tomography (CT) dual-scan superimposition technique that captures features of the carbon-binder domain. This elucidates how LiB performance is markedly affected by microstructural heterogeneities, particularly under high rate conditions. The elongated shape and wide size distribution of the active particles not only affect the lithium-ion transport but also lead to a heterogeneous current distribution and non-uniform lithiation between particles and along the through-thickness direction. Building on these insights, we propose and compare potential graded-microstructure designs for next-generation battery electrodes. To guide manufacturing of electrode architectures, in-situ X-ray CT is shown to reliably reveal the porosity and tortuosity changes with incremental calendering steps.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Direct observation of the momentum distribution and renormalization factor in lithium

We have measured the momentum distribution and renormalization factor $Z_{k_F}$ in liquid and solid lithium by high-resolution Compton scattering. High-resolution data over a wide momentum range exhibit a clear feature of the renormalization and a sharp drop of momentum densities at the Fermi momentum $k_F$. In this work, these results are compared with those computed by quantum Monte Carlo simulation performed both on a disordered crystal and a liquid exhibiting very good agreement. Asymptotic behavior of the experimental and theoretical momentum distributions are examined to estimate $Z_{k_F}$. The experimentally obtained $Z_{k_F} = 0.43^{+0.11}_{–0.01}$ for liquid Li and $0.54^{+0.11}_{–0.02}$ for solid Li are in good agreement with theoretical results of 0.54 ± 0.01 and 0.64 ± 0.01, respectively.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2016

Fast equilibration protocol for million atom systems of highly entangled linear polyethylene chains

Equilibrated systems of entangled polymer melts cannot be produced using direct brute force equilibration due to the slow reptation dynamics exhibited by high molecular weight chains. Instead, these dense systems are produced using computational techniques such as Monte Carlo-Molecular Dynamics hybrid algorithms, though the use of soft potentials has also shown promise mainly for coarse-grained polymeric systems. Through the use of soft-potentials, the melt can be equilibrated via molecular dynamics at intermediate and long length scales prior to switching to a Lennard-Jones potential. We will outline two different equilibration protocols, which use various degrees of information to produce the starting configurations. In one protocol, we use only the equilibrium bond angle, bond length, and target density during the construction of the simulation cell, where the information is obtained from available experimental data and extracted from the force field without performing any prior simulation. In the second protocol, we moreover utilize the equilibrium radial distribution function and dihedral angle distribution. This information can be obtained from experimental data or from a simulation of short unentangled chains. Both methods can be used to prepare equilibrated and highly entangled systems, but the second protocol is much more computationally efficient. These systems can be strictly monodisperse or optionally polydisperse depending on the starting chain distribution. Our protocols, which utilize a soft-core harmonic potential, will be applied for the first time to equilibrate a million particle system of polyethylene chains consisting of 1000 united atoms at various temperatures. Calculations of structural and entanglement properties demonstrate that this method can be used as an alternative towards the generation of entangled equilibrium structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1998

High-Performance Monitoring Architecture for Large-Scale Distributed Systems Using Event Filtering

Monitoring is an essential process to observe and improve the reliability and the performance of large-scale distributed (LSD) systems. In an LSD environment, a large number of events is generated by the system components during its execution or interaction with external objects (e.g. users or processes). Monitoring such events is necessary for observing the run-time behavior of LSD systems and providing status information required for debugging, tuning and managing such applications. However, correlated events are generated concurrently and could be distributed in various locations in the applications environment which complicates the management decisions process and thereby makes monitoring LSD systems an intricate task. We propose a scalable high-performance monitoring architecture for LSD systems to detect and classify interesting local and global events and disseminate the monitoring information to the corresponding end- points management applications such as debugging and reactive control tools to improve the application performance and reliability. A large volume of events may be generated due to the extensive demands of the monitoring applications and the high interaction of LSD systems. The monitoring architecture employs a high-performance event filtering mechanism to efficiently process the large volume of event traffic generated by LSD systems and minimize the intrusiveness of the monitoring process by reducing the event traffic flow in the system and distributing the monitoring computation. Our architecture also supports dynamic and flexible reconfiguration of the monitoring mechanism via its Instrumentation and subscription components. As a case study, we show how our monitoring architecture can be utilized to improve the reliability and the performance of the Interactive Remote Instruction (IRI) system which is a large-scale distributed system for collaborative distance learning. The filtering mechanism represents an Intrinsic component integrated with the monitoring architecture to reduce the volume of event traffic flow in the system, and thereby reduce the intrusiveness of the monitoring process. We are developing an event filtering architecture to efficiently process the large volume of event traffic generated by LSD systems (such as distributed interactive applications). This filtering architecture is used to monitor collaborative distance learning application for obtaining debugging and feedback information. Our architecture supports the dynamic (re)configuration and optimization of event filters in large-scale distributed systems. Our work represents a major contribution by (1) survey and evaluating existing event filtering mechanisms In supporting monitoring LSD systems and (2) devising an integrated scalable high- performance architecture of event filtering that spans several kev application domains, presenting techniques to improve the functionality, performance and scalability. This paper describes the primary characteristics and challenges of developing high-performance event filtering for monitoring LSD systems. We survey existing event filtering mechanisms and explain key characteristics for each technique. In addition, we discuss limitations with existing event filtering mechanisms and outline how our architecture will improve key aspects of event filtering.

Maly, K.↗
DOE OSTI2017

Decision Analyses Related to Groundwater Remediation - 17051

Traditional decision analyses of groundwater remediation scenarios frequently fail because the probability of adverse, unanticipated events occurring is often high. This is driven by many factors including that (1) the models developed to represent the flow and transport in contaminated aquifers are typically simpler than reality and do not account for all the important governing processes, (2) probability distributions are assigned to critical performance parameters (such as model inputs or characteristics of the engineered remediation systems) even though some of these parameters might be unknown or not be very well constrained. However, there is a novel decision analysis methodology and a computational tool based on Bayesian Information-Gap Decision Theory (BIG-DT) that are designed to mitigate the shortcomings of the models and probabilistic decision analyses by leveraging a non-probabilistic decision theory -- information-gap decision theory. The new decision analysis methodology considers possible models that have not been explicitly enumerated and does not require us to commit to a particular probability distribution for model and remediation-design parameters. Both the set of possible models and the set of possible probability distributions grow as the degree of uncertainty increases. The fundamental question that BIG-DT asks is 'How large can these sets be before a particular decision results in an undesirable outcome?'. The decision that allows these sets to be the largest is considered to be the best option. In this way, BIG-DT enables robust decision-support for groundwater remediation problems. Here, we apply BIG-DT to a representative groundwater remediation scenario where different options for hydraulic containment and pump and treat are being considered. BIG-DT requires many model runs and high-performance computing resources are needed when complex models are used. We demonstrate the BIG-DT analyses on a series of synthetic problems that are designed to be consistent with real-world problems such as Los Alamos National Laboratory (LANL) contamination sites. We also discuss a general framework for how the BIG-DT analyses will be carried out at the chromium groundwater contamination site at LANL. BIG-DT is implemented in Julia (a high-level, high-performance dynamic programming language for technical computing) and is part of the MADS framework (http://mads.lanl.gov and http://madsjulia.github.io/Mads.jl). (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS1998

Parallel and Distributed System Simulation

This exploratory study initiated our research into the software infrastructure necessary to support the modeling and simulation techniques that are most appropriate for the Information Power Grid. Such computational power grids will use high-performance networking to connect hardware, software, instruments, databases, and people into a seamless web that supports a new generation of computation-rich problem solving environments for scientists and engineers. In this context we looked at evaluating the NetSolve software environment for network computing that leverages the potential of such systems while addressing their complexities. NetSolve's main purpose is to enable the creation of complex applications that harness the immense power of the grid, yet are simple to use and easy to deploy. NetSolve uses a modular, client-agent-server architecture to create a system that is very easy to use. Moreover, it is designed to be highly composable in that it readily permits new resources to be added by anyone willing to do so. In these respects NetSolve is to the Grid what the World Wide Web is to the Internet. But like the Web, the design that makes these wonderful features possible can also impose significant limitations on the performance and robustness of a NetSolve system. This project explored the design innovations that push the performance and robustness of the NetSolve paradigm as far as possible without sacrificing the Web-like ease of use and composability that make it so powerful.

Dongarra, Jack↗
DOE OSTI2017

Building near-real-time processing pipelines with the spark-MPI platform

Advances in detectors and computational technologies provide new opportunities for applied research and the fundamental sciences. Concurrently, dramatic increases in the three V's (Volume, Velocity, and Variety) of experimental data and the scale of computational tasks produced the demand for new real-time processing systems at experimental facilities. Recently, this demand was addressed by the Spark-MPI approach connecting the Spark data-intensive platform with the MPI high-performance framework. In contrast with existing data management and analytics systems, Spark introduced a new middleware based on resilient distributed datasets (RDDs), which decoupled various data sources from high-level processing algorithms. The RDD middleware significantly advanced the scope of data-intensive applications, spreading from SQL queries to machine learning to graph processing. Spark-MPI further extended the Spark ecosystem with the MPI applications using the Process Management Interface. The paper explores this integrated platform within the context of online ptychographic and tomographic reconstruction pipelines.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2017

Comparison of Aero-Propulsive Performance Predictions for Distributed Propulsion Configurations

NASA's X-57 "Maxwell" flight demonstrator incorporates distributed electric propulsion technologies in a design that will achieve a significant reduction in energy used in cruise flight. A substantial portion of these energy savings come from beneficial aerodynamic-propulsion interaction. Previous research has shown the benefits of particular instantiations of distributed propulsion, such as the use of wingtip-mounted cruise propellers and leading edge high-lift propellers. However, these benefits have not been reduced to a generalized design or analysis approach suitable for large-scale design exploration. This paper discusses the rapid, "design-order" toolchains developed to investigate the large, complex tradespace of candidate geometries for the X-57. Due to the lack of an appropriate, rigorous set of validation data, the results of these tools were compared to three different computational flow solvers for selected wing and propulsion geometries. The comparisons were conducted using a common input geometry, but otherwise different input grids and, when appropriate, different flow assumptions to bound the comparisons. The results of these studies showed that the X-57 distributed propulsion wing should be able to meet the as-designed performance in cruise flight, while also meeting or exceeding targets for high-lift generation in low-speed flight.

Borer, Nicholas K.↗
NASA NTRS1994

A high-speed linear algebra library with automatic parallelism

Parallel or distributed processing is key to getting highest performance workstations. However, designing and implementing efficient parallel algorithms is difficult and error-prone. It is even more difficult to write code that is both portable to and efficient on many different computers. Finally, it is harder still to satisfy the above requirements and include the reliability and ease of use required of commercial software intended for use in a production environment. As a result, the application of parallel processing technology to commercial software has been extremely small even though there are numerous computationally demanding programs that would significantly benefit from application of parallel processing. This paper describes DSSLIB, which is a library of subroutines that perform many of the time-consuming computations in engineering and scientific software. DSSLIB combines the high efficiency and speed of parallel computation with a serial programming model that eliminates many undesirable side-effects of typical parallel code. The result is a simple way to incorporate the power of parallel processing into commercial software without compromising maintainability, reliability, or ease of use. This gives significant advantages over less powerful non-parallel entries in the market.

Boucher, Michael L.↗
DOE OSTI2018

FAODEL

FAODEL is a collection of libraries for implementing data management services on high-performance computing (HPC) platforms. It is composed of several components: (1) an RDMA portability library called NNTI for transporting data, (2) an in-application, restful API service, (3) a memory management library for network memory named Lunasa, (4) an asynchronous communication engine, and (5) a distributed key/blob service names Kelpie. Application developers may use these libraries to move data between the distributed nodes of one job to another, as well as to distributed storage resources. FAODEL is different than other communication libraries in that it supports both intra- and inter-job communication, features event-driven mechanisms, and provides high-level primitives for developers to reason about a platform’s distributed resources.

ECP↗
DOE OSTI2024

CP violation searches and distributed computing development with the Belle II Experiment at the University of Mississippi and Brookhaven National Laboratory (Final Report)

This report reflects the work performed at the University of Mississippi under the support of DOE EPSCoR grant DE‐SC0021274 during the period of September 2020 through August 2024, including a one-year, no-cost extension. A summary of the research outcomes is given, with reference to the project goals as stated in the proposal. This successful project supported the mission of the DOE High Energy Physics program by leveraging the complimentary expertise of researchers at the University of Mississippi and Brookhaven National Lab to search for CP violation in charmed baryon decays using data from the Belle II experiment and to provide vital support for Belle II distributed computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Characterizing the performance of node-aware strategies for irregular point-to-point communication on heterogeneous architectures

Supercomputer architectures are trending toward higher computational throughput due to the inclusion of heterogeneous compute nodes. These multi-GPU nodes increase on-node computational efficiency, while also increasing the amount of data to be communicated and the number of potential data flow paths. In this work, we characterize the performance of irregular point-to-point communication with MPI on heterogeneous compute environments through performance modeling, demonstrating the limitations of standard communication strategies for both device-aware and staging-through-host communication techniques. Presented models suggest staging communicated data through host processes then using node-aware communication strategies for high inter-node message counts. Notably, the models also predict that node-aware communication utilizing all available CPU cores to communicate inter-node data leads to the most performant strategy when communicating with a high number of nodes. Furthermore, model validation is provided via a case study of irregular point-to-point communication patterns in distributed sparse matrix–vector products. Importantly, we include a discussion on the implications model predictions have on communication strategy design for emerging supercomputer architectures.

97 MATHEMATICS AND COMPUTING↗