Reference TypeConference Proceedings
Citation KeyJiangSajaGopi:2013:SiDaLa
Author1 Jiang, Shan
2 Sajadi, Behzad
3 Gopi, M.
Affiliation1 University of California, Irvine
2 University of California, Irvine
3 University of California, Irvine
TitleSingle-Seek Data Layout for Walkthrough Applications
Conference NameConference on Graphics, Patterns and Images, 26 (SIBGRAPI)
EditorBoyer, Kim
Hirata, Nina
Nedel, Luciana
Silva, Claudio
Book TitleProceedings
DateAug. 5-8, 2013
Publisher CityLos Alamitos
PublisherIEEE Computer Society
Conference LocationArequipa, Peru
KeywordsOut-Of-Core algorithms, Data Layouts.
AbstractWith increasing speed of graphics rendering, the bottleneck in walkthrough applications has shifted to data transfer from secondary storage device to main memory. While techniques designed to reduce the data transfer volume and amortize the transfer cost are well-studied, the disk seek time, which is one of the most important components of the total rendering cost is not reduced explicitly. In this work, we propose an orthogonal approach to address the disk seek time bottleneck, namely single-seek data layouts. This is a solution in one end of the spectrum of solutions that guarantee an upper bound on the number of disk seeks. Using this approach, we can reduce the number of disk seeks required to load the data for any viewpoint in the scene to no more than one. We achieve this single seek layout using data redundancy. We provide a theoretical proof on the upper-bound of this redundancy factor, and analyze its trade-off with the rendering performance through an implementation that uses this data layout for walkthrough applications of datasets with hundreds of millions of triangles.
Tertiary TypeFull Paper
Size1207 KiB
Number of Files1
Target Filesingleseek.pdf
Last Update2013:
Metadata Last Update2020: administrator {D 2013}
Document Stagecompleted
Is the master or a copy?is the master
Content TypeExternal Contribution
source Directory Contentthere are no files
agreement Directory Content
agreement.html 13/07/2013 01:02 0.7 KiB 
History2013-07-13 04:02:13 :: -> administrator ::
2020-02-19 03:09:22 :: administrator -> :: 2013
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition electronicmailaddress group holdercode isbn issn label lineage mark nextedition nexthigherunit notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume
Access Date2020, Nov. 25