Complexity of parallel image rendering strategies for visualization systems
Бесплатный доступ
The paper discusses various strategies of parallel images and video sequences rendering on supercomputers for scientific data visualization. Their computational complexity is analyzed. Estimations of efficiency and scalability of the strategies for various input parameters of the problem are represented. Practical testing of proposed method was charged on a supercomputer BlueGene /P.
Visualisation, supercomputers, parallel image rendering, complexity evaluation
Короткий адрес: https://sciup.org/147159104
IDR: 147159104
Статья научная
