Title: | A Resource Allocation Algorithm for a History-Aware Frame Graph |
Authors: | Sandu, Roman Shcherbakov, Alexandr |
Citation: | Journal of WSCG. 2023, vol. 31, no. 1-2, p. 63-70. |
Issue Date: | 2023 |
Publisher: | Václav Skala - UNION Agency |
Document type: | článek article |
URI: | http://hdl.handle.net/11025/54285 |
ISSN: | 1213 – 6972 (hard copy) 1213 – 6980 (CD-ROM) 1213 – 6964 (on-line) |
Keywords: | rámový graf;dynamické přidělování úložiště;aliasing zdrojů;opětovné použití paměti gpu;dx12;vulkan |
Keywords in different language: | frame graph;dynamic storage allocation;resource aliasing;gpu memory reuse;dx12;vulkan |
Abstract in different language: | We consider the problem of memory consumption by a real-time GPU-accelerated graphical application. A history of a resource is defined for a particular frame to be the final contents of such a resource at the end of the previ ous frame. When organizing a graphical application using a frame rendering graph approach, it makes sense to implement automatic serving of resource history read requests of nodes. In absence of history resource requests, allocating resources for a fixed frame graph is the classic problem of dynamic storage allocation (DSA). In this paper, we formulate a generalization of DSA that enables memory reuse for resources with history requests and provide a practical approximate algorithm for solving it. |
Rights: | © Václav Skala - UNION Agency |
Appears in Collections: | Volume 31, Number 1-2 (2023) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
!_2023-Journal_WSCG-73-80.pdf | Plný text | 1,13 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/54285
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.