dc.contributor.author | Wald, Ingo | |
dc.contributor.author | Jaroš, Milan | |
dc.contributor.author | Zellmann, Stefan | |
dc.date.accessioned | 2024-03-05T06:00:20Z | |
dc.date.available | 2024-03-05T06:00:20Z | |
dc.date.issued | 2023 | |
dc.identifier.citation | Computer Graphics Forum. 2023. | cs |
dc.identifier.issn | 0167-7055 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | http://hdl.handle.net/10084/152280 | |
dc.description.abstract | We propose a novel approach to data-parallel path tracing on single-node/multi-GPU hardware that builds on ray forwarding,but which aims—above all else—at generality and practicability. We do this byavoidingany attempts at reducing the numberof traces or forward operations performed, and instead focus on always using all GPUs’ aggregate compute and bandwidth toeffectively trace each ray on every GPU. We show that—counter-intuitively—this is both feasible and desirable; and that whenrun on typical data-center/cloud hardware, the resulting framework not only achieves good performance and scalability, butalso comes with significantly fewer limitations, assumptions, or preprocessing requirements than existing techniques. | cs |
dc.language.iso | en | cs |
dc.publisher | Wiley | cs |
dc.relation.ispartofseries | Computer Graphics Forum | cs |
dc.relation.uri | https://doi.org/10.1111/cgf.14873 | cs |
dc.rights | © 2023 Eurographics - The European Associationfor Computer Graphics and John Wiley & Sons Ltd. | cs |
dc.title | Data parallel multi-GPU path tracing using ray queue cycling | cs |
dc.type | article | cs |
dc.identifier.doi | 10.1111/cgf.14873 | |
dc.type.status | Peer-reviewed | cs |
dc.description.source | Web of Science | cs |
dc.identifier.wos | 001041122900001 | |