GPU parallel computing: Programming language, debugging tools and data structures

Abstract

With many cores driven by high memory bandwidth, today’s graphics processing unit (GPU) has involved into an absolute computing workhorse. More and more scientists, researchers and software developers are using GPUs to accelerate their algorithms and applications. Developing complex programs and software on the GPU, however, is still far from easy with existing tools provided by hardware vendors. This article introduces our recent research efforts to make GPU software development much easier. Specifically, we designed BSGP, a high-level programming language for generalpurpose computation on the GPU. A BSGP program looks much the same as a sequential C program, and is thus easy to read, write and maintain. Its performance on the GPU is guaranteed by a well-designed compiler that converts the program to native GPU code. We also developed an effective debugging system for BSGP programs based on the GPU interrupt, a unique feature of BSGP that allows calling CPU functions from inside GPU code. Moreover, using BSGP, we developed GPU algorithms for constructing several widely-used spatial hierarchies for high-performance graphics applications.

Keywords

graphics processing unit (GPU) / parallel computing / programming languages / debugging tools / data structures

References

[1] Hou Q, Zhou K, Guo B. BSGP: Bulk-synchronous GPU programming. ACM Transactions on Graphics, 2008, 27(3): Article 19, 1-13

[2] Hou Q, ZhouK, GuoB. Debugging GPU stream programs through automatic dataflow recording and visualization. ACM Transactions on Graphics, 2009, 28(5): Article 153, 1-11

[3] Zhou K, HouQ, WangR, GuoB. Real-time kd-tree construc-Kuntion on graphics hardware. ACM Transactions on Graphics, 2008, 27(5): Article 126, 1-11

[4] HouQ, SunX, ZhouK, LauterbachC, ManochaD. Memoryscalable GPU spatial hierarchy construction. IEEE Transactions on Visualization and Computer Graphics, 2011, 17(4): 466-474

[5] ZhouK, GongM, HuangX, GuoB. Data-parallel octrees for surface reconstruction. IEEE Transactions on Visualization and Computer Graphics, 2011, 17(5): 669-681

[6] BuckI, FoleyT, HornD R, SugermanJ, FatahalianK, HoustonM, HanrahanP. Brook for GPUs: Stream computing on graphics hardware. ACM Transactions on Graphics, 2004, 23(3): 777-786

[7] ValiantL G. A bridging model for parallel computation. Communications of the ACM, 1990, 33(8): 103-111

[8] ZhouK, HouQ, RenZ, GongM, SunX, GuoB. RenderAnts: Interactive Reyes rendering on GPUs. ACM Transactions on Graphics, 2009, 28(5): Article 155, 1-11

[9] ShevtsovM, SoupikovA, KapustinA. Highly parallel fast KD-tree construction for interactive ray tracing of dynamic scenes. Computer Graphics Forum, 2007, 26(3): 395-404

[10] KazhdanM, BolithoM, HoppeH. Poisson surface reconstruction. In: Proceedings of the Fourth ACM/Eurographics Symposium on Geometry Processing. 2006, 61-70

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg