The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2012 vol.18)
pp: 47-57
Ingo Wald , Intel Labs, Intel Corp, Santa Clara
ABSTRACT
We investigate how to efficiently build bounding volume hierarchies (BVHs) with surface area heuristic (SAH) on the Intel Many Integrated Core (MIC) Architecture. To achieve maximum performance, we use four key concepts: progressive 10-bit quantization to reduce cache footprint with negligible loss in BVH quality; an AoSoA data layout that allows efficient streaming and SIMD processing; high-performance SIMD kernels for binning and partitioning; and a parallelization framework with several build-specific optimizations. The resulting system is more than an order of magnitude faster than today's high-end GPU builders for comparable BVHs; it is usually faster even than spatial median builders; it can build SAH BVHs almost as fast as existing GPUs and CPUs- and CPU-based approaches can build regular grids; and in aggregate "build+render” performance is significantly faster than the best published numbers for either of these systems, be it CPU or GPU, BVH, kd-tree, or grid.
INDEX TERMS
Bounding volume hierarchies (BVHs), parallel BVH construction, surface area heuristic (SAH), Intel MIC architecture.
CITATION
Ingo Wald, "Fast Construction of SAH BVHs on the Intel Many Integrated Core (MIC) Architecture", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 1, pp. 47-57, January 2012, doi:10.1109/TVCG.2010.251
REFERENCES
[1] Intel “Intel News Release: Intel Unveils New Product Plans for High-Performance Computing,” http://www.intel.com/ pressroom/archive/ releases20100531comp.htm, May 2010.
[2] C. Lauterbach, M. Garland, S. Sengupta, D. Luebke, and D. Manocha, “Fast BVH Construction on GPUs,” Computer Graphics Forum, vol. 28, no. 2, pp. 375-384, 2009.
[3] I. Wald, “On Fast Construction of SAH-Based Bounding Volume Hierarchies,” Proc. IEEE/Eurographics Symp. Interactive Ray Tracing, pp. 33-40, 2007.
[4] T. Aila and S. Laine, “Understanding the Efficiency of Ray Traversal on GPUs,” Proc. ACM Conf. High Performance Graphics, 2009.
[5] L. Seiler, D. Carmean, E. Sprangle, T. Forsyth, M. Abrash, P. Dubey, S. Junkins, A. Lake, J. Sugerman, R. Cavin, R. Espasa, E. Grochowski, T. Juan, and P. Hanrahan, “Larrabee: A Many-Core x86 Architecture for Visual Computing,” ACM Trans. Graphics, vol. 27, no. 3, pp. 1-15, 2008.
[6] M. Ernst and G. Greiner, “Multi Bounding Volume Hierarchies,” Proc. IEEE/Eurographics Symp. Interactive Ray Tracing, pp. 35-40, 2008.
[7] M. Stich, H. Friedrich, and A. Dietrich, “Spatial Splits in Bounding Volume Hierarchies,” Proc. Conf. High Performance Graphics, 2009.
[8] B. Fabianowski and J. Dingliana, “Compact BVH Storage for Ray Tracing and Photon Mapping,” Proc. Ninth Eurographics Ireland Workshop, pp. 1-8, 2009.
[9] J. Goldsmith and J. Salmon, “Automatic Creation of Object Hierarchies for Ray Tracing,” IEEE Computer Graphics and Applications, vol. CGA-7, no. 5, pp. 14-20, May 1987.
[10] K.R. Subramanian and D.S. Fussel, “Factors Affecting Performance of Ray Tracing Hierarchies,” Technical Report Tx 78712, The Univ. of Texas at Austin, July 1990.
[11] V. Havran, “Heuristic Ray Shooting Algorithms,” PhD dissertation, Faculty of Electrical Eng., Czech Technical Univ. in Prague, 2001.
[12] W. Hunt, G. Stoll, and W. Mark, “Fast kd-Tree Construction with an Adaptive Error-Bounded Heuristic,” Proc. IEEE Symp. Interactive Ray Tracing, 2006.
[13] S. Popov, J. Günther, H.-P. Seidel, and P. Slusallek, “Experiences with Streaming Construction of SAH KD-Trees,” Proc. IEEE Symp. Interactive Ray Tracing, 2006.
[14] W. Hunt, W.R. Mark, D.S. Fussell, and G. Stoll, “Fast and Lazy Build of Acceleration Structures from Scene Hierarchies,” Proc. IEEE/Eurographics Symp. Interactive Ray Tracing, 2007.
[15] J. Pantaleoni and D. Luebke, “Hierarchical LBVH Construction for Real-Time Ray Tracing of Dynamic Geometry,” Proc. Conf. High Performance Graphics, pp. 87-95, 2010.
[16] I. Wald, S. Boulos, and P. Shirley, “Ray Tracing Deformable Scenes Using Dynamic Bounding Volume Hierarchies,” ACM Trans. Graphics, vol. 26, no. 1, pp. 1-18, 2007.
[17] M. Shevtsov, A. Soupikov, and A. Kapustin, “Fast and Scalable kd-Tree Construction for Interactively Ray Tracing Dynamic Scenes,” Computer Graphics Forum, vol. 26, no. 3, 2007.
[18] K. Zhou, Q. Hou, R. Wang, and B. Guo, “Real-Time KD-Tree Construction on Graphics Hardware,” Proc. ACM SIGGRAPH Asia, 2008.
[19] Q. Hou, X. Sun, K. Zhou, C. Lauterbach, and D. Manocha, “Memory-Scalable GPU Spatial Hierarchy Construction,” IEEE Trans. Visualization and Computer Graphics, June 2010.
[20] B. Choi, R. Komuravelli, V. Lu, H. Sung, R.L. Bocchino, S.V. Adve, and J.C. Hart, “Parallel SAH k-D Tree Construction,” Proc. Conf. High Performance Graphics, pp. 77-86, 2010.
[21] E. Reinhard, B. Smits, and C. Hansen, “Dynamic Acceleration Structures for Interactive Ray Tracing,” Proc. Eurographics Workshop Rendering, pp. 299-306, June 2000.
[22] I. Wald, T. Ize, A. Kensler, A. Knoll, and S.G. Parker, “Ray Tracing Animated Scenes Using Coherent Grid Traversal,” ACM Trans. Graphics, vol. 25, no. 3, pp. 485-493, 2006.
[23] T. Ize, I. Wald, C. Robertson, and S.G. Parker, “An Evaluation of Parallel Grid Construction for Ray Tracing Dynamic Scenes,” Proc. IEEE Symp. Interactive Ray Tracing, pp. 47-55, 2006.
[24] J. Kalojanov and P. Slusallek, “A Parallel Algorithm for Construction of Uniform Grids,” Proc. Conf. High Performance Graphics, 2009.
[25] Intel LRBni, “C++ Larrabee Prototype Library,” http:// software.intel.com/en-us/ articlesprototype-primitives-guide/, 2009.
[26] M. Abrash, Graphics Programming Black Book. Coriolis, 1997.
[27] R. Blumofe, C. Joerg, B. Kuszmaul, C. Leiserson, K. Randall, and Y. Zhou, “Cilk: An Efficient Multithreaded Runtime System,” ACM SIGPLAN Notices, vol. 30, no. 8, pp. 207-216, 1995.
[28] C. Benthin and I. Wald, “Efficient Ray Traced Soft Shadows Using Multi-Frusta Tracing,” Proc. ACM Conf. High Performance Graphics, 2009.
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool