Title: | GPU Cache Flush Minimization In Render Graph Systems |
Authors: | Sandu, Roman Shcherbakov, Alexandr |
Citation: | Journal of WSCG. 2024, vol. 32, no. 1-2, p. 71-78. |
Issue Date: | 2024 |
Publisher: | Václav Skala - UNION Agency |
Document type: | článek article |
URI: | http://hdl.handle.net/11025/57346 |
ISSN: | 1213 – 6972 1213 – 6980 (CD-ROM) 1213 – 6964 (on-line) |
Keywords: | vykreslení grafu;GPU;bariéra;rámečkový graf;render pass;Vulkan;dx12;renderer založený na dlaždicích |
Keywords in different language: | frame graph;render graph;GPU;barrier;render pass;Vulkan;dx12;tile based deferred renderer |
Abstract in different language: | Modern graphics APIs expose control over the infamously non-coherent GPU caches to application programmers through the mechanisms of pipeline barriers and render passes. A developer is then asked to group together their GPU computations based on memory access patterns such that cache flushes and invalidations are minimized, but render graph systems enable automation of this process. In this paper, we study the problem of finding an optimal execution order for a frame graph to minimize the amount of render pass breaks, which in turn minimizes cache control operations. We formulate and analyze a novel NP-complete problem MLGP and use it to propose an approach to render pass merging that results in 30% less render pass breaks when compared to previous works. |
Rights: | © Václav Skala - UNION Agency © Václav Skala - UNION Agency |
Appears in Collections: | Volume 32, number 1-2 (2024) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
B43-2024.pdf | Plný text | 742,39 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/57346
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.