Volume rendering with data parallel visualization frameworks for emerging high performance computing architectures
Hendrik A. Schroots,Kwan-Liu Ma +1 more
- 02 Nov 2015
- pp 3
TL;DR: This work implements a ray casting and cell projection volume renderer in Dax using DPP and compares their performance on three different hardware architectures and observes that additional architecture specific modifications are necessary to achieve acceptable performance on some architectures.
read more
Abstract: Future exascale computing is demanding more and more parallelism from current software if peak computation rates are to be realized. However, exploiting this additional parallelism is not trivial. One approach is to identify finer grained parallelism using data parallel primitives (DPP). Visualization frameworks such as Dax and VTK-m are being developed using DPP for this purpose. Our work presents an exploratory study of how volume rendering maps to current and future super computing architectures. We implement a ray casting and cell projection volume renderer in Dax using DPP and compare their performance on three different hardware architectures. Despite the portability provided by these frameworks, we observe that additional architecture specific modifications are necessary to achieve acceptable performance on some architectures.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Performance modeling of in situ rendering
Matthew Larsen,Cyrus Harrison,James Kress,David Pugmire,Jeremy S. Meredith,Hank Childs +5 more
- 13 Nov 2016
TL;DR: This work presents new statistical performance models, based on algorithmic complexity, that accurately predict the run-time cost of a set of representative rendering algorithms, an essential in situ visualization task.
32
External facelist calculation with data-parallel primitives
Brenton Lessley,Roba Binyahib,Robert Maynard,Hank Childs +3 more
- 06 Jun 2016
TL;DR: Overall, it is observed that the hashing-based implementation achieves better runtime performance for the majority of configurations, while also achieving the most-stable performance on highly unstructured data sets.
11
DPP-PMRF: Rethinking Optimization for a Probabilistic Graphical Model Using Data-Parallel Primitives
Brenton Lessley,Talita Perciano,Colleen Heinemann,David Camp,Hank Childs,E. Wes Bethel +5 more
- 01 Oct 2018
TL;DR: In this article, a new parallel algorithm for probabilistic graphical model optimization is presented, which relies on data-parallel primitives (DPPs) which provide portable performance over hardware architecture.
Techniques for data-parallel searching for duplicate elements
Brenton Lessley,Kenneth Moreland,Matthew Larsen,Hank Childs +3 more
- 01 Oct 2017
TL;DR: It is demonstrated that the choice of the Hash-Fight algorithm with the FNV1a hash function has consistently good performance over all configurations.
9
Efficient Point Merging Using Data Parallel Techniques
Abhishek Yenpure,Hank Childs,Kenneth Moreland +2 more
- 01 Jan 2019
TL;DR: A fast, efficient approach that uses data parallel techniques for execution in various shared-memory environments is introduced that incorporates a heuristic for efficiently clustering spatially close points together, which is one reason this method performs well against other methods.
3
References
Display of surfaces from volume data
TL;DR: In this article, a volume-rendering technique for the display of surfaces from sampled scalar functions of 3D spatial dimensions is discussed, which is not necessary to fit geometric primitives to the sampled data; images are formed by directly shading each sample and projecting it onto the picture plane.
A polygonal approximation to direct scalar volume rendering
Peter Shirley,Allan Tuchman +1 more
- 01 Nov 1990
TL;DR: A method is presented that approximates tetrahedral volume cells with hardware renderable transparent triangles that produces results which are visually similar to more exact methods for scalar volume rendering, but is faster and has smaller memory requirements.
515
The design and implementation of an object-oriented toolkit for 3D graphics and visualization
Schroeder,Martin,Lorensen +2 more
- 01 Jan 1992
TL;DR: The Visualization Toolkit (vtk) as mentioned in this paper is a C++ class library for 3D graphics and visualization, which includes object oriented models for graphics, methods for synchronizing system execution; a summary of data representation schemes; the role of C++; issues in portability across PC and Unix systems; and how to automatically wrap the C++class library with interpreted languages such as Java and Tcl.
254
Scan primitives for vector computers
Siddhartha Chatterjee,Guy E. Blelloch,Marco Zagha +2 more
- 01 Oct 1990
TL;DR: The authors describe an optimized implementation of a set of scan primitives on a single processor of a CRAY Y-MP, and demonstrate that their use leads to greatly improved performance for several applications that cannot be vectorized with existing computer technology.
127
A scalable, hybrid scheme for volume rendering massive data sets
Hank Childs,Mark A. Duchaineau,Kwan-Liu Ma +2 more
- 11 May 2006
TL;DR: A parallel, distributed memory algorithm for volume rendering massive data sets and two techniques for calculating the sample points: a 3D rasterization technique and a kernel-based technique, which trade off between speed and generality.