DOE Computer Graphics Forum Los Alamos National Laboratory Site Report
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Harnessing the power of modern multi-GPU architectures, we present a massively parallel simulation system based on the Material Point Method (MPM) for simulating physical behaviors of materials undergoing complex topological changes, self-collision, and large deformations. Our system makes three critical contributions. First, we introduce a new particle data structure that promotes coalesced memory access patterns on the GPU and eliminates the need for complex atomic operations on the memory hierarchy when writing particle data to the grid. Second, we propose a kernel fusion approach using a new Grid-to-Particles-to-Grid (G2P2G) scheme, which efficiently reduces GPU kernel launches, improves latency, and significantly reduces the amount of global memory needed to store particle data. Finally, we introduce optimized algorithmic designs that allow for efficient sparse grids in a shared memory context, enabling us to best utilize modern multi-GPU computational platforms for hybrid Lagrangian-Eulerian computational patterns. We demonstrate the effectiveness of our method with extensive benchmarks, evaluations, and dynamic simulations with elastoplasticity, granular media, and fluid dynamics. In comparisons against an open-source and heavily optimized CPU-based MPM codebase [Fang et al. 2019] on an elastic sphere colliding scene with particle counts ranging from 5 to 40 million, our GPU MPM achieves over 100x per-time-step speedup on a workstation with an Intel 8086K CPU and a single Quadro P6000 GPU, exposing exciting possibilities for future MPM simulations in computer graphics and computational science. Moreover, compared to the state-of-the-art GPU MPM method [Hu et al. 2019a], we not only achieve 2x acceleration on a single GPU but our kernel fusion strategy and Array-of-Structs-of-Array (AoSoA) data structure design also generalizes to multi-GPU systems. Our multi-GPU MPM exhibits near-perfect weak and strong scaling with 4 GPUs, enabling performant and large-scale simulations on a 10243 grid with close to 100 million particles with less than 4 minutes per frame on a single 4-GPU workstation and 134 million particles with less than 1 minute per frame on an 8-GPU workstation.
Ray tracing is a process used commonly in computer graphics and in physics to track light photons and particles, respectively. Much research was found on improving execution times for the computer graphics applications; however, in the short time frame of this literary review, almost no research was found on improving the execution times for the physics applications that were relevant to this problem. Two ray trace algorithms, a STL raytrace and a conebeam raytrace, were optimized using OpenMP and CUDA.
The inversion of the Laplace-Beltrami operator and the computation of the Hodge decomposition of a tangential vector field on smooth surfaces arise as computational tasks in many areas of science, from computer graphics to machine learning to computational physics. In this work, we present a high-order accurate pseudo-spectral approach, applicable to closed surfaces of genus one in three-dimensional space, with a view toward applications in plasma physics and fluid dynamics.
Fractal image coding (FIC) based on the inverse problem of an iterated function system plays an essential role in several areas of computer graphics and in many other interesting applications. Through FIC, an image can be transformed to compressed representative parameters and be expressed in a simple geometric way. Dealing with digital images requires storing a large number of images in databases, where searching such databases is time consuming. Therefore, finding a new technique that facilitates this task is a challenge that has received increasing attention from many researchers. In this study, a new method that combines fractal dimension (FD) which is an indicator of image complexity with the FIC scheme is proposed. Classifying images in databases according to their texture by using FD helps reduce the retrieval time of query images. The validity of the proposed method is evaluated using geosciences images. Result shows that the method is computationally attractive.
The initial free expansion of the embryo within a seed is at some point inhibited by its contact with the testa, resulting in its formation of folds and borders. Although less obvious, mechanical forces appear to trigger and accelerate seed maturation. However, the mechanistic basis for this effect remains unclear. Manipulation of the mechanical constraints affecting either the in vivo or in vitro growth of oilseed rape embryos was combined with analytical approaches, including magnetic resonance imaging and computer graphic reconstruction, immunolabelling, flow cytometry, transcriptomic, proteomic, lipidomic and metabolomic profiling. Our data implied that, in vivo, the imposition of mechanical restraints impeded the expansion of testa and endosperm, resulting in the embryo's deformation. An acceleration in embryonic development was implied by the cessation of cell proliferation and the stimulation of lipid and protein storage, characteristic of embryo maturation. The underlying molecular signature included elements of cell cycle control, reactive oxygen species metabolism and transcriptional reprogramming, along with allosteric control of glycolytic flux. Constricting the space allowed for the expansion of in vitro grown embryos induced a similar response. The conclusion is that the imposition of mechanical constraints over the growth of the developing oilseed rape embryo provides an important trigger for its maturation.
In the age of data science, the use of interactive information visualization techniques has become increasingly ubiquitous. From online scientific journals to the New York Times graphics desk, the utility of interactive visualization for both storytelling and analysis has become ever more apparent. As these techniques have become more readily accessible, the appeal of combining interactive visualization with computational analysis continues to grow. Arising out of a need for scalable, human-driven analysis, primary objective of visual analytics systems is to capitalize on the complementary strengths of human and machine analysis, using interactive visualization as a medium for communication between the two. These systems leverage developments from the fields of information visualization, computer graphics, machine learning, and human-computer interaction to support insight generation in areas where purely computational analyses fall short. Over the past decade, visual analytics systems have generated remarkable advances in many historically challenging analytical contexts. These include areas such as modeling political systems [Crouser et al. 2012], detecting financial fraud [Chang et al. 2008], and cybersecurity [Harrison et al. 2012]. In each of these contexts, domain expertise and human intuition is a necessary component of the analysis. This intuition is essential to building trust in the analytical products, as well as supporting the translation of evidence into actionable insight. In addition, each of these examples also highlights the need for scalable analysis. In each case, it is infeasible for a human analyst to manually assess the raw information unaided, and the communication overhead to divide the task between a large number of analysts makes simple parallelism intractable. Regardless of the domain, visual analytics tools strive to optimize the allocation of human analytical resources, and to streamline the sensemaking process on data that is massive, complex, incomplete, and uncertain in scenarios requiring human judgment.
Purpose: Neurovascular interventional procedures using biplane fluoroscopic imaging systems can lead to increased risk of radiation-induced skin injuries. The authors developed a biplane dose tracking system (Biplane-DTS) to calculate the cumulative skin dose distribution from the frontal and lateral x-ray tubes and display it in real-time as a color-coded map on a 3D graphic of the patient for immediate feedback to the physician. The agreement of the calculated values with the dose measured on phantoms was evaluated. Methods: The Biplane-DTS consists of multiple components including 3D graphic models of the imaging system and patient, an interactive graphical user interface, a data acquisition module to collect geometry and exposure parameters, the computer graphics processing unit, and functions for determining which parts of the patient graphic skin surface are within the beam and for calculating dose. The dose is calculated to individual points on the patient graphic using premeasured calibration files of entrance skin dose per mAs including backscatter; corrections are applied for field area, distance from the focal spot and patient table and pad attenuation when appropriate. The agreement of the calculated patient skin dose and its spatial distribution with measured values was evaluated in 2D and 3D for simulated procedure conditions using a PMMA block phantom and an SK-150 head phantom, respectively. Dose values calculated by the Biplane-DTS were compared to the measurements made on the phantom surface with radiochromic film and a calibrated ionization chamber, which was also used to calibrate the DTS. The agreement with measurements was specifically evaluated with variation in kVp, gantry angle, and field size. Results: The dose tracking system that was developed is able to acquire data from the two x-ray gantries on a biplane imaging system and calculate the skin dose for each exposure pulse to those vertices of a patient graphic that are determined to be in the beam. The calculations are done in real-time with a typical graphic update time of 30 ms and an average vertex separation of 3 mm. With appropriate corrections applied, the Biplane-DTS was able to determine the entrance dose within 6% and the spatial distribution of the dose within 4% compared to the measurements with the ionization chamber and film for the SK150 head phantom. The cumulative dose for overlapping fields from both gantries showed similar agreement. Conclusions: The Biplane-DTS can provide a good estimate of the peak skin dose and cumulative skin dose distribution during biplane neurointerventional procedures. Real-time display of this information should help the physician manage patient dose to reduce the risk of radiation-induced skin injuries.
Disruptive robotic construction technologies such as additive deposition of cementitious materials like concrete (or "3D concrete printing") require the synchronous operation of multiple pieces of equipment in the production setup. In such an environment, it is crucial to simulate the robotic motions (for toolpath clashes) and the cementitious material behavior (for toolpath failures) to ensure fail-proof constructability of the envisioned building geometry. However, toolpath clash detection requires 4D simulations of the production setup, which are computationally graphics intensive, whereas toolpath failure detection requires actual 3D printing of test parts from the geometry to identify areas prone to failure while 3D printing, which is physically tedious. Both these processes, being computationally and physically intensive, have largely curtailed designers from simulating and exploring large sets of design options with varying geometries and toolpath configurations. To overcome this and allow designers to explore large sets of design possibilities, this paper proposes two novel computational metamodels capable of performing robotic toolpath clash detection and failure detection with significantly reduced times than the earlier approaches. The developed metamodels were used to rapidly simulate large sets of building design options for robotic constructability in the NASA 3D-Printed Mars Habitat Challenge.
Recent reliability issues with one of the fastest supercomputers in the world, Titan at Oak Ridge National Laboratory (ORNL), demonstrated the need for resilience in large-scale heterogeneous computing. OpenMP currently does not address error and failure behavior. This paper takes a first step toward resilience for heterogeneous systems by providing the concepts for resilient OpenMP offload to devices. Using real-world error and failure observations, the paper describes the concepts and terminology for resilient OpenMP target offload, including error and failure classes and resilience strategies. It details the experienced general-purpose computing graphics processing unit (GPGPU) errors and failures in Titan. It further proposes improvements in OpenMP, including a preliminary prototype design, to support resilient offload to devices for efficient handling of errors and failures in heterogeneous high-performance computing (HPC) systems.
Today, multiGPU nodes are widely used in high-performance computing and data centers. However, current programming models do not provide simple, transparent, and portable support for automatically targeting multiple GPUs within a node on application areas of array programming. In this paper, we describe a new application programming interface based on the Kokkos programming model to enable array computation on multiple GPUs in a transparent and portable way across both NVIDIA and AMD GPUs. We implement different variations of this technique to accommodate the exchange of stencils (array boundaries) among different GPU memory spaces, and we provide autotuning to select the proper number of GPUs, depending on the computational cost of the operations to be computed on arrays, that is completely transparent to the programmer. We evaluate our multiGPU extension on Summit (#5 TOP500), with six NVIDIA V100 Volta GPUs per node, and Crusher that contains identical hardware/software as Frontier (#1 TOP500), with four AMD MI250X GPUs, each with 2 Graphics Compute Dies (GCDs)for a total of 8 GCDs per node. We also compare the performance of this solution against the use of MPI + Kokkos, which is the cur-rent de facto solution for multiple GPUs in Kokkos. Our evaluation shows that the new Kokkos solution provides good scalability for many GPUs and a faster and simpler solution (from a programming productivity perspective) than MPI + Kokkos.
We examine large-eddy-simulation modeling approaches and computational performance of two open-source computational fluid dynamics codes for the simulation of atmospheric boundary layer flows that are of direct relevance to wind energy production. The first code, NekRS, is a high-order, unstructured-grid, spectral element code. The second code, AMR-Wind, is a second-order, block-structured, finite-volume code with adaptive mesh refinement capabilities. The objective of this study is to co-develop these codes in order to improve model fidelity and performance for each. These features will be critical for running ABL-based applications such as wind farm analysis on advanced computing architectures. To this end, we investigate the performance of NekRS and AMR-Wind on the Oak Ridge Leadership Facility supercomputers Summit, using 4 to 800 nodes (24 to 4,800 NVIDIA V100 GPUs), and Crusher, the testbed for the Frontier exascale system, using 18 to 384 Graphics Compute Dies on AMD MI250X GPUs. We compare strong- and weak-scaling capabilities, linear solver performance, and time to solution. We also identify leading inhibitors to parallel scaling.
Last year, we refactored the major components of the SpotSDC visualization platform and added a visualization component for fault tolerance boundary. Also, we designed a new analysis framework to understand an application resiliency with a significantly less amount of samples compared to previous approaches. We evaluated the visualization platform and analysis framework for multiple critical HPC computation kernels and collected evidence for the effectiveness of the method developed. We published the findings of our research in the IEEE Transactions on Visualization and Computer Graphics (TVCG), the top journal in visualization. Moreover, we submitted a new paper, "Understanding a Program's Resiliency Through Error Propagation," to the PPOPP 2021 conference.
Here, we propose a new unfitted/immersed computational framework for nonlinear solid mechanics, which bypasses the complexities associated with the generation of CAD representations and subsequent body-fitted meshing. This approach allows to speed up the cycle of design and analysis in complex geometry and requires relatively simple computer graphics representations of the surface geometries to be simulated, such as the Standard Tessellation Language (STL format). Complex data structures and integration on cut elements are avoided by means of an approximate boundary representation and a modification (shifting) of the boundary conditions to maintain optimal accuracy. An extensive set of computational experiments in two and three dimensions is included.
We propose a conservative Galerkin scheme for the quasilinear model in three-dimensional momentum space and three-dimensional spectral space, with cylindrical symmetry. We construct an unconditionally conservative weak form and use a discretization that preserves conservation properties independent of the wave emission probability. The discrete operators, combined with a consistent quadrature rule, preserve all the conservation laws rigorously. The proposed scheme is quite general: it works for both relativistic and non-relativistic systems, for both magnetized and unmagnetized plasmas, and even for problems with time-dependent dispersion relations. We represent the particle distribution by continuous basis functions and use discontinuous basis functions for the wave spectral energy density, which enables the application of a positivity-preserving technique. We adopt the marching simplex algorithm, designed initially for computer graphics, for numerical integration on the resonance manifold. Furthermore, the numerical examples with a bump-on-tail initial configuration show how the unstable waves produce strong momentum space diffusion.
In the rapidly evolving landscape of scientific computing, Graphics Processing Units (GPUs) have become indispensable for their unparalleled ability to handle parallel tasks in complex calculations, simulations, and data analysis. Their utility is further magnified in machine learning and AI applications, where they significantly accelerate model training and predictive analytics. Within this context, the Triton Inference Server emerges as a pivotal open-source tool, specializing in AI inferencing and optimizing GPU utilization across various platforms and frameworks. This paper presents an in-depth study on distributed High Throughput Computing (HTC), specifically focusing on the HTCondor framework and its resource provisioning tools, GlideinWMS and HEPCloud. These systems enable large-scale scientific experiments like CMS and DUNE to efficiently access and utilize vast computational resources. The paper explores the core architectural components of GlideinWMS, including jobs, user pools, and worker nodes, and discusses their integration with GPUs and the Triton server. The primary aim of this research is to develop a solution that optimizes GPU utilization by leveraging Glideins and containers. This approach allows computational jobs, particularly those involving AI models, to use GPUs only when essential, thereby facilitating efficient sharing of limited GPU resources. To validate this architecture, the study conducted three key tests involving custom scripts, container-based servers, and Triton server deployments. However, the study faces challenges, notably in locating the Triton server and ensuring secure remote access. To address these issues, future work will focus on developing a proxy mechanism and enhancing security protocols. In conclusion, this study offers a comprehensive roadmap for effective and efficient GPU utilization in distributed High Throughput Computing. It aims to contribute significantly to the scientific community by solving pressing problems and implementing robust solutions in collaboration with the GlideinWMS and HEPCloud teams. The research sets the stage for a more efficient, scalable, and cost-effective paradigm in scientific computing.
The purpose of this project was to jointly develop and test a software plug-in that would convert native Pro /ENGINEER digital engineering drawings to Computer Graphics Metafile (CGM) format. If it was not feasible to convert the Pro/ENGINEER files, we planned to develop and test a similar conversion of native AutoCAD engineering drawings to CGM. CGM viewer plug-ins were developed as needed. There were four main tasks in this project: 1. Requirements for CGM Plug-in 2. Product Evaluation 3. Product Development Feasibility Study 4. Developing a "Plug-In" Application.
This work bridges the gap between multi-GPU computing and high-productivity, performance-portable programming solutions. Our goal is to enhance scientific applications with a productive and portable solution—program once, deploy everywhere—for multi-GPU programming with no cost to programmability. To accomplish this, we implemented JACC.Multi, which is part of the Julia for ACCelerators (JACC) performance-portable framework. JACC. Multi is the only high-level, portable metaprogramming solution that targets multi-GPU environments and is integrated in a readily accessible programming language (e.g., Julia language). With transparent GPU-to-GPU communication, JACC. Multi is optimized for scientific application workloads and is portable for NVIDIA and AMD accelerators. For the evaluation, we use two modern multi-GPU systems: Hudson, which features two NVIDIA H100 Hopper GPUs per node, and Frontier, which features four AMD MI250X GPUs per node, each with two Graphics Compute Dies (GCDs) for a total of eight GCDs per node. Additionally, as part of the evaluation, we use JACC (one GPU), MPI+JACC, and JACC. Multi codes that implement well-known and widely used scientific algorithms/kernels such as the conjugate gradient algorithm and an explicit forward Euler solver that requires GPU-to-GPU communication. Overall, JACC. Multi codes achieve better performance than MPI+JACC codes and significant speedups over JACC (one GPU), with up to 1.9× on Hudson and 6× on Frontier.