Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

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,261 records · Page 70

Low-Energy Solvents For Carbon Dioxide Capture Enabled By A Combination Of Enzymes And Vacuum Regeneration

An integrated bench-scale system combining the attributes of the bio-renewable enzyme carbonic anhydrase (CA) with low-enthalpy CO 2 absorption solvents and vacuum regeneration was designed, built and operated for 500 hours using simulated flue gas. The objective was to develop a CO 2 capture process with improved efficiency and sustainability when compared to NETL Case 10 monoethanolamine (MEA) scrubbing technology. The use of CA accelerates inter-conversion between dissolved CO 2 and bicarbonate ion to enhance CO 2 absorption, and the use of low enthalpy CO 2 absorption solvents makes it possible to regenerate the solvent at lower temperatures relative to the reference MEA-based solvent. The vacuum regeneration-based integrated bench-scale system operated successfully for an accumulated 500 hours using aqueous 23.5 wt% K 2 CO 3 -based solvent containing 2.5 g/L enzyme to deliver an average 84% CO 2 capture when operated with a 20% enzyme replenishment rate per ~7 hour steady-state run period. The total inlet gas flow was 30 standard liters per minute with 15% CO 2 and 85% N 2 . The absorber temperature was 40°C and the stripper operated under 35 kPa pressure with an approximate 77°C stripper bottom temperature. Tests with a 30°C absorber temperature delivered >90% capture. On- and off-line operational measurements provided a full process data set, with recirculating enzyme, that allowed for enzyme replenishment and absorption/desorption kinetic parameter calculations. Dissolved enzyme replenishment and conventional process controls were demonstrated as straightforward approaches to maintain system performance. Preliminary evaluation of a novel flow-through ultrasonically enhanced regeneration system was also conducted, yet resulted in CO2 release within the range of temperature-dependent release, and further work would be needed to validate the benefits of ultrasonic enhanced stripping. A full technology assessment was completed in which four techno-economic cases for enzyme-enhanced aqueous K 2 CO 3 solvent with vacuum stripping were considered and a corresponding set of sensitivity studies were developed. The cases were evaluated using bench-scale and laboratory-based observations, AspenPlus® process simulation and modeling, AspenTech’s CCE® Parametric Software, current vendor quotations, and project partners’ know-how of unit operations. Overall, the DOE target of 90% CO 2 capture could be met using the benign enzyme-enhanced aqueous K 2 CO 3 -based alternative to NETL Case 10. The model-predicted plant COE performance, scaled to 550 MWe net output, was 9% higher than NETL Case 10 for an enzyme-activated case with minimized technical risk and highest confidence in physical system performance utilizing commercially available equipment. A COE improvement of 2.8% versus NETL Case 10 was predicted when favorable features of improved enzyme longevity and additional power output from a very low pressure (VLP) turbine were combined, wherein corresponding high capital and operational costs limited the level of COE benefit. The environmental, health and safety (EH&S) profile of the system was found to be favorable and was compliant with the Federal EH&S legislation reviewed. Further work on a larger scale test unit is recommended to reduce the level of uncertainty inherent in extrapolating findings from a bench-scale unit to a full scale PCC plant, and to further investigate several identified opportunities for improvement. Production feasibility and suitability of carbonic anhydrases for scale-up testing was confirmed both through the current project and through parallel efforts.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Synthesis of Freestanding Single-crystal Perovskite Films and Heterostructures by Etching of Sacrificial Water-soluble Layers

The ability to create and manipulate materials in two-dimensional (2D) form has repeatedly had transformative impact on science and technology. In parallel with the exfoliation and stacking of intrinsically layered crystals, atomic-scale thin film growth of complex materials has enabled the creation of artificial 2D heterostructures with novel functionality and emergent phenomena, as seen in perovskite heterostructures. However, separation of these layers from the growth substrate has proven challenging, limiting the manipulation capabilities of these heterostructures with respect to exfoliated materials. Here we present a general method to create freestanding perovskite membranes. The key is the epitaxial growth of water-soluble Sr 3 Al 2 O 6 on perovskite substrates, followed by in situ growth of films and heterostructures. Millimetre-size single-crystalline membranes are produced by etching the Sr 3 Al 2 O 6 layer in water, providing the opportunity to transfer them to arbitrary substrates and integrate them with heterostructures of semiconductors and layered compounds.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Practical applications of machine-learned flows on gauge fields

Normalizing flows are machine-learned maps between different lattice theories which can be used as components in exact sampling and inference schemes. Ongoing work yields increasingly expressive flows on gauge fields, but it remains an open question how flows can improve lattice QCD at state-of-the-art scales. We discuss and demonstrate two applications of flows in replica exchange (parallel tempering) sampling, aimed at improving topological mixing, which are viable with iterative improvements upon presently available flows.

Abbott, Ryan↗

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

Integrated in silico analyses of regulatory and metabolic networks of Synechococcus sp. PCC 7002 reveal relationships between gene centrality and essentiality

Cyanobacteria dynamically relay environmental inputs to intracellular adaptations through a coordinated adjustment of photosynthetic efficiency and carbon processing rates. The output of such adaptations is reflected through changes in transcriptional patterns and metabolic flux distributions that ultimately define growth strategy. To address interrelationships between metabolism and regulation, we performed integrative analyses of metabolic and gene co-expression networks in a model cyanobacterium, Synechococcus sp. PCC 7002. Centrality analyses using the gene co-expression network identified a set of key genes, which were defined here as ‘topologically important.’ Parallel in silico gene knock-out simulations, using the genome-scale metabolic network, classified what we termed as ‘functionally important’ genes, deletion of which affected growth or metabolism. A strong positive correlation was observed between topologically and functionally important genes. Functionally important genes exhibited variable levels of topological centrality; however, the majority of topologically central genes were found to be functionally essential for growth. Subsequent functional enrichment analysis revealed that both functionally and topologically important genes in Synechococcus sp. PCC 7002 are predominantly associated with translation and energy metabolism, two cellular processes critical for growth. This research demonstrates how synergistic network-level analyses can be used for reconciliation of metabolic and gene expression data to uncover fundamental biological principles.

59 BASIC BIOLOGICAL SCIENCES↗

GR-Athena++: Puncture Evolutions on Vertex-centered Oct-tree Adaptive Mesh Refinement

Numerical relativity is central to the investigation of astrophysical sources in the dynamical and strong-field gravity regime, such as binary black hole and neutron star coalescences. Current challenges set by gravitational-wave and multimessenger astronomy call for highly performant and scalable codes on modern massively parallel architectures. We present GR-Athena++, a general-relativistic, high-order, vertex-centered solver that extends the oct-tree, adaptive mesh refinement capabilities of the astrophysical (radiation) magnetohydrodynamics code Athena++. To simulate dynamical spacetimes, GR-Athena++ uses the Z4c evolution scheme of numerical relativity coupled to the moving puncture gauge. We demonstrate stable and accurate binary black hole merger evolutions via extensive convergence testing, cross-code validation, and verification against state-of-the-art effective-one-body waveforms. GR-Athena++ leverages the task-based parallelism paradigm of Athena++ to achieve excellent scalability. We measure strong-scaling efficiencies above 95% for up to ~1.2 × 10 4 CPUs and excellent weak scaling is shown up to ~10 5 CPUs in a production binary black hole setup with adaptive mesh refinement. GR-Athena++ thus allows for the robust simulation of compact binary coalescences and offers a viable path toward numerical relativity at exascale.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational modeling of composite material fires.

Composite materials behave differently from conventional fuel sources and have the potential to smolder and burn for extended time periods. As the amount of composite materials on modern aircraft continues to increase, understanding the response of composites in fire environments becomes increasingly important. An effort is ongoing to enhance the capability to simulate composite material response in fires including the decomposition of the composite and the interaction with a fire. To adequately model composite material in a fire, two physical model development tasks are necessary; first, the decomposition model for the composite material and second, the interaction with a fire. A porous media approach for the decomposition model including a time dependent formulation with the effects of heat, mass, species, and momentum transfer of the porous solid and gas phase is being implemented in an engineering code, ARIA. ARIA is a Sandia National Laboratories multiphysics code including a range of capabilities such as incompressible Navier-Stokes equations, energy transport equations, species transport equations, non-Newtonian fluid rheology, linear elastic solid mechanics, and electro-statics. To simulate the fire, FUEGO, also a Sandia National Laboratories code, is coupled to ARIA. FUEGO represents the turbulent, buoyantly driven incompressible flow, heat transfer, mass transfer, and combustion. FUEGO and ARIA are uniquely able to solve this problem because they were designed using a common architecture (SIERRA) that enhances multiphysics coupling and both codes are capable of massively parallel calculations, enhancing performance. The decomposition reaction model is developed from small scale experimental data including thermogravimetric analysis (TGA) and Differential Scanning Calorimetry (DSC) in both nitrogen and air for a range of heating rates and from available data in the literature. The response of the composite material subject to a radiant heat flux boundary condition is examined to study the propagation of decomposition fronts of the epoxy and carbon fiber and their dependence on the ambient conditions such as oxygen concentration, surface flow velocity, and radiant heat flux. In addition to the computational effort, small scaled experimental efforts to attain adequate data used to validate model predictions is ongoing. The goal of this paper is to demonstrate the progress of the capability for a typical composite material and emphasize the path forward.

36 MATERIALS SCIENCE↗

Simulation of water flow in terrestrial systems

ParFlow is a parallel, variabley saturated groundwater flow code that is especially suitable for large scale problem. ParFlow simulates the three-dimensional saturated and variably saturated subsurface flow in heterogeneous porous media in three spatial dimensions. ParFlow's developemt and appkication has been on-ging for more than 10 uear. ParFlow has recently been extended to coupled surface-subsurface flow to enabel the simulation of hillslope runoff and channel routing in a truly integrated fashion. ParFlow simulates the three-dimensional varably saturated subsurface flow in strongly heterogeneous porous media in three spatial dimension.

Source record↗

HEP Software Foundation Community White Paper Working Group - Data Processing Frameworks

Data processing frameworks are an essential part of HEP experiments' software stacks. Frameworks provide a means by which code developers can undertake the essential tasks of physics data processing, accessing relevant inputs and storing their outputs, in a coherent way without needing to know the details of other domains. Frameworks provide essential core services for developers and help deliver a configurable working application to the experiments' production systems. Modern HEP processing frameworks are in the process of adapting to a new computing landscape dominated by parallel processing and heterogeneity, which pose many questions regarding enhanced functionality and scaling that must be faced without compromising the maintainability of the code. In this paper we identify a program of work that can help further clarify the key concepts of frameworks for HEP and then spawn R&D activities that can focus the community's efforts in the most efficient manner to address the challenges of the upcoming experimental program.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Very Large Scale Integration of Nano-Patterned YBa2Cu3O7-delta Josephson Junctions in a Two-Dimensional Array

Very large scale integration of Josephson junctions in a two-dimensional series-parallel array has been achieved by ion irradiating a YBa{sub 2}Cu{sub 3}O{sub 7-{delta}} film through slits in a nano-fabricated mask created with electron beam lithography and reactive ion etching. The mask consisted of 15,820 high-aspect ratio (20:1), 35-nm wide slits that restricted the irradiation in the film below to form Josephson junctions. Characterizing each parallel segment k, containing 28 junctions, with a single critical current I{sub ck} we found a standard deviation in I{sub ck} of about 16%.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

CEAZ: Accelerating Parallel I/O Via Hardware-Algorithm Co-Designed Adaptive Lossy Compression

As supercomputers continue to grow to exa-scale, the amount of data that needs to be saved or transmitted is exploding. To this end, many previous works have studied using error-bounded lossy compressors to reduce the data size and improve the I/O performance. However, little work has been done for effectively offloading lossy compression onto FPGA-based SmartNICs to reduce the compression overhead. In this paper, we propose a hardware-algorithm co-design of efficient and adaptive lossy compressor for scientific data on FPGAs (called CEAZ) to accelerate parallel I/O. Our contribution is fourfold: (1) We propose an efficient Huffman coding approach that can adaptively update Huffman codewords online based on codewords generated offline (from a variety of representative scientific datasets). (2) We derive a theoretical analysis to support a precise control of compression ratio under an error-bounded compression mode, enabling accurate offline Huffman codewords generation. This also help us create a fixed-ratio compression mode for consistent throughput. (3) We develop an efficient compression pipeline by adopting cuSZ’s dual-quantization algorithm to our hardware use case. (4) We evaluate CEAC on five real-world datasets with both a single FPGA board and 256 nodes from Bridges2 supercomputer. Experiments show that CEAZ outperforms the second-best FPGA-based lossy compressor by 2× of throughput and 9.6× of compression ratio. It also improves MPI_File_write and MPI_Gather throughputs by up to 32.7× and 31.4×, respectively.

Zhang, Chengming↗

Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering

The maximal independent set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of graph data suggests the use of distributed memory hardware as a cost-effective approach to providing necessary compute and memory resources. Existing distributed memory parallel MIS algorithms rely on synchronous communication and use techniques such as subgraph computations. In this paper, we present an asynchronous distributed-memory parallel graph algorithm that relies on a virtual directed acyclic graph (DAG) that is created during the algorithm execution. We introduce two additional algorithms that save computations by ordering generated work. The first algorithm applies ordering globally to reduce computations, and the second algorithm applies ordering locally at the level of threads to minimize the synchronization overhead. We use two different implementations of Luby’s algorithm variants as baseline to compare the performance of the presented algorithms: (1) vertex-centric Luby A and Luby B implementations, and (2) the CombBLAS linear-algebra Luby A implementation. Results show that proposed algorithms outperform both implementations of Luby algorithms, especially in distributed execution. Furthermore, we show that for low-diameter graphs the algorithm that applies global ordering scales better than other algorithms and for high diameter graphs the original asynchronous algorithm and thread-level ordering algorithm show better performance.

maximal independent set (MIS), distributed memory ↗

Performance Analysis Tool for HPC and Big Data Applications on Scientific Clusters

Big data is prevalent in HPC computing. Many HPC projects rely on complex workflows to analyze terabytes or petabytes of data. These workflows often require running over thousands of CPU cores and performing simultaneous data accesses, data movements, and computation. It is challenging to analyze the performance involving terabytes or petabytes of workflow data or measurement data of the executions, from complex workflows over a large number of nodes and multiple parallel task executions. To help identify performance bottlenecks or debug the performance issues in large-scale scientific applications and scientific clusters, we have developed a performance analysis framework, using state-ofthe- art open-source big data processing tools. Our tool can ingest system logs and application performance measurements to extract key performance features, and apply the most sophisticated statistical tools and data mining methods on the performance data. It utilizes an efficient data processing engine to allow users to interactively analyze a large amount of different types of logs and measurements. To illustrate the functionality of the big data analysis framework, we conduct case studies on the workflows from an astronomy project known as the Palomar Transient Factory (PTF) and the job logs from the genome analysis scientific cluster. Our study processed many terabytes of system logs and application performance measurements collected on the HPC systems at NERSC. The implementation of our tool is generic enough to be used for analyzing the performance of other HPC systems and Big Data workows.

97 MATHEMATICS AND COMPUTING↗

Scalable Multilevel Uncertainty Quantification Concepts for Extreme-Scale Multiscale Problems

Our work in this project is aimed at making fundamental advances in multilevel and multiscale methods for problems with uncertainties related to flows in porous media. The main thrust of this research is to develop a systematic multiscale, multilevel parallel approaches for problems with uncertainties and use them in the uncertainty quantification. A key emphasis is on problems without an apparent scale separation in space, time, and uncertainty spaces. Multiscale solution methods are currently under active investigation. However, the develop- ment of multiscale methods for problems with uncertainties where the scales and uncertainties are tightly coupled is a research area that is less explored. During this project, we have made some significant contributions to the developments of multiscale methods, the uncertainty quantification for multiscale methods, multiscale model learning, uncertainty quantification in inverse problems, and applications.

97 MATHEMATICS AND COMPUTING↗

Assembly and Analysis of Cell-Scale Membrane Envelopes

The march toward exascale computing will enable routine molecular simulation of larger and more complex systems, for example, simulation of entire viral particles, on the scale of approximately billions of atoms-a simulation size commensurate with a small bacterial cell. Anticipating the future hardware capabilities that will enable this type of research and paralleling advances in experimental structural biology, efforts are currently underway to develop software tools, procedures, and workflows for constructing cell-scale structures. Herein, we describe our efforts in developing and implementing an efficient and robust workflow for construction of cell-scale membrane envelopes and embedding membrane proteins into them. A new approach for construction of massive membrane structures that are stable during the simulations is built on implementing a subtractive assembly technique coupled with the development of a structure concatenation tool (fastmerge), which eliminates overlapping elements based on volumetric criteria rather than adding successive molecules to the simulation system. Using this approach, we have constructed two "protocells" consisting of MARTINI coarse-grained beads to represent cellular membranes, one the size of a cellular organelle and another the size of a small bacterial cell. The membrane envelopes constructed here remain whole during the molecular dynamics simulations performed and exhibit water flux only through specific proteins, demonstrating the success of our methodology in creating tight cell-like membrane compartments. Extended simulations of these cell-scale structures highlight the propensity for nonspecific interactions between adjacent membrane proteins leading to the formation of protein microclusters on the cell surface, an insight uniquely enabled by the scale of the simulations. We anticipate that the experiences and best practices presented here will form the basis for the next generation of cell-scale models, which will begin to address the addition of soluble proteins, nucleic acids, and small molecules essential to the function of a cell.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Measurements of long-range enhanced collisional velocity drag through plasma wave damping

Here we present damping measurements of axial plasma waves in magnetized, multispecies ion plasmas. At high temperatures $T≳10^{-2}$ eV, collisionless Landau damping dominates, whereas, at lower temperatures $T≲10^{-2}$ eV, the damping arises from interspecies collisional drag, which is dependent on the plasma composition and scales roughly as $T^{-3/2}$. This drag damping is proportional to the rate of parallel collisional slowing, and is found to exceed classical predictions of collisional drag damping by as much as an order of magnitude, but agrees with a new collision theory that includes long-range collisions. Centrifugal mass separation and collisional locking of the species occur at ultra-low temperatures $T≲10^{-3}$ eV, which reduce the drag damping from the $T^{-3/2}$ collisional scaling. These mechanisms are investigated by measuring the damping of higher frequency axial modes, and by measuring the damping in plasmas with a non-equilibrium species profile.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Technical Report: Scalable Parallel Algorithms for High Dimensional Numerical Integration

We implemented a scalable parallel quasi-Monte Carlo numerical high-dimensional integration for tera-scale data points. The implemented algorithm uses the Sobol s quasi-sequences to generate random samples. Sobol s sequence was used to avoid clustering effects in the generated random samples and to produce low-discrepancy random samples which cover the entire integration domain. The performance of the algorithm was tested. Obtained results prove the scalability and accuracy of the implemented algorithms. The implemented algorithm could be used in different applications where a huge data volume is generated and numerical integration is required. We suggest using the hyprid MPI and OpenMP programming model to improve the performance of the algorithms. If the mixed model is used, attention should be paid to the scalability and accuracy.

97 MATHEMATICS AND COMPUTING↗

A Structure-Based Distance Metric for High-Dimensional Space Exploration with Multi-Dimensional Scaling

Although the Euclidean distance does well in measuring data distances within high-dimensional clusters, it does poorly when it comes to gauging inter-cluster distances. This significantly impacts the quality of global, low-dimensional space embedding procedures such as the popular multi-dimensional scaling (MDS) where one can often observe non-intuitive layouts. We were inspired by the perceptual processes evoked in the method of parallel coordinates which enables users to visually aggregate the data by the patterns the polylines exhibit across the dimension axes. We call the path of such a polyline its structure and suggest a metric that captures this structure directly in high-dimensional space. This allows us to better gauge the distances of spatially distant data constellations and so achieve data aggregations in MDS plots that are more cognizant of existing high-dimensional structure similarities. Our MDS plots also exhibit similar visual relationships as the method of parallel coordinates which is often used alongside to visualize the high-dimensional data in raw form. We then cast our metric into a bi-scale framework which distinguishes far-distances from near-distances. The coarser scale uses the structural similarity metric to separate data aggregates obtained by prior classification or clustering, while the finer scale employs the appropriate Euclidean distance.

Clustering↗