Name
Abstract | ||
|---|---|---|
Complex shading often associates with long shaders and huge data access. To obtain good performance on current generation GPU hardware, it is necessary to design some algorithms to manage data, schedule more efficient threads, and memory access under the hierarchy of GPU memory. In this paper, we propose an approach to accelerate the rendering process for complex shaders by analyzing and sorting shading jobs according to their complexity and potential memory access. We show that by sorting these shading jobs in three levels of memory hierarchies and reorganizing threads block according to the complexity, all shading jobs are scheduled in order, and we can significantly improve cache utilization and GPU hardware utilization, especially for poor performance caused by large branching. All sorting work are processed on CPU with plentiful logic function, and can be processed in a very efficient manner, compared with the expensive compaction operation on GPU. Our experiments with this hierarchy demonstrate improvements against a SIMD packet tracing with compaction on GPU. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s11042-013-1712-5 | Multimedia Tools and Applications |
Keywords | Field | DocType |
Shading,GPU,Ray tracing | Cache,Computer science,Parallel computing,SIMD,Thread (computing),Sorting,Shader,Rendering (computer graphics),Data access,Tracing | Journal |
Volume | Issue | ISSN |
74 | 3 | 1380-7501 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xin Yang | 1 | 200 | 36.16 |
| Duanqing Xu | 2 | 78 | 13.16 |
| Lei Zhao | 3 | 1 | 1.05 |
| Bing Yang | 4 | 44 | 8.37 |