Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “concurrent solutions”

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 19 records

Synchronous and Concurrent Multidomain Computing Method for Cloud Computing Platforms

We present a numerical method for synchronous and concurrent solution of transient elastodynamics problem where the computational domain is divided into subdomains that may reside on separate computational platforms. Here, this work employs the variational multiscale discontinuous Galerkin (VMDG) method to develop interdomain transmission conditions for transient problems. The fine-scale modeling concept leads to variationally consistent coupling terms at the common interfaces. The method admits a large class of time discretization schemes, and decoupling of the solution for each subdomain is achieved by selecting any explicit algorithm. Numerical tests with a manufactured solution problem show optimal convergence rates. The energy history in a free vibration problem is in agreement with that of the solution from a monolithic computational domain.

97 MATHEMATICS AND COMPUTING↗

Software Bill of Materials (SBOM) Sharing Lifecycle Report

As Software Bill of Materials (SBOM) adoption efforts mature, SBOM sharing continues to occur, but no single solution or set of solutions have become ubiquitous. The purpose of this report is to enumerate and describe the different parties and phases of the SBOM sharing lifecycle and assist readers in choosing suitable SBOM sharing solutions based on the amount of time, resources, subject-matter expertise, effort, and access to tooling that is available to the reader to implement a phase of the SBOM sharing lifecycle. The SBOM sharing lifecycle consists of the Discovery, Access, and Transport of an SBOM and this report details these individual phases and how an SBOM goes from author to the consumer. This report also details how potential enrichment activities may be performed on an SBOM to create a new product before or after it has been shared. The concept of a sophistication classification for SBOM sharing solutions is concurrently introduced with a focus on the inclusion or lack of certain features and effort associated with their implementation. Examples of low, medium, and high-sophistication solutions are provided; however, these examples and associated categorizations should not be seen as a qualitative judgment meant to push the reader towards a particular adoption strategy since sharing solutions are chosen based on the unique needs of the user. This report does recommend the SBOM community consider how to make current and future sharing solutions interoperable with each other as well as more automated methods to facilitate sharing and broader SBOM adoption. This report also highlights an SBOM sharing survey results obtained from interviews with stakeholders to understand the current SBOM sharing landscape. The categorized results of the survey suggest that SBOMs are currently transported directly to the receiver through email or similar informal communication mechanisms or alternatively the SBOM resides on a repository available to consumers. In addition to these transport methods, this report captures industry efforts to create private sharing solutions and services that can store and transport enrichment data and may use higher sophistication features that are cloud-based or using distributed ledger technologies.

97 MATHEMATICS AND COMPUTING↗

Vehicle-to-Grid Electric School Bus Commercialization Project

The Vehicle-to-Grid Electric School Bus Commercialization Project was chartered to advance the idea that the batteries in electric vehicles can play a valuable role in supporting the electric grid. As deployment of wind and solar generating resources accelerates to provide an ever-greater share of the nation’s electricity, concurrent investment in solutions that can offset their inherent intermittency will be necessary. Many types of energy storage systems have been proposed, and more than one type will find an economic fit in the grid of the future. Electric vehicle batteries have the potential to provide grid support services in an advantaged manner. The project’s method of exploring this proposition called for development and demonstration of a fleet of vehicle-to-grid (V2G) electric school buses. School buses were chosen because their energy storage capacity is large relative light-duty vehicles; they are typically domiciled in fleet settings; and the number of hours per year they are available for grid support services is high on an absolute basis (generally 80-85% of the hours in a year) and relative to other categories of medium- and heavy-duty vehicles.

33 ADVANCED PROPULSION SYSTEMS↗

Integrated solution techniques for security constrained unit commitment problem

Apparatus and methods are disclosed for solving Mixed Integer Programming (MIP) problems, such as Security Constrained Unit Commitment (SCUC) problems used by power grid authorities to perform day-ahead market clearing. In certain examples, a plurality of threads of a software tool implementing a concurrent optimizer can be executed concurrently and sequentially to generate new solutions to a SCUC problem for an upcoming planning horizon. Data can be shared among the concurrently executing threads, such as intermediate/incumbent solutions and hints regarding the fixing of variables and constraints to reduce the size of the SCUC problem. In some examples, the threads are seeded with historical solutions from prior planning horizons. The software tool can select a best solution from the solutions generated by the threads, and determine dispatch instructions for a device coupled to the power grid for the upcoming planning horizon based at least in part on the selected solution.

Pan, Feng↗

Concurrent measurement of strain and chemical reaction rates in a calcite grain pack undergoing pressure solution: Evidence for surface-reaction controlled dissolution

Pressure solution is inferred to be a significant contributor to sediment compaction and lithification, especially in carbonate sediments. For a sediment deforming primarily by pressure solution, the compaction rate should be directly related to the rate of calcite dissolution, transport along grain contacts, and calcite reprecipitation. Previous experimental work has shown that there is evidence that deformation in wet calcite grain packs is consistent with control by pressure solution, but considerable ambiguity remains regarding the rate limiting mechanism. We present the results of laboratory compaction experiments designed to directly measure calcite dissolution and precipitation rates (recrystallization rates) concurrently with strain rate to test whether measured rates are consistent with predicted rates both in absolute magnitude and time evolution. Recrystallization rates are measured using trace element chemistry (Sr/Ca, Mg/Ca) and isotopes (87Sr/86Sr) of fluids flowing slowly through a compacting grain pack as it is being triaxially compressed. Imaging techniques are used to characterize the grain contacts and strain effects in the post-experiment grain pack. Our data show that calcite recrystallization rates calculated from all three geochemical parameters are in approximate agreement and that the rates closely track strain rate. The geochemically inferred rates are close to predicted rates in absolute magnitude. Uncertainty in grain contact dimensions makes distinguishing between surface reaction control and diffusion control difficult. Measured reaction rates decrease faster than predicted from standard pressure solution creep flow laws. This inconsistency may indicate that calcite dissolution rates at grain contacts are more complex, and more time-dependent, than suggested by geometric models designed to predict grain contact stresses.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Separation of rare earth elements using supported membrane solvent extraction

A system and method for the recovery and separation of rare earth elements (REEs) are provided. The system and method include the supported membrane solvent extraction of REEs and the separation of light and heavy REEs that have been recovered from scrap permanent magnets and other electronic waste. In supported membrane solvent extraction, an organic phase consisting of an extractant and an organic solvent is immobilized in the pores of hollow fibers. An aqueous feed solution and a strip solution flow along the shell side and lumen side of the hollow fibers, respectively. The extractant functions as a carrier to selectively transport certain rare earth metal ions from the feed side to the strip side. The rare earth metals are concurrently back extracted in the strip solution, allowing processing to proceed continuously without equilibrium limitations.

Bhave, Ramesh R.↗

AMRIC: A Novel In Situ Lossy Compression Framework for Efficient I/O in Adaptive Mesh Refinement Applications

As supercomputers advance towards exascale capabilities, computational intensity increases significantly, and the volume of data requiring storage and transmission experiences exponential growth. Adaptive Mesh Refinement (AMR) has emerged as an effective solution to address these two challenges. Concurrently, error-bounded lossy compression is recognized as one of the most efficient approaches to tackle the latter issue. Despite their respective advantages, few attempts have been made to investigate how AMR and error-bounded lossy compression can function together. To this end, this study presents a novel in-situ lossy compression framework that employs the HDF5 filter to improve both I/O costs and boost compression quality for AMR applications. We implement our solution into the AMReX framework and evaluate on two real-world AMR applications, Nyx and WarpX, on the Summit supercomputer. Experiments with 512 cores demonstrate that AMRIC improves the compression ratio by 81X and the I/O performance by 39X over AMReX's original compression solution.

Wang, Daoce↗

Detection of Br and I as atomic anions using liquid sampling – atmospheric pressure glow discharge/Orbitrap mass spectrometry

The quantification and determination of halogen isotope composition is essential in many fields including geochemistry and nuclear forensics. Detection of the halogen elements is commonly attempted with inductively coupled plasma mass spectrometry (ICP-MS) however, there are multiple challenges faced. Most significantly this includes very poor ionization efficiency and the potential for isobaric interferences from either matrix or plasma species. Thus, sensitivity and accuracy are often limiting issues. Here a liquid sampling-atmospheric pressure glow discharge (LS-APGD) ionization source is coupled with an ultrahigh resolution Orbitrap MS to perform halogen detection of bromine and iodine as initial analytes. This facilitates simple and sensitive detection of these elements as atomic anions from simple aqueous salt solutions. Collision-induced dissociation (CID) and higher-energy collisional dissociation (HCD) energies were optimized to produce the maximum response of Br − and I − . The LS-APGD conditions were optimized using a design of experiments (DOE) approach for Br − and I − concurrently. Response curves for Br − and I − solutions determined limit of detection (LOD) values of 50 pg and 5 pg, respectively, in 20 μL aliquots. The curves indicated response factors of 0.67 for 79 Br − and 0.90 for 127 I − . Br isotope ratios were determined with precision between 0.7 and 7.3% RSD, with the isotope ratios determined with precision 0.8% RSD at concentrations above the limit of quantification. Preliminary tests were conducted to evaluate the effect of different cations (Na + , K + , and Mg 2+ ) on Br − responses, with no discernible impacts observed on the halogen signal responses. This study demonstrates the potential use of the LS-APGD-Orbitrap-MS for the detection of multiple halogens while avoiding interferences, minimizing sample preparation, and overcoming ionization barriers.

Lang, Dehlia A. [Clemson University, SC (United St↗

Inkjet printing of epitaxially connected nanocrystal superlattices

Access to a blossoming library of colloidal nanomaterials provides building blocks for complex assembled materials. The journey to bring these prospects to fruition stands to benefit from the application of advanced processing methods. Epitaxially connected nanocrystal (or quantum dot) superlattices present a captivating model system for mesocrystals with intriguing emergent properties. The conventional processing approach to creating these materials involves assembling and attaching the constituent nanocrystals at the interface between two immiscible fluids. Processing small liquid volumes of the colloidal nanocrystal solution involves several complexities arising from the concurrent spreading, evaporation, assembly, and attachment. The ability of inkjet printers to deliver small (typically picoliter) liquid volumes with precise positioning is attractive to advance fundamental insights into the processing science, and thereby potentially enable new routes to incorporate the epitaxially connected superlattices into technology platforms. In this study, we identified the processing window of opportunity, including nanocrystal ink formulation and printing approach to enable delivery of colloidal nanocrystals from an inkjet nozzle onto the surface of a sessile droplet of the immiscible subphase. We demonstrate how inkjet printing can be scaled-down to enable the fabrication of epitaxially connected superlattices on patterned sub-millimeter droplets. Furthermore, we anticipate that insights from this work will spur on future advances to enable more mechanistic insights into the assembly processes and new avenues to create high-fidelity superlattices.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

MassiveGNN: Efficient Training via Prefetching for Massively Connected Distributed Graphs

Graph Neural Networks (GNN) are indispensable in learning from graph-structured data, yet their rising computational costs, especially on massively connected graphs, pose significant challenges in terms of execution performance. To tackle this, distributed-memory solutions such as partitioning the graph to concurrently train multiple replicas of GNNs are in practice. However, approaches requiring a partitioned graph usually suffer from communication overhead and load imbalance, even under optimal partitioning and communication strategies due to irregularities in the neighborhood minibatch sampling. This paper proposes practical trade-offs for improving the sampling and communication overheads for representation learn- ing on distributed graphs (using popular GraphSAGE architecture) by developing a parameterized prefetch and eviction scheme on top of the state-of-the-art Amazon DistDGL distributed GNN framework, demonstrating about 15–40% improvement in end-to-end training performance on the NERSC Perlmutter supercomputer for various OGB datasets.

Machine Leanring, high performance comptuing, grap↗

VTK-m User's Guide (V.1.6)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures.

97 MATHEMATICS AND COMPUTING↗

VTK-m User's' Guide (V.1.7)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.This book includes contributions from the VTK-m community including the VTK-m development team and the user community.

97 MATHEMATICS AND COMPUTING↗

The VTK-m Users' Guide (V.1.9)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

The VTK-m Users' Guide (V.2.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

The VTK-m User's Guide (V. 2.2)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

The Viskores User's Guide (V.1.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi-/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

Cluster dynamics modeling of Mn-Ni-Si precipitates coupled with radiation-induced segregation in low-Cu reactor pressure vessel steels

Formation of precipitates enhanced or induced by irradiation causes hardening and embrittlement of nuclear structural materials. Post-irradiation microstructure characterization of reactor pressure vessel (RPV) steels has shown that precipitation can be strongly associated with radiation-induced segregation (RIS) of solutes on dislocations. However, RIS and precipitation have not been coupled in previous precipitation modeling of RPV steels. Here in this study, a new hybrid and spatially-dependent precipitation model is developed that couples cluster dynamics with RIS, providing an unique way to account for concurrent evolution of heterogeneous cluster densities as well as solute and point defect concentration profiles. The model is applied to study the segregation of Mn, Ni, and Si on dislocations and heterogeneous nucleation of Mn-Ni-Si rich precipitates (MNSPs) in a low-Cu RPV steel. The result shows that the onset of MNSP nucleation on dislocations occurs at the fluence of 2 x 10 23 n.m -2 . The number density and mean radius can reach ~ 10 24 m -3 and 1-2 nm at high fluence, respectively. These observations suggest that the role of RIS and heterogeneous nucleation can be significant for RPV steels under a high fluence of irradiation. Results of simulations adopting various dose rates and dislocation densities show an increased fraction of MNSPs on dislocations at the condition of low dose rate, high dislocation density, and high fluence.

36 MATERIALS SCIENCE↗