A Fast Cache-Oblivious Mesh Layout with Theoretical Guarantees - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

A Fast Cache-Oblivious Mesh Layout with Theoretical Guarantees

(1) , (1) , (1)
1

Abstract

One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cache-aware (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. However, these algorithms are based on heuristics. We propose in this paper a new CO algorithm for meshes that has both a low theoretical complexity and proven quality. We guarantee that a coherent traversal of an N-size mesh in dimension d will induce less than N/B+N/M^{1/d}) cache misses where B and M are the block size and the cache size. We compare our layout with previous ones on several 3D meshes.
Fichier principal
Vignette du fichier
send-paper.pdf (262.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00436053 , version 1 (25-11-2009)

Identifiers

  • HAL Id : inria-00436053 , version 1

Cite

Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin. A Fast Cache-Oblivious Mesh Layout with Theoretical Guarantees. International Workshop on Super Visualization (IWSV'08), Jun 2008, Kos, Greece. ⟨inria-00436053⟩
137 View
83 Download

Share

Gmail Facebook Twitter LinkedIn More