Zippy: A framework for computation and visualization on a GPU cluster

被引:27
作者
Fan, Zhe [1 ]
Qiu, Feng [1 ]
Kaufman, Arie E. [1 ]
机构
[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA
关键词
D O I
10.1111/j.1467-8659.2008.01131.x
中图分类号
TP31 [计算机软件];
学科分类号
081202 [计算机软件与理论]; 0835 [软件工程];
摘要
Due to its high performance/cost ratio, a GPU cluster is an attractive platform for large scale general-purpose computation and visualization applications. However, the programming model for high performance general-purpose computation on GPU clusters remains a complex problem. In this paper, we introduce the Zippy frame-work, a general and scalable solution to this problem. It abstracts the GPU cluster programming with a two-level parallelism hierarchy and a non-uniform memory access (NUMA) model. Zippy preserves the advantages of both message passing and shared-memory models. It employs global arrays (GA) to simplify the communication, synchronization, and collaboration among multiple GPUs. Moreover, it exposes data locality to the programmer for optimal performance and scalability. We present three example applications developed with Zippy: sort-last volume rendering, Marching Cubes isosurface extraction and rendering, and lattice Boltzmann flow simulation with online visualization. They demonstrate that Zippy can ease the development and integration of parallel visualization, graphics, and computation modules on a GPU cluster.
引用
收藏
页码:341 / 350
页数:10
相关论文
共 31 条
[1]
[Anonymous], OPENGL GEOMETRY SHAD
[2]
Bachthaler S., 2006, EG PGV 2006. 6th Eurographics Symposium on Parallel Graphics and Visualization, P75
[3]
Bhaniramka P, 2005, IEEE VISUALIZATION 2005, PROCEEDINGS, P119
[4]
Brook for GPUs: Stream computing on graphics hardware [J].
Buck, I ;
Foley, T ;
Horn, D ;
Sugerman, J ;
Fatahalian, K ;
Houston, M ;
Hanrahan, P .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :777-786
[5]
DINGLIANA J, 2006, ACM SIGGRAPH SKET, P182
[6]
DYKEN C, HISTOPYRAMIDS ISO SU
[7]
FAN Z, 2006, ACM IEEE SUP C, P4
[8]
FATAHALIAN K, 2007, ACM IEEE SUP C, P4
[9]
EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHING IN GRAPHS. [J].
Galil, Zvi .
Computing surveys, 1986, 18 (01) :23-38
[10]
Exploring weak scalability for FEM calculations on a GPU-enhanced cluster [J].
Goeddeke, Dominik ;
Strzodka, Robert ;
Mohd-Yusof, Jamaludin ;
McCormick, Patrick ;
Buijssen, Sven H. M. ;
Grajewski, Matthias ;
Turek, Stefan .
PARALLEL COMPUTING, 2007, 33 (10-11) :685-699