.png){kind=icon}
返回
Time and space optimal data parallel volume rendering using permutation warping
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1997.1386.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a data parallel volume rendering algorithm that possesses numerous advantages over prior published solutions, Volume rendering is a three-dimensional graphics rendering algorithm that computes views of sampled medical and simulation data, but has beers much slower than other graphics algorithms because of the data sat sizes and the computational complexity. Our algorithm uses permutation warping to achieve linear speedup (run time is O(S/P) for P processors when P = O(S/log S) for S = n(3) samples), linear storage (O(S) for large data sets, arbitrary view directions, and high-quality filters. We derived a new processor permutation assignment of five passes tour prior known solution was eight passes), and a new parallel compositing technique that is essential for scaling linearly on machines that have more processors than view rays to process (P > n(2)). We show a speedup of 15.7 for a 16k processor over a 1k processor MasPar MP-1 (16 is linear) and two frames/second with a 128(3) volume and trilinear view reconstruction. In addition, we demonstrate volume sizes of 256(3) constant run time over angles 5 to 75 degrees, filter quality comparisons, and communication congestion of just 19 to 29%. (C) 1997 Academic Press.
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Impact of layer structure on performance of unpassivated AlGaN/GaN/SiC HEMTs层结构对未钝化AlGaN/GaN/SiC HEMTs性能的影响
PREAI
分享收藏
查看更多内容