Stack-based parallel recursion on graphics processors

ACM SIGPLAN Notices

Volumn 44, Issue 4, 2009, Pages 299-300

  Yang, Ke ^a   He, Bingsheng ^b   Luo, Qiong ^b   Sander, Pedro V ^b   Shi, Jiaoying ^a  

^a ZHEJIANG UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Graphics processors; Parallel recursion; Stack

Indexed keywords

COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; EFFICIENCY; FORESTRY; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; RECURSIVE FUNCTIONS;

GENERAL-PURPOSE COMPUTATIONS; GRAPHICS PROCESSOR; PARALLEL IMPLEMENTATIONS; PERFORMANCE TRADE-OFF; RECURSIONS; RECURSIVE ALGORITHMS; STACK; STACK IMPLEMENTATION;

GRAPHICS PROCESSING UNIT;

EID: 70350600765     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1594835.1504224     Document Type: Article

References (6)

1. CUDA, http://developer.nvidia.com/object/cuda.html.
2. A. Guttman, R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD, pp. 47-54. 1984.
3. S. Popov, J. Günther, S. Hans-Peter et al, Stackless KD-Tree Traversal for High Performance GPU Ray Tracing In: Computer Graphics Forum 26(3), pp. 415-424, 2007.
4. L. Prechelt, S. U. Hänßgen, Efficient Parallel Execution of Irregular Recursive Programs, IEEE Transactions on Parallel Distributed Systems 2002, 13(2):167-178.
5. B. He, K. Yang, R. Fang et al, Relational Joins on Graphics Processors, SIGMOD 2008.
6. K. Zhou, Q. Hou, R. Wang, B. Guo, Real-Time KD-Tree Construction on Graphics Hardware, SIGGRAPH Asia 2008.