Search NASA⌕ Search

Engineering topics

Thompson, Nick

Publications and source records attributed to Thompson, Nick.

VTK-m v. 2.0

VTK-m is a toolkit of scientific visualization algorithms for emerging processor architectures. VTK-m supports the fine-grained concurrency for data analysis and visualization algorithms required to drive extreme scale computing by providing abstract models for data and execution that can be applied to a variety of algorithms across many different processor architectures.

Moreland, Kenneth [Oak Ridge National Lab. (ORNL),↗

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↗

Validation of Jezebel Reactivity Coefficients and Sensitivity Analysis

Nuclear data validation is often performed today using criticality measurements. The gold standard for criticality measurements is the International Criticality Safety Benchmark Experiment Project (ICSBEP). The validation specifically focuses on the effective multiplication factor ($k_{eff}$). $K_{eff}$ is a relatively easy parameter to infer and has reduced uncertainty due to being at or above critical. However, while $k_{eff}$ is the most documented parameter and its uncertainties and sensitivities have been evaluated in great detail, it cannot be used as a standalone metric to determine inaccuracies in nuclear data (e.g., cross section data, PFNS, nu), which is based on theory, physics, and differential measurements. The Experiments Underpinned by Computational Learning for Improvements in nuclear Data (EUCLID) project aims to identify compensating errors in specific isotope nuclear data by optimally designing experiments that are, or are not sensitive to a suite of measurement parameters beyond $k_{eff}$. By identifying parameters that are sensitive to each other, oppositely sensitive, or have substantial magnitude differences in sensitivity, experiments can be designed to constrain questionable nuclear data. One sensitivity that is of particular interest to this project includes the sensitivity of reactivity coefficients. Reactivity coefficients compare reactivity, which is related to $k_{eff}$ at two different states therefore being sensitive to small changes in the system. The most common type of reactivity coefficient measurements is comparison to void for a small sample within the assembly. It is key that the sample sizes are small enough to not affect the flux of the full system. Reactivity coefficients were evaluated for many early experiments to better understand transport corrected cross sections. In fact, ICSBEP includes reactivity coefficient results as “Supplemental Measurements” in appendices for a handful of older benchmarks. One of those benchmarks is Jezebel, the bare Pu critical assembly. This paper compares new simulations of reactivity coefficients for Jezebel, and explores the sensitivity of reactivity coefficients to small changes in nuclear data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs

Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.

Chen, Jieyang↗

Understanding Performance-Quality Trade-offs in Scientific Visualization Workflows with Lossy Compression

The cost of I/O is a significant challenge on current supercomputers, and the trend is likely to continue into the foreseeable future. This challenge is amplified in scientific visualization because of the requirement to consume large amounts of data before processing can begin. Lossy compression has become an important technique in reducing the cost of performing I/O. In this paper we consider the implications of using compressed data for visualization within a scientific workflow. We use visualization operations on simulation data that is reduced using three different state-of-the-art compression techniques. We study the storage efficiency and preservation of visualization features on the resulting compressed data, and draw comparisons between the three techniques used. Our contributions can help inform both scientists and researchers in the use and design of compression techniques for preservation of important visualization details.

Chen, Jieyang↗

A Co-Design Study Of Fusion Whole Device Modeling Using Code Coupling

Complex workflows consisting of multiple simulation and analysis codes running concurrently through in-memory coupling is becoming popular due to inherent advantages in online management of large-scale data, resilience, and the code development process. However, orchestrating such a multi-application workflow to efficiently utilize resources on a heterogeneous architecture is challenging. In this paper, we present our results with running the Fusion Whole Device Modeling benchmark workflow on Summit, a pre-exascale supercomputer at Oak Ridge National Laboratory. We explore various resource distribution and process placement mechanisms, including sharing compute nodes between processes from separate applications. We show that fine-grained process placement can have a significant impact towards efficient utilization of the compute power of a node on Summit, and conclude that sophisticated tools for performing co-design studies of multi-application workflows can play an important role towards efficient orchestration of such workflows.

Choi, Jong Youl↗