Publications

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Solving large number of small linear systems is increasingly becoming a bottleneck in computational science applications. While dense linear solvers for such systems have been studied before, batched sparse linear solvers are just starting to emerge. In this paper, we discuss algorithms for solving batched sparse linear systems and their implementation in the Kokkos Kernels library. The new algorithms are performance portable and map well to the hierarchical parallelism available in modern accelerator architectures. The sparse matrix vector product (SPMV) kernel is the main performance bottleneck of the Krylov solvers we implement in this work. The implementation of the batched SPMV and its performance are therefore discussed thoroughly in this paper. The implemented kernels are tested on different Central Processing Unit (CPU) and Graphic Processing Unit (GPU) architectures. We also develop batched Conjugate Gradient (CG) and batched Generalized Minimum Residual (GMRES) solvers using the batched SPMV. Our proposed solver was able to solve 20,000 sparse linear systems on V100 GPUs with a mean speedup of 76x and 924x compared to using a parallel sparse solver with a block diagonal system with all the small linear systems, and compared to solving the small systems one at a time, respectively. We see mean speedup of 0.51 compared to dense batched solver of cuSOLVER on V100, while using lot less memory. Thorough performance evaluation on three different architectures and analysis of the performance are presented.

Diesel piston-bowl shape is a key design parameter that affects spray-wall interactions and turbulent flow development, and in turn affects the engine’s thermal efficiency and emissions. It is hypothesized that thermal efficiency can be improved by enhancing squish-region vortices as they are hypothesized to promote fuel-air mixing, leading to faster heat-release rates. However, the strength and longevity of these vortices decrease with advanced injection timings for typical stepped-lip (SL) piston geometries. Dimple stepped-lip (DSL) pistons enhance vortex formation at early injection timings. Previous engine experiments with such a bowl show 1.4% thermal efficiency gains over an SL piston. However, soot was increased dramatically [SAE 2022-01-0400]. In a previous study, a new DSL bowl was designed using non-combusting computational fluid dynamic simulations. This improved DSL bowl is predicted to promote stronger, more rotationally energetic vortices than the baseline DSL piston: it employs shallower, narrower, and steeper-curved dimples that are placed further out into the squish region. In the current experimental study, this improved bowl is tested in a medium-duty diesel engine and compared against the SL piston over an injection timing sweep at low-load and part-load operating conditions. No substantial thermal efficiency gains are achieved at the early injection timing with the improved DSL design, but soot emissions are lowered by 45% relative to the production SL piston, likely due to improved air utilization and soot oxidation. However, these benefits are lost at late injection timings, where the DSL piston renders a lower thermal efficiency than that of the SL piston. Energy balance analyses show higher wall heat transfer with the DSL piston than with the SL piston despite a 1.3% reduction in the piston surface area. Vortex enhancement may not necessarily lead to improved efficiency as more energetic squish-region vortices can lead to higher convective heat transfer losses.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Sandia National Laboratories (SNL) has developed a novel reduced order modeling approach. Prioritization of inputs is accomplished using Sobo' indices obtained through a more efficient variance-based global sensitivity analysis. To determine the Sobo' functions, simulated input values are aligned to collocation points to permit the use of Gauss-Lobatto integration, thereby reducing the number of simulation trials needed by more than an order of magnitude compared to standard Monte Carlo approaches. Furthermore, by leveraging the orthogonality of Legendre polynomials in conjunction with those same simulations at the collocation nodes, an efficient fitting method is developed to represent the Sobo' functions from which a reduced order model (ROM) is constructed. The developed method is both more efficient computationally, and the resulting ROM is more accurate. The efficacy of this technique is demonstrated on a nonlinear polynomial test function as well as the nonlinear Ishigami and Sobo' g functions.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Protecting against multi-step attacks of uncertain start times and duration forces the defenders into indefinite, always ongoing, resource-intensive response. To allocate resources effectively, the defender must analyze and respond to an uncertain stream of potentially undetected multiple multi-step attacks and take measures of attack and response intensity over time into account. Such response requires estimation of overall attack success metrics and evaluating effect of defender strategies and actions associated with specific attack steps on overall attack metrics. We present a novel game-theoretic approach GPLADD to attack metrics estimation and demonstrate it on attack data derived from MITRE's ATT&CK Framework and other sources. In GPLADD, the time to complete attack steps is explicit; the attack dynamics emerges from attack graph and attacker-defender capabilities and strategies and therefore reflects 'physics' of attacks. The time the attacker takes to complete an attack step is drawn from a probability distribution determined by attacker and defender strategies and capabilities. This makes time a physical constraint on attack success parameters and enables comparing different defender resource allocation strategies across different attacks. We solve for attack success metrics by approximating attacker-defender games as discrete-time Markov chains and show evaluation of return on detection investments associated with different attack steps. We apply GPLADD to MITRE's APT3 data from ATT&CK Framework and show that there are substantial and un-intuitive differences in estimated real-world vendor performance against a simplified APT3 attack. We focus on metrics that reflect attack difficulty versus attacker ability to remain hidden in the system after gaining control. This enables practical defender optimization and resource allocation against multi-step attacks.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

The purpose of this protocol is to define procedures and practices to be used by the PACT center for field testing of metal halide perovskite (MHP) photovoltaic (PV) modules. The protocol defines the physical, electrical, and analytical configuration of the tests and applies equally to mounting systems at a fixed orientation or sun tracking systems. While standards exist for outdoor testing of conventional PV modules, these do not anticipate the unique electrical behavior of perovskite cells. Further, the existing standards are oriented toward mature, relatively stable products with lifetimes that can be measured on the scale of years to decades. The state of the art for MHP modules is still immature with considerable sample to sample variation among nominally identical modules. Version 0.0 of this protocol does not define a minimum test duration, although the intent is for modules to be fielded for periods ranging for weeks to months. This protocol draws from relevant parts of existing standards, and where necessary includes modifications specific to the behavior of perovskites.