4706

Binary Mesh Partitioning for Cache-Efficient Visualization

Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin
DAM, CEA, Montbonnot Saint Martin, France
IEEE Transactions on Visualization and Computer Graphics, 2010

@article{tchiboukdjian2010binary,

   title={Binary mesh partitioning for cache-efficient visualization},

   author={Tchiboukdjian, M. and Danjean, V. and Raffin, B.},

   journal={Visualization and Computer Graphics, IEEE Transactions on},

   volume={16},

   number={5},

   pages={815–828},

   year={2010},

   publisher={IEEE}

}

Download Download (PDF)   View View   Source Source   

720

views

One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into consideration the memory hierarchy to design cache efficient algorithms. CO approaches have the advantage to adapt to unknown and varying memory hierarchies. Recent CA and CO algorithms developed for 3D mesh layouts significantly improve performance of previous approaches, but they lack of theoretical performance guarantees. We present in this paper a O(N log N) algorithm to compute a CO layout for unstructured but well shaped meshes. We prove that a coherent traversal of a JV-size mesh in dimension d induces less than N/B + O(N/M1/d) cache-misses where B and M are the block size and the cache size, respectively. Experiments show that our layout computation is faster and significantly less memory consuming than the best known CO algorithm. Performance is comparable to this algorithm for classical visualization algorithm access patterns, or better when the BSP tree produced while computing the layout is used as an acceleration data structure adjusted to the layout. We also show that cache oblivious approaches lead to significant performance increases on recent GPU architectures.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: