期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
mSwap: a large-scale image-compositing method with optimal m-ary tree
1
作者 Min Hou Chongke Bi +3 位作者 Fang Wang Liang Deng Gang Zheng Xiangfei Meng 《Advances in Aerodynamics》 2021年第1期49-65,共17页
With the increasing of computing ability,large-scale simulations have been generating massive amounts of data in aerodynamics.Sort-last parallel rendering is the most classical image compositing method for large-scale... With the increasing of computing ability,large-scale simulations have been generating massive amounts of data in aerodynamics.Sort-last parallel rendering is the most classical image compositing method for large-scale scientific visualization.However,in the stage of image compositing,the sort-last method may suffer from scalability problem on large-scale processors.Existing image compositing algorithms tend to perform well in certain situations.For instance,Direct Send is well on small and medium scale;Radix-k gets well performance only when the k-value is appropriate and so on.In this paper,we propose a novel method named mSwap for scientific visualization in aerodynamics,which uses the best scale of processors to make sure its performance at the best.mSwap groups the processors that we can use with a(m,k)table,which records the best combination of m(the number of processors in subgroup of each group)and k(the number of processors in each group).Then in each group,using a m-ary tree to composite the image for reducing the communication of processors.Finally,the image is composited between different groups to generate the final image.The performance and scalability of our mSwap method is demonstrated through experiments with thousands of processors. 展开更多
关键词 Parallel rendering Sort-last Image compositing mswap m-ary tree
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部