Revisiting parallel rendering for shared memory machines

Authors:
B. Nouanesengsy;J. Ahrens;J. Woodring;H. Shen
Affiliations:
The Ohio State University and Los Alamos National Laboratory;Los Alamos National Laboratory;Los Alamos National Laboratory;The Ohio State University
Venue:
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
Year:
2011

Citing 15
Cited 1

Fast data parallel polygon rendering

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Parallel Visualization Algorithms: Performance and Architectural Implications

Computer
A Sorting Classification of Parallel Rendering

IEEE Computer Graphics and Applications
Dynamic Load Balancing for Parallel Polygon Rendering

IEEE Computer Graphics and Applications
The sort-first rendering architecture for high-performance graphics

I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Hierarchical graphics databases in sort-first

PRS '97 Proceedings of the IEEE symposium on Parallel rendering
The design of a parallel graphics interface

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Hybrid sort-first and sort-last parallel rendering with a cluster of PCs

HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Sort-last parallel rendering for viewing extremely large data sets on tile displays

PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Parallel Volume Rendering Using Binary-Swap Compositing

IEEE Computer Graphics and Applications
Implementation and Evaluation of the Parallel Mesa Library

ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
Massively parallel volume rendering using 2-3 swap image compositing

Proceedings of the 2008 ACM/IEEE conference on Supercomputing
A configurable algorithm for parallel image-compositing applications

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
A decomposition approach for optimizing large-scale parallel image composition on multi-core MPP systems

EG PGV'09 Proceedings of the 9th Eurographics conference on Parallel Graphics and Visualization
MPI-hybrid parallelism for volume rendering on large, multi-core systems

EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization

An image compositing solution at scale

Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Increasing the core count of CPUs to increase computational performance has been a significant trend for the better part of a decade. This has led to an unprecedented availability of large shared memory machines. Programming paradigms and systems are shifting to take advantage of this architectural change, so that intra-node parallelism can be fully utilized. Algorithms designed for parallel execution on distributed systems will also need to be modified to scale in these new shared and hybrid memory systems. In this paper, we reinvestigate parallel rendering algorithms with the goal of finding one that achieves favorable performance in this new environment. We test and analyze various methods, including sort-first, sort-last, and a hybrid scheme, to find an optimal parallel algorithm that maximizes shared memory performance.