]. Chpvdg07, H. E. Chan, and P. A. Van-de-geijn-r, Collective communication: theory, practice, and experience, Concurr. Comput. : Pract. Exper, vol.19, pp.1749-1783, 2007.

. [. Mion-c and . Filbois-a, Cots cluster-based sort-last rendering: performance evaluation and pipelined implementation, Visualization, 2005. VIS 05. IEEE (oct. 2005), pp.111-118, 2005.

H. , H. T. Schneider-t, and . Lumsdaine-a, Multistage switches are not crossbars: Effects of static routing in highperformance networks, Cluster Computing IEEE International Conference on, pp.116-125, 2008.

[. J. Kerbyson-d, L. M. , and J. G. , INFINIBAND ROUTING TABLE OPTIMIZATIONS FOR SCIENTIFIC APPLICATIONS, Parallel Processing Letters, vol.18, issue.04, pp.589-608, 2008.
DOI : 10.1142/S0129626408003582

]. Lei85 and . E. Leiserson-c, Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Trans. Comput, vol.34, pp.892-901, 1985.

X. Cavin, &. O. Demengeonmcef94, . S. Molnar, E. D. Cox-m, and . Fuchs-h, Shift-Based Parallel Image Compositing A sorting classification of parallel rendering, Computer Graphics and Applications, vol.14, issue.4, pp.23-32, 1994.

[. , K. W. Peterka-t, and . Huang-j, An image compositing solution at scale, Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, pp.1-25, 2011.

]. Moo09 and . A. Moody, Contention-free routing for shift-based communication in MPI applications on large-scale InfiniBand clusters, 2009.

M. S. Painter-j, . D. Hansen-c, and . F. Krogh-m, Parallel volume rendering using binary-swap compositing, IEEE Comput. Graph. Appl, pp.14-59, 1994.

]. Neu94 and . Neumann-u, Communication costs for parallel volume-rendering algorithms Computer Graphics and Applications, 1994.

[. S. Ibel-m, . Das-s, and . Kumar-m, On generalized fat trees, Parallel Processing Symposium Proceedings., 9th International, pp.37-44, 1995.

G. T. Pgr-*-09-]-peterka, R. R. Shen-h.-w, and . Thakur-r, A configurable algorithm for parallel imagecompositing applications, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis SC '09, pp.1-4, 2009.

P. F. Vanneschi-m, k-ary n-trees: high performance networks for massively parallel architectures, Parallel Processing Symposium, 1997. Proceedings., 11th International, 1997.

]. Zah10 and . E. Zahavi, D-Mod-K routing providing non-blocking traffic for shift permutations on real life fat trees, 2010.

J. [. Kerbyson-d and . Lang-m, Optimized infiniband fat-tree routing for shift all-to-all communication patterns, Concurr. Comput. : Pract. Exper, vol.22, pp.217-231, 2010.