Advertisement

The Visual Computer

, Volume 33, Issue 2, pp 139–149 | Cite as

Optimally Redundant, Seek-Time Minimizing Data Layout for Interactive Rendering

  • Jia ChenEmail author
  • Shan Jiang
  • Zachary Destefano
  • Sungeui Yoon
  • M. Gopi
Original Article

Abstract

Performance of interactive graphics walkthrough systems depends on the time taken to fetch the required data from the secondary storage to main memory. It has been earlier established that a large fraction of this fetch time is spent on seeking the data on the hard disk. In order to reduce this seek time, redundant data storage has been proposed in the literature, but the redundancy factors of those layouts are prohibitively high. In this paper, we develop a cost model for the seek time of a layout. Based on this cost model, we propose an elegant algorithm that computes a redundant data layout with the redundancy factor that is within the user-specified bounds, while maximizing the performance of the system. By using a set of training access requirements and a set of validation access requirements, our proposed method is able to automatically maximize system performance with an optimal redundancy factor. Experimental results show that the interactive rendering speed of the walkthrough system was improved by a factor of 2–4 by using our data layout method when compared to existing methods with or without redundancy.

Keywords

Data layout problem Out-of-core rendering Cache oblivious mesh layout Redundant data layout Walkthrough application 

References

  1. 1.
    Agrawal, N., Prabhakaran, V., Wobber, T., Davis, J.D., Manasse, M., Panigrahy, R.: Design tradeoffs for SSD performance. In: ATC’08: USENIX 2008 Annual Technical Conference on Annual Technical Conference, pp. 57–70. USENIX Association, Berkeley, CA, USA (2008)Google Scholar
  2. 2.
    Aliaga, D., Cohen, J., Wilson, A., Baker, E., Zhang, H., Erikson, C., Hoff, K., Hudson, T., Stuerzlinger, W., Bastos, R., Whitton, M., Brooks, F., Manocha, D.: MMR: an interactive massive model rendering system using geometric and image-based acceleration. In: Proceedings Symposium on Interactive 3D Graphics, pp. 199–206. ACM SIGGRAPH (1999)Google Scholar
  3. 3.
    Domingo, J.S.: SSD vs. HDD: what’s the difference. PC Magazine (2014). http://www.pcmag.com/article2/0,2817,2404260,00.asp
  4. 4.
    Diaz-Gutierrez, P., Bhushan, A., Gopi, M., Pajarola, R.: Constrained strip generation and management for efficient interactive 3D rendering. Comput. Graph. Int. 2005, 115–121 (2005). doi: 10.1109/CGI.2005.1500388
  5. 5.
    Hoppe, H.: Progressive meshes. In: Proceedings SIGGRAPH, pp. 99–108 (1996)Google Scholar
  6. 6.
    Hoppe, H.: View-dependent refinement of progressive meshes. In: SIGGRAPH, pp. 189–198 (1997)Google Scholar
  7. 7.
    Jiang, S., Sajadi, B., Gopi, M.: Single-seek data layout for walkthrough applications. In: SIBGRAPI 2013 (2013)Google Scholar
  8. 8.
    Jiang, S., Sajadi, B., Ihler, A., Gopi, M.: Optimizing redundant-data clustering for interactive walkthrough applications. In: CGI 2014 (2014)Google Scholar
  9. 9.
    Lindstrom, P., Turk, G.: Evaluation of memoryless simplification. IEEE Trans. Vis. Comput. Graph. 5(2), 98–115 (1999)CrossRefGoogle Scholar
  10. 10.
    Luebke, D., Reddy, M., Cohen, J., Varshney, A., Watson, B., Huebner, R.: Level of Detail for 3D Graphics. Morgan-Kaufmann, San Fancisco (2002)Google Scholar
  11. 11.
    Patterson, D.A., Gibson, G., Katz, R.H.: A case for redundant arrays of inexpensive disks (raid). In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, SIGMOD ’88, pp. 109–116. ACM (1988)Google Scholar
  12. 12.
    Peng, J., Huang, Y., Kuo, C.C.J., Eckstein, I., Gopi, M.: Feature oriented progressive lossless mesh coding. Comput. Graph. Forum 29(7), 2029–2038 (2010). doi: 10.1111/j.1467-8659.2010.01789.x CrossRefGoogle Scholar
  13. 13.
    Rizvi, S., Chung, T.S.: Flash SSD vs HDD: high performance oriented modern embedded and multimedia storage systems. In: 2nd International Conference on Computer Engineering and Technology (ICCET), 2010, vol. 7, pp. V7–297–V7–299 (2010)Google Scholar
  14. 14.
    Saxena, M., Swift, M.M.: Flashvm: revisiting the virtual memory hierarchy. In: Proceedings of USENIX HotOS-XII (2009)Google Scholar
  15. 15.
    Shaffer, E., Garland, M.: Efficient adaptive simplification of massive meshes. In: Proceedings of IEEE Visualization, Computer Society Press, pp. 127–134. (2001)Google Scholar
  16. 16.
    Sajadi, B., Jiang, S., Heo, J., Yoon, S., Gopi, M.: Data management for ssds for large-scale interactive graphics applications. In: I3D ’11 Symposium on Interactive 3D Graphics and Games, pp. 175–182. ACM, New York, NY (2011)Google Scholar
  17. 17.
    Silva, C., Chiang, Y.J., Correa, W., El-Sana, J., Lindstrom, P.: Out-of-core algorithms for scientific visualization and computer graphics. In: IEEE Visualization Course Notes (2002)Google Scholar
  18. 18.
    Varadhan, G., Manocha, D.: Out-of-core rendering of massive geometric datasets. In: Proceedings IEEE Visualization 2002, Computer Society Press, pp. 69–76. (2002)Google Scholar
  19. 19.
    Yoon, S.E., Lindstrom, P.: Mesh layouts for block-based caches. IEEE Trans. Visual. Comput. Graph. 12(5), 1213–1220 (2006)CrossRefGoogle Scholar
  20. 20.
    Yoon, S., Lindstrom, P., Pascucci, V., Manocha, D.: Cache oblivious mesh layouts. In: ACM SIGGGRAPH 2005 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Jia Chen
    • 1
    Email author
  • Shan Jiang
    • 1
  • Zachary Destefano
    • 1
  • Sungeui Yoon
    • 2
  • M. Gopi
    • 1
  1. 1.University of CaliforniaIrvineUSA
  2. 2.Korea Advanced Institute of Science and TechnologyDaejeonSouth Korea

Personalised recommendations