1627

Efficient partitioning of fragment shaders for multipass rendering on programmable graphics hardware

Eric Chan, Ren Ng, Pradeep Sen, Kekoa Proudfoot, Pat Hanrahan
Stanford University
In HWWS ’02: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2002), pp. 69-78

@conference{chan2002efficient,

   title={Efficient partitioning of fragment shaders for multipass rendering on programmable graphics hardware},

   author={Chan, E. and Ng, R. and Sen, P. and Proudfoot, K. and Hanrahan, P.},

   booktitle={Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware},

   pages={78},

   isbn={1581135807},

   year={2002},

   organization={Eurographics Association}

}

Download Download (PDF)   View View   Source Source   

582

views

Real-time programmable graphics hardware has resource constraints that prevent complex shaders from rendering in a single pass. One way to virtualize these resources is to partition shading computations into multiple passes, each of which satisfies the given constraints. Many such partitions exist for a shader, but it is important to find one that renders efficiently. We present Recursive Dominator Split (RDS), a polynomial-time algorithm that uses a cost model to find near-optimal partitions of arbitrarily complex shaders. Using a simulator, we analyze partitions for architectures with different resource constraints and show that RDS performs well on different graphics architectures. We also demonstrate that shader partitions computed by RDS can run efficiently on programmable graphics hardware available today.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: