An image compositing solution at scale
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
High end scientific codes with computational I/O pipelines: improving their end-to-end performance
Proceedings of the 2nd international workshop on Petascal data analytics: challenges and opportunities
In-situ I/O processing: a case for location flexibility
Proceedings of the sixth workshop on Parallel Data Storage
A distributed data-parallel framework for analysis and visualization algorithm development
Proceedings of the 5th Annual Workshop on General Purpose Processing with Graphics Processing Units
Parallel in situ coupling of simulation with a fully featured visualization system
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
Data-parallel mesh connected components labeling and analysis
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
Parallel I/O, analysis, and visualization of a trillion particle simulation
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
In-situ sampling of a large-scale particle simulation for interactive visualization and analysis
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
A model for optimizing file access patterns using spatio-temporal parallelism
UltraVis '13 Proceedings of the 8th International Workshop on Ultrascale Visualization
Transactions on Edutainment IX
VisDSI: Locality Aware I/O Solution for Large Scale Data Visualization
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
Hi-index | 0.00 |
A series of experiments studied how visualization software scales to massive data sets. Although several paradigms exist for processing large data, the experiments focused on pure parallelism, the dominant approach for production software. The experiments used multiple visualization algorithms and ran on multiple architectures. They focused on massive-scale processing (16,000 or more cores and one trillion or more cells) and weak scaling. These experiments employed the largest data set sizes published to date in the visualization literature. The findings on scaling characteristics and bottlenecks will help researchers understand how pure parallelism performs at high levels of concurrency with very large data sets.