MergeTree: a HLBVH constructor for mobile systems

T. Viitanen, M. Koskela, P. Jääskeläinen, Heikki O. Kultala, J. Takala
{"title":"MergeTree: a HLBVH constructor for mobile systems","authors":"T. Viitanen, M. Koskela, P. Jääskeläinen, Heikki O. Kultala, J. Takala","doi":"10.1145/2820903.2820916","DOIUrl":null,"url":null,"abstract":"Powerful hardware accelerators have been recently developed that put interactive ray-tracing even in the reach of mobile devices. However, supplying the rendering unit with up-to date acceleration trees remains difficult, so the rendered scenes are mostly static. The restricted memory bandwidth of a mobile device is a challenge with applying GPU-based tree construction algorithms. This paper describes MergeTree, a BVH tree constructor architecture based on the HLBVH algorithm, whose main features of interest are a streaming hierarchy emitter, an external sorting algorithm with provably minimal memory usage, and a hardware priority queue used to accelerate the external sort. In simulations, the resulting unit is faster by a factor of three than the state-of-the art hardware builder based on the binned SAH sweep algorithm.","PeriodicalId":21720,"journal":{"name":"SIGGRAPH Asia 2015 Technical Briefs","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGGRAPH Asia 2015 Technical Briefs","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2820903.2820916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Powerful hardware accelerators have been recently developed that put interactive ray-tracing even in the reach of mobile devices. However, supplying the rendering unit with up-to date acceleration trees remains difficult, so the rendered scenes are mostly static. The restricted memory bandwidth of a mobile device is a challenge with applying GPU-based tree construction algorithms. This paper describes MergeTree, a BVH tree constructor architecture based on the HLBVH algorithm, whose main features of interest are a streaming hierarchy emitter, an external sorting algorithm with provably minimal memory usage, and a hardware priority queue used to accelerate the external sort. In simulations, the resulting unit is faster by a factor of three than the state-of-the art hardware builder based on the binned SAH sweep algorithm.
一个用于移动系统的HLBVH构造函数
最近已经开发出强大的硬件加速器,甚至可以在移动设备上实现交互式光线追踪。然而,为渲染单元提供最新的加速树仍然很困难,所以渲染的场景大多是静态的。移动设备有限的内存带宽是应用基于gpu的树构造算法的一个挑战。本文介绍了一种基于HLBVH算法的BVH树构造器体系结构MergeTree,其主要特点是流层次结构发射器、可证明内存占用最小的外部排序算法和用于加速外部排序的硬件优先级队列。在模拟中,生成的单元比基于分箱SAH扫描算法的最先进的硬件构建器快三倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信