{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:40:01Z","timestamp":1742359201885,"version":"3.40.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T00:00:00Z","timestamp":1735344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T00:00:00Z","timestamp":1735344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["251654672"],"award-info":[{"award-number":["251654672"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009534","name":"Universit\u00e4t Stuttgart","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009534","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:sec>\n            <jats:title>Abstract<\/jats:title>\n            <jats:p>Visualisation is an essential tool for analysing unstructured particle data as they are produced, for instance, in molecular dynamics or astrodynamics simulations. Such simulations often comprise multiple time steps, and scientists produce datasets with more and more particles in each step. To handle the steadily increasing size of these simulations, many solutions based on organising the data efficiently or reducing their amount using compression have been proposed over the years. Recently, a new storage API called <jats:italic>DirectStorage<\/jats:italic> has been introduced on Xbox consoles and Windows. DirectStorage promises a dramatic reduction of loading times in games by making the transfer from NVMe drives to graphics memory more efficient. That begs the question of whether DirectStorage is also beneficial for visualising time-dependent particle data that have to be streamed from disc to the GPU and whether a potential improvement in throughput enables interactive streaming of frames that traditional APIs cannot handle. For that, we implemented a benchmarking application that supports different streaming methods. We report on the results of an extensive series of tests with varying parameters that influence the streaming performance, which show that the performance of DirectStorage is highly dependent on the choice of various parameters.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Graphic Abstract<\/jats:title>\n            <jats:p>We provide an empirical evaluation for the performance gains to be expected when using the DirectStorage API for rendering dynamic particle data set like the one on the right side. For that, we compare the overlapping DirectStorage-based I\/O scheme depicted on at the bottom with traditional methods <\/jats:p>\n          <\/jats:sec>","DOI":"10.1007\/s12650-024-01036-3","type":"journal-article","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T05:16:00Z","timestamp":1735362960000},"page":"397-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantifying performance gains of DirectStorage for the visualisation of time-dependent particle datasets"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9979-3682","authenticated-orcid":false,"given":"Christoph","family":"M\u00fcller","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4019-2505","authenticated-orcid":false,"given":"Thomas","family":"Ertl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,28]]},"reference":[{"issue":"9","key":"1036_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517. https:\/\/doi.org\/10.1145\/361002.361007","journal-title":"Commun ACM"},{"issue":"9","key":"1036_CR2","doi-asserted-by":"publisher","first-page":"2848","DOI":"10.1109\/TVCG.2019.2898435","volume":"26","author":"V Bruder","year":"2020","unstructured":"Bruder V, M\u00fcller C, Frey S, Ertl T (2020) On evaluating runtime performance of interactive visualizations. IEEE Trans Vis Comput Graph 26(9):2848\u20132862. https:\/\/doi.org\/10.1109\/TVCG.2019.2898435","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"1036_CR3","unstructured":"Childs H, Brugger E, Whitlock B, Meredith J, Ahern S, Pugmire D, Biagas K, Miller M, Harrison C, Weber G, Krishnan H, Fogal TSanderson A, Garth C, Bethel EW, Camp D, Rubel O, Durant M, Favre J, Navratil P (2012) VisIt: An end-user tool for visualizing and analyzing very large data. High Perf Vis-Enabling Extreme-Scale Scient Insight, pp 357\u2013372"},{"issue":"10","key":"1036_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/360349.360354","volume":"19","author":"JH Clark","year":"1976","unstructured":"Clark JH (1976) Hierarchical geometric models for visible surface algorithms. Commun ACM 19(10):547\u2013554. https:\/\/doi.org\/10.1145\/360349.360354","journal-title":"Commun ACM"},{"issue":"6","key":"1036_CR5","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1109\/TVCG.2009.142","volume":"15","author":"R Fraedrich","year":"2009","unstructured":"Fraedrich R, Schneider J, Westermann R (2009) Exploring the millennium run \u2013 scalable rendering of large-scale cosmological datasets. IEEE Trans Vis Comput Graph 15(6):1251\u20131258. https:\/\/doi.org\/10.1109\/TVCG.2009.142","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"02","key":"1036_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TVCG.2014.2350479","volume":"21","author":"S Grottel","year":"2015","unstructured":"Grottel S, Krone M, M\u00fcller C, Reina G, Ertl T (2015) MegaMol \u2013 a prototyping framework for particle-based visualization. IEEE Tran Vis Comput Graph 21(02):201\u2013214. https:\/\/doi.org\/10.1109\/TVCG.2014.2350479","journal-title":"IEEE Tran Vis Comput Graph"},{"issue":"9","key":"1036_CR7","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.jpdc.2011.07.011","volume":"72","author":"J G\u00f3mez-Luna","year":"2012","unstructured":"G\u00f3mez-Luna J, Gonz\u00e1lez-Linares JM, Benavides JI, Guil N (2012) Performance models for asynchronous data transfers on consumer Graphics Processing Units. J Parallel Distrib Comput 72(9):1117\u20131126. https:\/\/doi.org\/10.1016\/j.jpdc.2011.07.011","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"1036_CR8","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1111\/j.1467-8659.2009.01698.x","volume":"29","author":"S Grottel","year":"2010","unstructured":"Grottel S, Reina G, Dachsbacher C, Ertl T (2010) Coherent culling and shading for large molecular dynamics visualization. Comput Graph Forum 29(3):953\u2013962. https:\/\/doi.org\/10.1111\/j.1467-8659.2009.01698.x","journal-title":"Comput Graph Forum"},{"key":"1036_CR9","doi-asserted-by":"publisher","unstructured":"Grottel S, Reina G, Ertl T (2009) Optimized data transfer for time-dependent, GPU-based glyphs. In: Proc Pac Vis Symp, pp 65\u201372 https:\/\/doi.org\/10.1109\/PACIFICVIS.2009.4906839","DOI":"10.1109\/PACIFICVIS.2009.4906839"},{"key":"1036_CR10","doi-asserted-by":"publisher","unstructured":"Gralka P, Reina G, Ertl T (2023) Efficient sphere rendering revisited. In: Proc Symp Parallel Graph Vis https:\/\/doi.org\/10.2312\/pgv.20231083","DOI":"10.2312\/pgv.20231083"},{"key":"1036_CR11","doi-asserted-by":"publisher","unstructured":"Grottel S (2012) Point-based visualization of molecular dynamics data sets. PhD thesis, Universit\u00e4t Stuttgart. https:\/\/doi.org\/10.18419\/opus-6385","DOI":"10.18419\/opus-6385"},{"key":"1036_CR12","unstructured":"Gumhold S (2003) Splatting illuminated ellipsoids with depth correction. In: Proc VMV, pp 245\u2013252"},{"key":"1036_CR13","doi-asserted-by":"publisher","unstructured":"Gralka P, Wald I, Geringer S, Reina G, Ertl T (2020) Spatial partitioning strategies for memory-efficient ray tracing of particles. In: Proc LDAV, pp 42\u201352. https:\/\/doi.org\/10.1109\/LDAV51489.2020.00012","DOI":"10.1109\/LDAV51489.2020.00012"},{"key":"1036_CR14","doi-asserted-by":"publisher","unstructured":"Hoang D, Bhatia H, Lindstrom P, Pascucci V (2021) High-quality and low-memory-footprint progressive decoding of large-scale particle data. In: Proc LDAV, pp 32\u201342 https:\/\/doi.org\/10.1109\/LDAV53230.2021.00011","DOI":"10.1109\/LDAV53230.2021.00011"},{"issue":"1","key":"1036_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0263-7855(96)00018-5","volume":"14","author":"W Humphrey","year":"1996","unstructured":"Humphrey W, Dalke A, Schulten K (1996) VMD: visual molecular dynamics. J Mol Graph 14(1):33\u201338. https:\/\/doi.org\/10.1016\/0263-7855(96)00018-5","journal-title":"J Mol Graph"},{"key":"1036_CR16","doi-asserted-by":"publisher","unstructured":"Inupakutika D, Davis B, Yang Q, Kim D, Akopian D (2022) Quantifying Performance Gains of GPUDirect Storage. In: Proc Int\u2019l Conf Netw, Arch Storage, pp 1\u20139. https:\/\/doi.org\/10.1109\/NAS55553.2022.9925516","DOI":"10.1109\/NAS55553.2022.9925516"},{"key":"1036_CR17","doi-asserted-by":"publisher","unstructured":"Kumar S, Petruzza S, Usher W, Pascucci V (2019) Spatially-aware parallel I\/O for particle data. In: Proc ICPP. https:\/\/doi.org\/10.1145\/3337821.3337875","DOI":"10.1145\/3337821.3337875"},{"key":"1036_CR18","doi-asserted-by":"publisher","unstructured":"M\u00fcller C, Braun M, Ertl T (2019) Optimised molecular graphics on the HoloLens. In: Proc IEEE VR, pp 97\u2013102. https:\/\/doi.org\/10.1109\/VR.2019.8798111","DOI":"10.1109\/VR.2019.8798111"},{"key":"1036_CR19","unstructured":"Microsoft (2022) DirectStorage on Windows samples. Online https:\/\/github.com\/microsoft\/DirectStorage. Accessed 1 Dec 2023"},{"key":"1036_CR20","unstructured":"Microsoft (2023) BypassIO for filter drivers. Online https:\/\/learn.microsoft.com\/en-us\/windows-hardware\/drivers\/ifs\/bypassio. Accessed 1 Dec 2023"},{"key":"1036_CR21","unstructured":"NVIDIA: NVIDIA Turing GPU Architecture. Technical report (2017). Available online https:\/\/images.nvidia.com\/aem-dam\/en-zz\/Solutions\/design-visualization\/technologies\/turing-architecture\/NVIDIA-Turing-Architecture-Whitepaper.pdf. Accessed 1 Dec 2023"},{"issue":"4","key":"1036_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1778765.1778803","volume":"29","author":"SG Parker","year":"2010","unstructured":"Parker SG, Bigler J, Dietrich A, Friedrich H, Hoberock J, Luebke D, McAllister D, McGuire M, Morley K, Robison A (2010) Optix: a general purpose ray tracing engine. ACM Trans Graph 29(4):1\u201313","journal-title":"ACM Trans Graph"},{"issue":"4","key":"1036_CR23","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/0097-8493(89)90006-X","volume":"13","author":"H Samet","year":"1989","unstructured":"Samet H (1989) Implementing ray tracing with octrees and neighbor finding. Comput Graph 13(4):445\u2013460. https:\/\/doi.org\/10.1016\/0097-8493(89)90006-X","journal-title":"Comput Graph"},{"key":"1036_CR24","unstructured":"Serandour A, Ono T (2022) Breaking down the world of Athia: the technology of Forspoken. Talk at GDC 2022, available online https:\/\/gpuopen.com\/gdc-presentations\/2022\/GDC_Breaking_Down_The_World_Of_Athia.pdf. Accessed 1 Dec 2023"},{"key":"1036_CR25","volume-title":"The Black Swan: The impact of the highly improbable","author":"NN Taleb","year":"2007","unstructured":"Taleb NN (2007) The Black Swan: the impact of the highly improbable, 1st edn. Random House, New York","edition":"1"},{"key":"1036_CR26","unstructured":"Thompson A, Newburn C (2019) GPUDirect storage: a direct path between storage and GPU memory. Online https:\/\/developer.nvidia.com\/blog\/gpudirect-storage\/. Accessed 1 Dec 2023"},{"key":"1036_CR27","doi-asserted-by":"publisher","unstructured":"Usher W, Huang X, Petruzza S, Kumar S, Slattery SR, Reeve ST, Wang F, Johnson CR, Pascucci V (2021) Adaptive spatially aware I\/O for multiresolution particle data layouts. In: Proc IPDPS, pp 547\u2013556. https:\/\/doi.org\/10.1109\/IPDPS49936.2021.00063","DOI":"10.1109\/IPDPS49936.2021.00063"},{"key":"1036_CR28","unstructured":"Uralsky Y (2022) Accelerating load times for DirectX games and apps with GDeflate for DirectStorage. Online  https:\/\/developer.nvidia.com\/blog\/accelerating-load-times-for-directx-games-and-apps-with-gdeflate-for-directstorage\/. Accessed 1 Dec 2023"},{"key":"1036_CR29","doi-asserted-by":"publisher","unstructured":"Wiedemann M, Kranzlm\u00fcller D (2019) Statistical analysis of parallel data uploading using OpenGL. In: Proc Symp Parallel Graph Vis. https:\/\/doi.org\/10.2312\/pgv.20191114","DOI":"10.2312\/pgv.20191114"},{"key":"1036_CR30","doi-asserted-by":"publisher","unstructured":"Wald I, Knoll A, Johnson GP, Usher W, Pascucci V, Papka ME (2015) CPU ray tracing large particle data with balanced P-k-d trees. In: Proc VIS, pp 57\u201364. https:\/\/doi.org\/10.1109\/SciVis.2015.7429492","DOI":"10.1109\/SciVis.2015.7429492"},{"key":"1036_CR31","unstructured":"Yeung A (2020) DirectStorage is coming to PC. Online https:\/\/devblogs.microsoft.com\/directx\/directstorage-is-coming-to-pc\/. Accessed 1 Dec 2023"},{"key":"1036_CR32","unstructured":"Ziman D (2023) DirectStorage \u2013 Optimizing load-time and streaming. Talk at GDC 2023, available online https:\/\/gpuopen.com\/gdc-presentations\/2023\/GDC-2023-DirectStorage-optimizing-load-time-and-streaming.pdf. Accessed 1 Dec 2023"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-024-01036-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-024-01036-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-024-01036-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:18:27Z","timestamp":1742357907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-024-01036-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,28]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1036"],"URL":"https:\/\/doi.org\/10.1007\/s12650-024-01036-3","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"type":"print","value":"1343-8875"},{"type":"electronic","value":"1875-8975"}],"subject":[],"published":{"date-parts":[[2024,12,28]]},"assertion":[{"value":"5 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}