Optimizing multi-image sort-last parallel rendering


Sort-last parallel rendering can be improved by considering the rendering of multiple images at a time. Most parallel rendering algorithms consider the generation of only a single image. This makes sense when performing interactive rendering where the parameters of each rendering are not known until the previous rendering completes. However, in situ visualization often generates multiple images that do not need to be created sequentially. In this paper we present a simple and effective approach to improving parallel image generation throughput by amortizing the load and overhead among multiple image renders. Additionally, we validate our approach by conducting a performance study exploring the achievable speed-ups in a variety of image-based in situ use cases and rendering workloads. On average, our approach shows a 1.5 to 3.7 fold improvement in performance, and in some cases, shows a 10 fold improvement.

DOI: 10.1109/LDAV.2016.7874308

Extracted Key Phrases

9 Figures and Tables

Cite this paper

@article{Larsen2016OptimizingMS, title={Optimizing multi-image sort-last parallel rendering}, author={Matthew Larsen and Kenneth Moreland and Christopher R. Johnson and Hank Childs}, journal={2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)}, year={2016}, pages={37-46} }