research-article

Data management for SSDs for large-scale interactive graphics applications

Authors:

Sung-Eui YoonAuthors Info & Claims

I3D '11: Symposium on Interactive 3D Graphics and Games

Pages 175 - 182

https://doi.org/10.1145/1944745.1944775

Published: 18 February 2011 Publication History

Abstract

Solid state drives (SSDs) are emerging as an alternative storage medium to HDDs. SSDs have performance characteristics (e.g., fast random reads) that are very different from those of HDDs. Because of the high performance of SSDs, there are increasingly more research efforts to redesign the established techniques that are optimized for HDDs, to work well with SSDs. In this paper we focus on computing cache-coherent layouts of large-scale models for SSDs. It has been demonstrated that cache-oblivious layouts perform well for various applications running on HDDs. However, computing cache-oblivious layouts for large-models is known to be very expensive. Also these layouts cannot be maintained efficiently for dynamically changing models. Utilizing the properties of SSDs we propose an efficient layout computation method that produces a page-based cache-aware layout for SSDs. We show that the performance of our layout can be maintained under dynamic changes on the model and is similar to the cache-oblivious layout optimized for static models. We demonstrate the benefits of our method for large-scale walkthrough scene editing and rendering, and collision detection.

Supplementary Material

WMV File (p175-sajadi.wmv)

Download
31.72 MB

References

[1]

Agrawal, N., Prabhakaran, V., Wobber, T., Davis, J. D., Manasse, M., and Panigrahy, R. 2008. Design tradeoffs for ssd performance. In ATC'08: USENIX 2008 Annual Technical Conference on Annual Technical Conference, USENIX Association, Berkeley, CA, USA, 57--70.

Digital Library

[2]

Chen, S., Gibbonst, P. B., Mowry, T. C., and Valentin, G. 2002. Fractal prefetching b+-trees: Optimizing both cache and disk performance. In ACM SIGMOD International Conference on Management of Data (Madison, WI, 0306 June 2002, ACM Press, 157--168.

Digital Library

[3]

Deering, M. F. 1995. Geometry compression. In ACM SIGGRAPH, 13--20.

Digital Library

[4]

Diaz-Gutierrez, P., Bhushan, A., Gopi, M., and Pajarola, R. 2005. Constrained Strip Generation and Management for Efficient Interactive 3D Rendering. In Proc. of Computer Graphics International Conference, 115--121.

Digital Library

[5]

Diaz-Gutierrez, P., Bhushan, A., Gopi, M., and Pajarola, R. 2006. Single Strips for Fast Interactive Rendering. The Visual Computer 22, 6, 372--386.

Digital Library

[6]

Ericson, C. 2004. Real-Time Collision Detection. Morgan Kaufmann.

Digital Library

[7]

Graefe, G., and Larson, P. A. 2001. B-tree indexes and cpu caches. Data Engineering, International Conference on 0, 0349.

Digital Library

[8]

Hoppe, H. 1999. Optimization of mesh locality for transparent vertex caching. ACM SIGGRAPH, 269--276.

Digital Library

[9]

Isenburg, M., and Lindstrom, P. 2005. Streaming meshes. IEEE Visualization, 231--238.

[10]

Isenburg, M., Lindstrom, P., Gumhold, S., and Snoeyink, J. 2003. Large mesh simplification using processing sequences. IEEE Visualization, 465--472.

Digital Library

[11]

Kim, H., and Ahn, S. 2008. Bplru: a buffer management scheme for improving random writes in flash storage. In FAST'08: Proceedings of the 6th USENIX Conference on File and Storage Technologies, USENIX Association, Berkeley, CA, USA, 1--14.

Digital Library

[12]

Ko, S., Jun, S., Ryu, Y., Kwon, O., and Koh, K. 2008. A new linux swap system for flash memory storage devices. In ICCSA '08: Proceedings of the 2008 International Conference on Computational Sciences and Its Applications, IEEE Computer Society, Washington, DC, USA, 151--156.

Digital Library

[13]

Levy, H. M., and Lipman, P. H. 1982. Virtual memory management in the vax/vms operating system. Computer 15, 3, 35--41.

Digital Library

[14]

Lindstrom, P., and Pascucci, V. 2001. Visualization of large terrains made easy. IEEE Visualization, 363--370.

Digital Library

[15]

Pascucci, V., and Frank, R. J. 2001. Global static indexing for real-time exploration of very large regular grids. In Supercomputing.

Digital Library

[16]

Sagan, H. 1994. Space-Filling Curves. Springer-Verlag.

[17]

Sajadi, B., Huang, Y., Diaz-Gutierrez, P., Yoon, S.-E., and Gopi, M. 2009. A novel page-based data structure for interactive walkthroughs. In I3D '09: Proceedings of the 2009 symposium on Interactive 3D graphics and games, ACM, New York, NY, USA, 23--29.

Digital Library

[18]

Saxena, M., and Swift, M. M. 2009. Flashvm: Revisiting the virtual memory hierarchy. In Proc. of USENIX HotOS-XII.

Digital Library

[19]

Silva, C., Chiang, Y.-J., Correa, W., El-Sana, J., and Lindstrom, P. 2002. Out-of-core algorithms for scientific visualization and computer graphics. In IEEE Visualization Course Notes.

[20]

Velho, L., and de Miranda Gomes, J. 1991. Digital halftoning with space filling curves. In ACM SIGGRAPH, 81--90.

Digital Library

[21]

Vitter, J. S. 2001. External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv. 33, 2, 209--271.

Digital Library

[22]

Yoon, S.-E., and Lindstrom, P. 2006. Mesh layouts for block-based caches. IEEE Trans. on Visualization and Computer Graphics (Proc. Visualization) 12, 5, 1213--1220.

Digital Library

[23]

Yoon, S.-E., Lindstrom, P., Pascucci, V., and Manocha, D. 2005. Cache-Oblivious Mesh Layouts. ACM Transactions on Graphics (SIGGRAPH) 24, 3, 886--893.

Digital Library

[24]

Zhou, D., and Meng, X. 2009. Rs-wrapper: random write optimization for solid state drive. In CIKM '09: Proceeding of the 18th ACM conference on Information and knowledge management, ACM, New York, NY, USA, 1457--1460.

Digital Library

Cited By

Chen H(2017)Evaluation of triangular mesh layout techniques using large mesh simplificationMultimedia Tools and Applications10.1007/s11042-017-4607-z76:23(25391-25419)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s11042-017-4607-z
Chen JJiang SDestefano ZYoon SGopi M(2017)Optimally Redundant, Seek-Time Minimizing Data Layout for Interactive RenderingThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-015-1165-033:2(139-149)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1007/s00371-015-1165-0
Olano MOtaduy M(2015)I3D 2014 Guest Editor’s IntroductionIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2015.242223121:6(686-687)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1109/TVCG.2015.2422231
Show More Cited By

Index Terms

Data management for SSDs for large-scale interactive graphics applications

Recommendations

Data management and optimization of data layouts for large-scale interactive walkthrough applications
Optimizing redundant-data clustering for interactive walkthrough applications

In modern walkthrough applications, storing massive datasets has become easy and inexpensive due to the availability of gigantic disk-based storage devices including hard drives, DVDs, and Blu-ray discs. However, fetching data from these devices for ...
Using Working Set Reorganization to Manage Storage Systems with Hard and Solid State Disks
ICPPW '14: Proceedings of the 2014 43rd International Conference on Parallel Processing Workshops

Scientific applications from many problem domains produce and/or access large volumes of data. To support these applications, designers of high-end computing (HEC) systems have greatly increased the capacity of storage systems in recent years. However, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

I3D '11: Symposium on Interactive 3D Graphics and Games

February 2011

207 pages

ISBN:9781450305655

DOI:10.1145/1944745

General Chairs:
Michael Garland
NVIDIA Research
,
Rui Wang
University of Massachusetts

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 February 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

I3D '11

Sponsor:

SIGGRAPH

I3D '11: Symposium on Interactive 3D Graphics and Games

February 18 - 20, 2011

California, San Francisco

Acceptance Rates

I3D '11 Paper Acceptance Rate 24 of 64 submissions, 38%;

Overall Acceptance Rate 148 of 485 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
294
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen H(2017)Evaluation of triangular mesh layout techniques using large mesh simplificationMultimedia Tools and Applications10.1007/s11042-017-4607-z76:23(25391-25419)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s11042-017-4607-z
Chen JJiang SDestefano ZYoon SGopi M(2017)Optimally Redundant, Seek-Time Minimizing Data Layout for Interactive RenderingThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-015-1165-033:2(139-149)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1007/s00371-015-1165-0
Olano MOtaduy M(2015)I3D 2014 Guest Editor’s IntroductionIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2015.242223121:6(686-687)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1109/TVCG.2015.2422231
Duy-Quoc Lai Sajadi BShan Jiang Meenakshisundaram GMajumder A(2015)A Distributed Memory Hierarchy and Data Management for Interactive Scene Navigation and Modification on Tiled Display WallsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2015.239843921:6(714-729)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1109/TVCG.2015.2398439
Jiang SSajadi BIhler AGopi M(2014)Optimizing redundant-data clustering for interactive walkthrough applicationsThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-014-0949-y30:6-8(637-647)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1007/s00371-014-0949-y
Jiang SSajadi BGopi M(2013)Single-Seek Data Layout for Walkthrough ApplicationsProceedings of the 2013 XXVI Conference on Graphics, Patterns and Images10.1109/SIBGRAPI.2013.44(266-273)Online publication date: 5-Aug-2013
https://dl.acm.org/doi/10.1109/SIBGRAPI.2013.44

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents