Improving Divide-and-Conquer Ray-Tracing Using a Parallel Approach

Cícero A. L. Pahins, C. Pozzer
{"title":"Improving Divide-and-Conquer Ray-Tracing Using a Parallel Approach","authors":"Cícero A. L. Pahins, C. Pozzer","doi":"10.1109/SIBGRAPI.2014.32","DOIUrl":null,"url":null,"abstract":"This paper presents a new Divide-and-Conquer Ray-Tracing (DACRT) algorithm that is designed to perform on multi-core processors. This new algorithm proposes a parallel and generic scheme that, without the use of any data structure for spatial subdivision, maintains memory management minimal and deterministic. Initially, the scene is divided into sub-scenes and those uniformly distributed across available hardware resources, processing each sub-scene individually. After, an iterative step to ensure the correct results is performed until the final frame is obtained. Results show that our algorithm is up to 2.4x times faster than the original DACRT in a common quad-core processor setup, allowing very high interactive frame rates in well-known benchmark scenes.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBGRAPI.2014.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper presents a new Divide-and-Conquer Ray-Tracing (DACRT) algorithm that is designed to perform on multi-core processors. This new algorithm proposes a parallel and generic scheme that, without the use of any data structure for spatial subdivision, maintains memory management minimal and deterministic. Initially, the scene is divided into sub-scenes and those uniformly distributed across available hardware resources, processing each sub-scene individually. After, an iterative step to ensure the correct results is performed until the final frame is obtained. Results show that our algorithm is up to 2.4x times faster than the original DACRT in a common quad-core processor setup, allowing very high interactive frame rates in well-known benchmark scenes.
使用并行方法改进分治光线跟踪
本文提出了一种适用于多核处理器的分治光线追踪算法。该算法提出了一种并行的通用方案,在不使用任何数据结构进行空间细分的情况下,保持了内存管理最小化和确定性。首先,将场景划分为子场景和均匀分布在可用硬件资源上的子场景,分别对每个子场景进行处理。之后,执行一个迭代步骤以确保正确的结果,直到获得最终帧。结果表明,在常见的四核处理器设置下,我们的算法比原始的DACRT快2.4倍,可以在众所周知的基准场景中实现非常高的交互帧率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信