An Optimizing Compiler for Automatic Shader Bounding
By Petrik Clarberg, Robert Toth, Jon Hasselgren, Tomas Akenine-Möller
Programmable shading provides artistic control over materials and geometry, but the black box nature of shaders makes some rendering optimizations difficult to apply. In many cases, it is desirable to compute bounds of shaders in order to speed up rendering. A bounding shader can be automatically derived from the original shader by a compiler using interval analysis, but creating optimized interval arithmetic code is non-trivial. A key insight in this paper is that shaders contain metadata that can be automatically extracted by the compiler using data flow analysis. We present a number of domain-specific optimizations that make the generated code faster, while computing the same bounds as before. This enables a wider use and opens up possibilities for more efficient rendering. Our results show that on average 42-44% of the shader instructions can be eliminated for a common use case: single-sided bounding shaders used in lightcuts and importance sampling.
Read the EGSR paper: An Optimizing Compiler for Automatic Shader Bounding [PDF 1.6MB]
Previously published at: Computer Graphics Forum (Proceedings of EGSR 2010), vol. 29(4), pp. 1259-1268, June 2010
An Optimizing Compiler for Automatic Shader Bounding. Petrik Clarberg, Robert Toth, Jon Hasselgren, Tomas Akenine-Möller. In Computer Graphics Forum Eurographics Symposium on Rendering (EGSR 2010). pp. 1259-1268. 2010.