首页> 外文会议> >Efficient compositing methods for the sort-last-sparse parallel volume rendering system on distributed memory multicomputers
【24h】

Efficient compositing methods for the sort-last-sparse parallel volume rendering system on distributed memory multicomputers

机译:分布式内存多计算机上排序最稀疏的并行体绘制系统的有效合成方法

获取原文

摘要

In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, as the number of processors increases, in the rendering phase, we can get a good speedup because each processor renders images locally without communicating with other processors. However, in the compositing phase, a processor has to exchange local images with other processors. When the number of processors is over a threshold, the image compositing time becomes a bottleneck. In this paper, we proposed three compositing methods, the binary-swap with bounding rectangle method, the binary-swap with run-length encoding and static load-balancing method, and the binary-swap with bounding rectangle and run-length encoding method, to efficiently reduce the compositing time in the sort-last-sparse parallel volume rendering system on distributed memory multicomputers. The proposed methods were implemented on an SP2 parallel machine along with the binary-swap compositing method. The experimental results show that the binary-swap with bounding rectangle and run-length encoding method has the best performance among the four methods.
机译:在分布式内存多计算机上排序最稀疏的并行体积渲染系统中,随着处理器数量的增加,在渲染阶段,我们可以获得很好的加速,因为每个处理器都在本地渲染图像而无需与其他处理器通信。但是,在合成阶段,处理器必须与其他处理器交换本地图像。当处理器数量超过阈值时,图像合成时间成为瓶颈。在本文中,我们提出了三种合成方法:带边界矩形的二进制交换,具有游程长度编码和静态负载平衡方法的二进制交换,以及具有边界矩形和游程长度编码方法的二进制交换,以有效地减少分布式内存多计算机上排序最稀疏的并行体绘制系统中的合成时间。所提出的方法与二进制交换合成方法一起在SP2并行机上实现。实验结果表明,在四种方法中,具有边界矩形和游程长度编码方法的二进制交换具有最佳性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号