mSwap: a large-scale image-compositing method with optimal m-ary tree  

作　　者：Min Hou Chongke Bi Fang Wang Liang Deng Gang Zheng Xiangfei Meng 

机构地区：[1]College of Intelligence and Computing,Tianjin University,Tianjin,China [2]Computational Aerodynamics Institute,China Aerodynamics Research and Development Center,Mianyang,China [3]National Supercomputer Center in Tianjin,Tianjin,China.

出　　处：《Advances in Aerodynamics》2021年第1期49-65,共17页空气动力学进展（英文）

基　　金：supported by the National Numerical Windtunnel Project,partially by the National Natural Science Foundation of China under Grant No.61702360.

摘　　要：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 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]