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
Design and implementation of a large-scale hybrid distributed graphics system
EGPGV '02 Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization
An improvement on binary-swap compositing for sort-last parallel rendering
Proceedings of the 2003 ACM symposium on Applied computing
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
A Practical Guide to Large Tiled Displays
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
Revisiting parallel rendering for shared memory machines
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
| Hi-index | 0.00 |
This paper describes the implementation and performance evaluation of a 3D graphics library that can be readily linked with parallel applications to provide run-time visualization on large-scale message-passing parallel machines, such as Intel Paragon. The prototype implementation is currently fully operational, and is based on a public-domain OpenGL implementation Mesa, and a sort-last parallelization strategy. Through a detailed performance analysis, we show that the scalability of the current prototype is close to the theoretical limit for the given hardware architecture. We also developed a unified framework to describe parallel compositing algorithms and show that two popular parallel compositing algorithms, binary swapping and parallel pipeline compositing, are just two extreme instances of this framework. Such a framework is important because it allows users to tailor the compositing algorithm according to the computation/communication characteristics of specific parallel machines by tuning the parameters appropriately. The current parallel Mesa library prototype implements such a parameterizable family of compositing algorithms.