Show simple item record

dc.contributor.authorLabschutz, Matthias
dc.contributor.authorBruckner, Stefan
dc.contributor.authorGroller, M. Eduard
dc.contributor.authorHadwiger, Markus
dc.contributor.authorRautek, Peter
dc.date.accessioned2015-08-19T12:27:02Z
dc.date.available2015-08-19T12:27:02Z
dc.date.issued2015-08-12
dc.identifier.citationJiTTree: A Just-in-Time Compiled Sparse GPU Volume Data Structure 2015:1 IEEE Transactions on Visualization and Computer Graphics
dc.identifier.issn1077-2626
dc.identifier.doi10.1109/TVCG.2015.2467331
dc.identifier.urihttp://hdl.handle.net/10754/575241
dc.description.abstractSparse volume data structures enable the efficient representation of large but sparse volumes in GPU memory for computation and visualization. However, the choice of a specific data structure for a given data set depends on several factors, such as the memory budget, the sparsity of the data, and data access patterns. In general, there is no single optimal sparse data structure, but a set of several candidates with individual strengths and drawbacks. One solution to this problem are hybrid data structures which locally adapt themselves to the sparsity. However, they typically suffer from increased traversal overhead which limits their utility in many applications. This paper presents JiTTree, a novel sparse hybrid volume data structure that uses just-in-time compilation to overcome these problems. By combining multiple sparse data structures and reducing traversal overhead we leverage their individual advantages. We demonstrate that hybrid data structures adapt well to a large range of data sets. They are especially superior to other sparse data structures for data sets that locally vary in sparsity. Possible optimization criteria are memory, performance and a combination thereof. Through just-in-time (JIT) compilation, JiTTree reduces the traversal overhead of the resulting optimal data structure. As a result, our hybrid volume data structure enables efficient computations on the GPU, while being superior in terms of memory usage when compared to non-hybrid data structures.
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7192686
dc.rights(c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
dc.titleJiTTree: A Just-in-Time Compiled Sparse GPU Volume Data Structure
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalIEEE Transactions on Visualization and Computer Graphics
dc.eprint.versionPost-print
dc.contributor.institutionUniversity of Bergen
dc.contributor.institutionTU Wien and VrVis Research Center
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)
kaust.personLabschutz, Matthias
kaust.personHadwiger, Markus
kaust.personRautek, Peter
refterms.dateFOA2018-06-13T12:14:10Z


Files in this item

Thumbnail
Name:
07192686.pdf
Size:
14.47Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record