Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic graph”

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.

806 records · Page 45

ADEPT: a domain independent sequence alignment strategy for gpu architectures

Bioinformatic workflows frequently make use of automated genome assembly and protein clustering tools. At the core of most of these tools, a significant portion of execution time is spent in determining optimal local alignment between two sequences. This task is performed with the Smith-Waterman algorithm, which is a dynamic programming based method. With the advent of modern sequencing technologies and increasing size of both genome and protein databases, a need for faster Smith-Waterman implementations has emerged. Multiple SIMD strategies for the Smith-Waterman algorithm are available for CPUs. However, with the move of HPC facilities towards accelerator based architectures, a need for an efficient GPU accelerated strategy has emerged. Existing GPU based strategies have either been optimized for a specific type of characters (Nucleotides or Amino Acids) or for only a handful of application use-cases. In this paper, we present ADEPT, a new sequence alignment strategy for GPU architectures that is domain independent, supporting alignment of sequences from both genomes and proteins. Our proposed strategy uses GPU specific optimizations that do not rely on the nature of sequence. We demonstrate the feasibility of this strategy by implementing the Smith-Waterman algorithm and comparing it to similar CPU strategies as well as the fastest known GPU methods for each domain. ADEPT’s driver enables it to scale across multiple GPUs and allows easy integration into software pipelines which utilize large scale computational systems. We have shown that the ADEPT based Smith-Waterman algorithm demonstrates a peak performance of 360 GCUPS and 497 GCUPs for protein based and DNA based datasets respectively on a single GPU node (8 GPUs) of the Cori Supercomputer. Overall ADEPT shows 10x faster performance in a node-to-node comparison against a corresponding SIMD CPU implementation. ADEPT demonstrates a performance that is either comparable or better than existing GPU strategies. We demonstrated the efficacy of ADEPT in supporting existing bionformatics software pipelines by integrating ADEPT in MetaHipMer a high-performance denovo metagenome assembler and PASTIS a high-performance protein similarity graph construction pipeline. Our results show 10% and 30% boost of performance in MetaHipMer and PASTIS respectively.

59 BASIC BIOLOGICAL SCIENCES↗

Grid Cyber-Security Strategy in an Attacker-Defender Model

The progression of cyber-attacks on the cyber-physical system is analyzed by the Probabilistic, Learning Attacker, and Dynamic Defender (PLADD) model. Although our research does apply to all cyber-physical systems, we focus on power grid infrastructure. The PLADD model evaluates the effectiveness of moving target defense (MTD) techniques. We consider the power grid attack scenarios in the AND configurations and OR configurations. In addition, we consider, for the first time ever, power grid attack scenarios involving both AND configurations and OR configurations simultaneously. Cyber-security managers can use the strategy introduced in this manuscript to optimize their defense strategies. Specifically, our research provides insight into when to reset access controls (such as passwords, internet protocol addresses, and session keys), to minimize the probability of a successful attack. Our mathematical proof for the OR configuration of multiple PLADD games shows that it is best if all access controls are reset simultaneously. For the AND configuration, our mathematical proof shows that it is best (in terms of minimizing the attacker's average probability of success) that the resets are equally spaced apart. We introduce a novel concept called hierarchical parallel PLADD system to cover additional attack scenarios that require combinations of AND and OR configurations.

97 MATHEMATICS AND COMPUTING↗

Multidisciplinary Model Transformation Through Simplified Intermediate Representations

There has long been a challenge of making engineering tools from multiple disciplines interoperate. This problem extends to system modeling practices. This challenge has been confronted with a wide variety of techniques. These techniques include attempting to interface tools together into combined suites, attempting to find underlying commonalities in mathematics, supporting connections through semantic encoding, various graph mappings and transformations, and code wrappers. All of these approaches have strengths and weaknesses. These are measured in multiple areas: relative freedom of action of individual domain engineers in developing their own tools, speed of execution, ease of creation, traceability, fidelity of information transfer, and degree of alignment between the concepts of different domains. This paper presents an approach to this interoperation problem currently being used in the World-Wide Web. The approach is to develop easy-to-parse formats that allow flexibility to both the file author and file interpreter. Many of the formats that are currently deployed sacrifice runtime performance for the ability of third parties to easily understand what to do with the data. XML became popular earlier as a de-facto standard format for many web applications, but is now being replaced by JSON to enhance human readability and provide a simpler data model. This is the basis for work in this paper. Our approach, which provides the key to interoperation, is a simplified “shrapnel” intermediate collection of objects and relationships that is the result of a breakdown of the system model into minimal pieces. It is then reassembled on the destination side, forming a two-step transformation. Previous efforts with single-step transformations have proven too difficult to create efficiently. In contrast, the use of this approach leads to an almost automatic procedure for transformation development. The Europa project is a large engineering project that must coordinate the efforts of many different teams with different specialties. The traditional form of exchanging engineering information has been documentation. The vision of model-based systems engineering is to make this information exchange much more digital. This paper presents the application of our simplified format to connecting two different engineering tools to the system model, with a focus on a dynamic mission simulation encoded in Modelica.

Cole, Bjorn↗

Obstacles to quantum annealing in a planar embedding of XORSAT

We introduce a planar embedding of the k-regular k-XORSAT problem, in which solutions are encoded in the ground state of a classical statistical mechanics model of reversible logic gates arranged on a square grid and acting on bits that represent the Boolean variables of the problem. The special feature of this embedding is that the resulting model lacks a finite-temperature phase transition, thus bypassing the first-order thermodynamic transition known to occur in the random graph representation of XORSAT. In spite of this attractive feature, the thermal relaxation into the ground state displays remarkably slow glassy behavior. The question addressed in this paper is whether this planar embedding can afford an efficient path to solution of k-regular k-XORSAT via quantum adiabatic annealing. We first show that our model bypasses an avoided level crossing and consequent exponentially small gap in the limit of small transverse fields. We then present quantum Monte Carlo results for our embedding of the k-regular k-XORSAT that strongly support a picture in which second-order and first-order transitions develop at a finite transverse field for k = 2 and k = 3, respectively. Furthermore, this translates into power-law and exponential dependences in the scaling of energy gaps with system size, corresponding to times-to-solution which are, respectively, polynomial and exponential in the number of variables. We conclude that neither classical nor quantum annealing can efficiently solve our reformulation of XORSAT, even though the original problem can be solved in polynomial time by Gaussian elimination.

2-dimensional systems↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

The circular bioeconomy: a driver for system integration

Background: Human and earth system modeling, traditionally centered on the interplay between the energy system and the atmosphere, are facing a paradigm shift. The Intergovernmental Panel on Climate Change’s mandate for comprehensive, cross-sectoral climate action emphasizes avoiding the vulnerabilities of narrow sectoral approaches. Our study explores the circular bioeconomy, highlighting the intricate interconnections among agriculture, forestry, aquaculture, technological advancements, and ecological recycling. Collectively, these sectors play a pivotal role in supplying essential resources to meet the food, material, and energy needs of a growing global population. We pose the pertinent question of what it takes to integrate these multifaceted sectors into a new era of holistic systems thinking and planning. Results: The foundation for discussion is provided by a novel graphical representation encompassing statistical data on food, materials, energy flows, and circularity. This representation aids in constructing an inventory of technological advancements and climate actions that have the potential to significantly reshape the structure and scale of the economic metabolism in the coming decades. In this context, the three dominant mega-trends—population dynamics, economic developments, and the climate crisis—compel us to address the potential consequences of the identified actions, all of which fall under the four categories of substitution, efficiency, sufficiency, and reliability measures. Substitution and efficiency measures currently dominate systems modeling. Including novel bio-based processes and circularity aspects might require only expanded system boundaries. Conversely, paradigm shifts in systems engineering are expected to center on sufficiency and reliability actions. Effectively assessing the impact of sufficiency measures will necessitate substantial progress in inter- and transdisciplinary collaboration, primarily due to their non-technological nature. In addition, placing emphasis on modeling the reliability and resilience of transformation pathways represents a distinct and emerging frontier that highlights the significance of an integrated network of networks. Conclusions: Existing and emerging circular bioeconomy practices can serve as prime examples of system integration. These practices facilitate the interconnection of complex biomass supply chain networks with other networks encompassing feedstock-independent renewable power, hydrogen, CO 2 , water, and other biotic, abiotic, and intangible resources. Elevating the prominence of these connectors will empower policymakers to steer the amplification of synergies and mitigation of tradeoffs among systems, sectors, and goals.

09 BIOMASS FUELS↗

GROWdb US River Systems - Samples

GROW Overview We developed the Genome Resolved Open Watersheds database (GROWdb), which aims to increase genomic sampling and understanding of global river microbiomes. An emphasis of GROWdb is to create a publicly available and ever-expanding microbial genome database that is focused on rivers while being interoperable with databases from other ecosystems. GROWdb is based on a network-of-networks approach to move beyond a small collection of well-studied rivers, towards a spatially distributed, global network of systematic observations. GROWdb represents the first microbial, river-focused resource parsed at various scales from genes to MAGs to community level including expression and potential based measurements that will be of interest to microbiologists, ecologists, geochemists, hydrologists, and modelers. Dataset Acknowledgement GROWdb contains data from various research campaigns, please acknowledge the following data generators, as appropriate: WHONDRS derived genomes or samples - include this statement in your acknowledgements: “This study used data from the Worldwide Hydrobiogeochemistry Observation Network for Dynamic River Systems (WHONDRS) under the River Corridor Science Focus Area (SFA) at the Pacific Northwest National Laboratory (PNNL) that was generated at the U.S. Department of Energy (DOE) Joint Genome Institute User Facility. PNNL is operated by Battelle Memorial Institute for the U.S. DOE under Contract No. DE-AC05-76RL01830. The SFA is supported by the U.S. DOE, Office of Biological and Environmental Research (BER), Environmental System Science (ESS) Program.” Total Samples loaded onto this Narrative: 178 Note: Not all GROW samples may be loaded into KBase Data Availability The data underlying GROWdb are accessible across various platforms to ensure all levels of data structure are widely available. First, all reads and MAGs are publicly hosted on National Center for Biotechnology (NCBI) under Bioproject PRJNA946291. Second, all data related data presented here including MAG annotations, extended data tables, phylogenetic tree files, antibiotic resistance gene database files, and MAG abundance tables are available in Zenodo (link). Beyond the flat database files listed above, our aim for GROWdb was to maximize data use by making the data available in searchable and interactive platforms including the National Microbiome Data Collaborative (NMDC) data portal, the Department of Energy’s Systems Biology Knowledgebase (KBase), and a GROW specific user interface released here, GROWdb Explorer. Each platform provides different ways to interact with GROWdb: NMDC GROWdb formed a pilot project for the NMDC. Specifically, individual GROWdb datasets (metagenomes, metatranscriptomes, etc) are easily accessible and searchable through the NMDC data portal, where they are systematically connected to each other and to a rich suite of sample information and standard analysis results, following Findable, Accessible, Interoperable, and Reusable (FAIR) data practices. KBase GROWdb is publicly available within KBase, including samples (this Narrative), MAGs, and corresponding genome scale metabolic models. Access within KBase allows for immediate access and reuse of data, including comparison to private data using KBase’s 500+ analysis tools. Other linked narratives in KBase: GROW Metagenome Assembled Genomes (MAGs) GROW Metabolic Models GROWdb Explorer GROWdb data is also explorable through a graphical user interface built through the Colorado State University Geospatial Centroid (https://geocentroid.shinyapps.io/GROWdatabase/), allowing users to search and graph microbial and spatial data simultaneously. In summary, this microbial genome resource represents the first publicly available genome collection from rivers and offers data that can be leveraged across microbiome studies. GROWdb is an expanding repository to incorporate and unify global river multi-omic data for the future.

59 BASIC BIOLOGICAL SCIENCES↗

Wide Range SET Pulse Measurement

A method for measuring a wide range of SET pulses is demonstrated. Use of dynamic logic, faster than ordinary CMOS, allows capture of short pulses. A weighted binning of SET lengths allows measurement of a wide range of pulse lengths with compact circuitry. A pulse-length-conservative pulse combiner tree routes SETs from combinational logic to the measurement circuit, allowing SET measurements in circuits that cannot easily be arranged in long chains. The method is applied to add-multiplex combinational logic, and to an array of NFET routing switches, at .35 micron. Pulses are captured in a chain of Domino Logic AND gates. Propagation through the chain is frozen on the trailing edge by dropping low the second "enable" input to the AND gates. Capacitive loading is increased in the latter stages to create an approximately logarithmic weighted binning, so that a broad range of pulse lengths can be captured with a 10 stage capture chain. Simulations show pulses can be captured which are 1/5th the length of those typically captured with leading edge triggered latch methods, and less than the length of those captured with a trailing edge latch method. After capture, the pulse pattern is transferred to an SEU protected shift register for readout. 64 instances of each of two types of logic are used as targets. One is a full adder with a 4 to 1 mux on its inputs. The other is a 4 x 4 NFET routing matrix. The outputs are passed through buffered XNOR comparators to identify pulses, which are merged in a buffered not-nand (OR) tree designed to avoid pulse absorption as much as possible. The output from each of the two test circuits are input into separate pulse measurement circuits. Test inputs were provided so that the circuit could be bench tested and calibrated. A third SET measurement circuit with no inputs was used to judge the contribution from direct hits on the measurement circuit. Heavy ions were used with an LET range from 12 to 176. At LET of 21 and below, the very small number of SETs were not significantly higher in the test over the control circuits. At higher LET the test circuit SETs are one or two orders of magnitude greater than for the control circuit. The NFET circuit produces more and slightly longer SETs as expected. But the differences do not appear to be significant enough to modify strategies now used to avoid capture of SETs in chips such as FPGAs. Complete data and graphs will be in the full paper / presentation. In the summary figure below left, NOCL is the reference circuit without any input, and number of stages triggered is plotted. Simulation at right shows the smallest pulse captured (stage 2) at about 300 ps. Our conclusion is that the method is promising, but that improvements in the merge network are desirable before applying in a deep submicron process

Shuler, Robert L.↗

PLANETESIMAL AND PROTOPLANET DYNAMICS IN A TURBULENT PROTOPLANETARY DISK: IDEAL UNSTRATIFIED DISKS

The dynamics of planetesimals and planetary cores may be strongly influenced by density perturbations driven by magneto-rotational turbulence in their natal protoplanetary gas disks. Using the local shearing box approximation, we perform numerical simulations of planetesimals moving as massless particles in a turbulent, magnetized, unstratified gas disk. Our fiducial disk model shows turbulent accretion characterized by a Shakura-Sunyaev viscosity parameter of alpha approx 10{sup -2}, with rms density perturbations of approx10%. We measure the statistical evolution of particle orbital properties in our simulations including mean radius, eccentricity, and velocity dispersion. We confirm random walk growth in time of all three properties, the first time that this has been done with direct orbital integration in a local model. We find that the growth rate increases with the box size used at least up to boxes of eight scale heights in horizontal size. However, even our largest boxes show velocity dispersions sufficiently low that collisional destruction of planetesimals should be unimportant in the inner disk throughout its lifetime. Our direct integrations agree with earlier torque measurements showing that type I migration dominates over diffusive migration by stochastic torques for most objects in the planetary core and terrestrial planet mass range. Diffusive migration remains important for objects in the mass range of kilometer-sized planetesimals. Discrepancies in the derived magnitude of turbulence between local and global simulations of magneto-rotationally unstable disks remains an open issue, with important consequences for planet formation scenarios.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamic Retrieval Augmented Generation of Ontologies using Artificial Intelligence (DRAGON-AI)

Ontologies are fundamental components of informatics infrastructure in domains such as biomedical, environmental, and food sciences, representing consensus knowledge in an accurate and computable form. However, their construction and maintenance demand substantial resources and necessitate substantial collaboration between domain experts, curators, and ontology experts. We present Dynamic Retrieval Augmented Generation of Ontologies using AI (DRAGON-AI), an ontology generation method employing Large Language Models (LLMs) and Retrieval Augmented Generation (RAG). DRAGON-AI can generate textual and logical ontology components, drawing from existing knowledge in multiple ontologies and unstructured text sources.We assessed performance of DRAGON-AI on de novo term construction across ten diverse ontologies, making use of extensive manual evaluation of results. Our method has high precision for relationship generation, but has slightly lower precision than from logic-based reasoning. Our method is also able to generate definitions deemed acceptable by expert evaluators, but these scored worse than human-authored definitions. Notably, evaluators with the highest level of confidence in a domain were better able to discern flaws in AI-generated definitions. We also demonstrated the ability of DRAGON-AI to incorporate natural language instructions in the form of GitHub issues.These findings suggest DRAGON-AI's potential to substantially aid the manual ontology construction process. However, our results also underscore the importance of having expert curators and ontology editors drive the ontology generation process.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Bacterial diversity dynamics in microbial consortia selected for lignin utilization

Lignin is nature’s largest source of phenolic compounds. Its recalcitrance to enzymatic conversion is still a limiting step to increase the value of lignin. Although bacteria are able to degrade lignin in nature, most studies have focused on lignin degradation by fungi. To understand which bacteria are able to use lignin as the sole carbon source, natural selection over time was used to obtain enriched microbial consortia over a 12-week period. The source of microorganisms to establish these microbial consortia were commercial and backyard compost soils. Cultivation occurred at two different temperatures, 30°C and 37°C, in defined culture media containing either Kraft lignin or alkaline-extracted lignin as carbon source. iTag DNA sequencing of bacterial 16S rDNA gene was performed for each of the consortia at six timepoints (passages). The initial bacterial richness and diversity of backyard compost soil consortia was greater than that of commercial soil consortia, and both parameters decreased after the enrichment protocol, corroborating that selection was occurring. Bacterial consortia composition tended to stabilize from the fourth passage on. After the enrichment protocol, Firmicutes phylum bacteria were predominant when lignin extracted by alkaline method was used as a carbon source, whereas Proteobacteria were predominant when Kraft lignin was used. Bray-Curtis dissimilarity calculations at genus level, visualized using NMDS plots, showed that the type of lignin used as a carbon source contributed more to differentiate the bacterial consortia than the variable temperature. The main known bacterial genera selected to use lignin as a carbon source were Altererythrobacter , Aminobacter , Bacillus , Burkholderia , Lysinibacillus , Microvirga , Mycobacterium , Ochrobactrum , Paenibacillus , Pseudomonas , Pseudoxanthomonas , Rhizobiales and Sphingobium . These selected bacterial genera can be of particular interest for studying lignin degradation and utilization, as well as for lignin-related biotechnology applications.

59 BASIC BIOLOGICAL SCIENCES↗

A new class of accelerated kinetic Monte Carlo algorithms

Kinetic ( aka dynamic) Monte Carlo (KMC) is a powerful method for numerical simulations of time dependent evolution applied in a wide range of contexts including biology, chemistry, physics, nuclear sciences, financial engineering, etc. Generally, in a KMC the time evolution takes place one event at a time, where the sequence of events and the time intervals between them are selected (or sampled) using random numbers. While details of the method implementation vary depending on the model and context, there exist certain common issues that limit KMC applicability in almost all applications. Among such is the notorious 'flicker problem' where the same states of the systems are repeatedly visited but otherwise no essential evolution is observed. In its simplest form the flicker problem arises when two states are connected to each other by transitions whose rates far exceed the rates of all other transitions out of the same two states. In such cases, the model will endlessly hop between the two states otherwise producing no meaningful evolution. In most situation of practical interest, the trapping cluster includes more than two states making the flicker somewhat more difficult to detect and to deal with. Several methods have been proposed to overcome or mitigate the flicker problem, exactly or approximately. Of the exact methods, the one proposed by Novotny is perhaps most relevant to our research. Novotny formulates the problem of escaping from a trapping cluster as a Markov system with absorbing states. Given an initial state inside the cluster, it is in principle possible to solve the Master Equation for the time dependent probabilities to find the walker in a given state (transient or absorbing) of the cluster at any time in the future. Novotny then proceeds to demonstrate implementation of his general method to trapping clusters containing the initial state plus one or two transient states and all of their absorbing states. Similar methods have been subsequently proposed in [refs] but applied in a different context. The most serious deficiency of the earlier methods is that size of the trapping cluster size is fixed and often too small to bring substantial simulation speedup. Furthermore, the overhead associated with solving for the probability distribution on the trapping cluster sometimes makes such simulations less efficient than the standard KMC. Here we report on a general and exact accelerated kinetic Monte Carlo algorithm generally applicable to arbitrary Markov models1. Two different implementations are attempted both based on incremental expansion of trapping sub-set of Markov states: (1) numerical solution of the Master Equation with absorbing states and (2) incremental graph reduction followed by randomization. Of the two implementations, the 2nd one performs better allowing, for the first time, to overcome trapping basins spanning several million Markov states. The new method is used for simulations of anomalous diffusion on a 2D substrate and of the kinetics of diffusive 1st order phase transformations in binary alloys. Depending on temperature and (alloy) super-saturation conditions, speedups of 3 to 7 orders of magnitude are demonstrated, with no compromise of simulation accuracy.

97 MATHEMATICS AND COMPUTING↗

Development and Testing of Pulse Guns for Combustion Instability Testing

To test liquid rocket engines (LREs) for combustion instabilities, devices such as bombs are often used to create pressure wave disturbances. Bombs, while effective, are inherently dangerous, expensive, and difficult to procure. Over the years, pulse guns have been used as a safer and more cost-effective way to generate controlled pressure disturbances in engine chambers. In anticipation of the need for stability testing of prototype LREs at NASA Marshall Space Flight Center (MSFC), a set of pulse guns have been designed, fabricated, tested, and characterized. The pulse gun program is funded by the RS-25 Engine Program managed out of MSFC and funded by NASA’s Space Launch System (SLS) through the MSFC Liquid Engines Office (LEO). A pulse gun is a simple device – like a traditional gun, it has a breech and barrel section. However, unlike a traditional gun, there is no bullet, as the purpose of the pulse gun is strictly to fire a high pressure pulse. Instead of a firing pin and primer that would normally be used in a traditional gun, an initiator is used to activate the gun powder. The initiator is a highly reliable pyrotechnic initiator. For this study, clone versions of the NASA Standard Initiator (NSI) were used. The initiator is used to ignite a pre-measured amount of gun powder loaded into the breech. When the pressure of the burnt gun powder exceeds the set point of a downstream burst disk, the disk ruptures, allowing the high pressure pulse to travel downstream through the barrel section. A ballistic pressure transducer located in the breech section is used to measure the short duration, high pressure pulse. Some configurations of the pulse gun have barrel sections that include one or more additional ballistic pressure transducers. These additional pressure measurements help track the degradation and damping of the pulse as it travels out of the barrel section. The measurements may also be used to determine the velocity of pulse. The objective of this paper is to present the different variants of this newly-developed pulse gun and characterize performance over a range of parameters. The parameters include breech diameter, barrel length, amount of gun powder used, the way the gun powder is packed, and the pressure setting of the burst disk. There are a total of six pulse guns: three with the 0.25 inch breech and three different length barrels, and three with the 0.40 inch breech and three different length barrels. For both breech sizes, the associated barrels are referred to as standard, one-port, and two-port barrels. The standard barrel has no instrumentation and is likely the barrel that will be used for engine stability testing. The one- and two-port barrels were designed specifically for pulse gun component testing to allow measurements of the magnitude and timing of the high pressure pulse as it makes its way through the pulse gun. The burst disks tested were commercially-available burst disks designed to rupture at 8,000, 16,000, and 24,000 psid. Testing was accomplished by firing the pulse gun into a test chamber pressurized with nitrogen at about 2300 psig. A total of four Model 113B23 High frequency ICP® pressure sensors (10k psi) were mounted in the test chamber, in the same plane as the pulse gun. Two of the sensors had “trimmed” adapters, and two did not. Given the symmetrical configuration of the sensors within the test chamber, different amplitudes of pressure measurements are attributed to the use of trimmed versus untrimmed adapters. The untrimmed adapters, with their narrower passages, tended to amplify the pressure amplitudes by as much as 50%. In total, 41 pulse gun tests have been conducted.Data are still being analyzed, but some trends are apparent. For example, measurements taken within the pulse gun are shown in Figures 3 and 4 for Hot-fires (HFs) # 11 and 39, respectively. Both tests were identical in that the 0.40 inch ID breech, two-port barrel, 8,000 psid burst disk, and same amount of gunpowder (6.639 grains for HF# 11, and 6.576 grains for HF# 39) were used, and the back pressure in the nitrogen test chamber was ~2300 psig. Despite keeping all these variables constant, the results from these two tests look quite different. For both tests, the first pressure peak shown in the P2111 trace within the breech is the firing of the initiator. The second peak and any subsequent peaks are from the combustion of the gunpowder. It should be noted that because the sensors are dynamic, the ~2300 psig baseline static pressure is not shown in the figures. For HF# 11, the burst disk clearly ruptured in a little over 0.1 ms from the time the initiator was fired. This is evident from the abrupt rise in pressure for P2112 followed by another abrupt rise in pressure for P2113. The sensors track the movement of the high pressure pulse through the pulse gun. For HF# 39, however, there was nearly 1 ms delay between the initiator firing and the burst disk rupturing. The only difference between these two tests was the way in which the gunpowder was packed within the breech. For HF# 11, the gunpowder was poured directly into the breech, atop the initiator, and held in place with a vegetable fiber wad appropriately sized for the barrel diameter. Once in place, the wad firmly held the gunpowder in place. For HF# 39, the gunpowder was rolled within cigarette paper with the ends of the paper twisted. The rolled gunpowder was gently pushed down into the breech, toward the initiator, and no wad was used. This method of loading the gunpowder consistently produced longer delays in the rupture of the burst disk, presumably because there was a steady, fuller burning of the gunpowder. The burst disk was rated for 8,000 psid, which means that the burst disk should not have opened until the pressure in the breech reached ~10,300 since there was ~2300 psig back pressure in the test chamber. In the case of HF# 11, the breech pressure only reached roughly 4200 psi before there was leakage either through or past the burst disk, but for HF#39, the breech pressure reached 10,600 psi prior to the burst disk opening. The temperature of the burst disk is certainly a factor in determining when the burst disk will rupture. A sharp rise in the burst disk temperature could weaken it and cause it to stray from the designed set point burst pressure. The burst disks are manufactured of Inconel to try to reduce their sensitivity to temperature, but how the burst disks perform above 900°F is not documented. All burst disks were engineered and tested by the manufacturer for ambient temperature conditions. One theory for why rolling the gunpowder in cigarette paper may produce better results is related to a more controlled temperature environment. The cigarette paper may act as a sheath that protects the burst disk from excessive temperatures during the rapid buildup of pressure in the breech. The ultimate benefit of not breeching the burst disk prematurely is shown in Figures 5 and 6, which graphs the resultant pressure pulse produced in the test chamber. For HF #11, the peak pressure on the P2123 trimmed adapter is about 270 psi, while for HF# 39 it is 343 psi, which is about 1.27 times greater in magnitude. In either case, the pressure pulse is ~20 μs in width once it reaches the test chamber. Another pressure rise about 100 μs later can be seen on the sensors located across from the pulse gun port, P2124 and P2121. These pressures are lower due to attenuation of the pressure wave as it moves across the test chamber. After the wave encounters the wall, it reflects back and forth within the chamber until it completely dissipates.

Pulse Gun↗

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗