scholarly journals Accelerated entry point search algorithm for real-time ray-tracing

Author(s):  
Colin Fowler ◽  
Steven Collins ◽  
Michael Manzke
2021 ◽  
Vol 40 (2) ◽  
pp. 79-90
Author(s):  
Zheng Zeng ◽  
Shiqiu Liu ◽  
Jinglei Yang ◽  
Lu Wang ◽  
Ling‐Qi Yan
Keyword(s):  

2020 ◽  
Vol 39 (4) ◽  
Author(s):  
Benedikt Bitterli ◽  
Chris Wyman ◽  
Matt Pharr ◽  
Peter Shirley ◽  
Aaron Lefohn ◽  
...  
Keyword(s):  

Author(s):  
Philipp Slusallek ◽  
Peter Shirley ◽  
William Mark ◽  
Gordon Stoll ◽  
Ingo Wald
Keyword(s):  

Author(s):  
Hongli Wang ◽  
Bin Guo ◽  
Jiaqi Liu ◽  
Sicong Liu ◽  
Yungang Wu ◽  
...  

Deep Neural Networks (DNNs) have made massive progress in many fields and deploying DNNs on end devices has become an emerging trend to make intelligence closer to users. However, it is challenging to deploy large-scale and computation-intensive DNNs on resource-constrained end devices due to their small size and lightweight. To this end, model partition, which aims to partition DNNs into multiple parts to realize the collaborative computing of multiple devices, has received extensive research attention. To find the optimal partition, most existing approaches need to run from scratch under given resource constraints. However, they ignore that resources of devices (e.g., storage, battery power), and performance requirements (e.g., inference latency), are often continuously changing, making the optimal partition solution change constantly during processing. Therefore, it is very important to reduce the tuning latency of model partition to realize the real-time adaption under the changing processing context. To address these problems, we propose the Context-aware Adaptive Surgery (CAS) framework to actively perceive the changing processing context, and adaptively find the appropriate partition solution in real-time. Specifically, we construct the partition state graph to comprehensively model different partition solutions of DNNs by import context resources. Then "the neighbor effect" is proposed, which provides the heuristic rule for the search process. When the processing context changes, CAS adopts the runtime search algorithm, Graph-based Adaptive DNN Surgery (GADS), to quickly find the appropriate partition that satisfies resource constraints under the guidance of the neighbor effect. The experimental results show that CAS realizes adaptively rapid tuning of the model partition solutions in 10ms scale even for large DNNs (2.25x to 221.7x search time improvement than the state-of-the-art researches), and the total inference latency still keeps the same level with baselines.


2017 ◽  
Vol 50 (4) ◽  
pp. 1-41 ◽  
Author(s):  
Yangdong Deng ◽  
Yufei Ni ◽  
Zonghui Li ◽  
Shuai Mu ◽  
Wenjun Zhang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document