Multi-Step Image Composition Approach for Sort-Last Massively Parallel Rendering

Nonaka, Jorji; Fujita, Masahiro; Ono, Kenji

doi:10.15748/jasse.2.108

Cited by 2 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides, Shift-based [22] image compositing method using shift permutation is based on Infiniband Fat-Tree interconnection network. Multi-Step [23] image compositing approach minimizes undesirable performance degradation to achieve scalability. TOD-Tree [24] (Task-Overlapped Direct send Tree) image compositing algorithm combines Direct Send and k-ary Tree to improve the entire performance based on hybrid MPI parallelism.…”

Section: The Othersmentioning

confidence: 99%

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

Hou

Wang

et al. 2021

Adv. Aerodyn.

View full text Add to dashboard Cite

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.

show abstract

Section: The Othersmentioning

confidence: 99%

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

Hou

Wang

et al. 2021

Adv. Aerodyn.

View full text Add to dashboard Cite

show abstract

“…Besides, Shift-based [16] image compositing method using shift permutation is based on Infiniband Fat-Tree interconnection network. Multi-Step [17] image compositing approach minimize undesirable performance degradation to achieve scalability. TOD-Tree [18] (Task-Overlapped Direct send Tree) image compositing algorithm combines Direct Send and k-ary Tree to improve the entire performance based on hybrid MPI parallelism.…”

Section: The Othersmentioning

confidence: 99%

mSwap: A Large-Scale Image-Compositing Method with Optimal m-ary Tree

Wang

et al. 2020

Preprint

View full text Add to dashboard Cite

With the increasing of computing ability, large-scale science simulations have been generating massive amounts of data in aerodynamics. Sort-last parallel rendering is a proven approach for large-scale science 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 science 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.

show abstract

Multi-Step Image Composition Approach for Sort-Last Massively Parallel Rendering

Cited by 2 publications

References 25 publications

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

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

mSwap: A Large-Scale Image-Compositing Method with Optimal m-ary Tree

Contact Info

Product

Resources

About