Issue No. 01 - January (2012 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2011.24
M. Howison , Center for Comput. & Visualization, Brown Univ., Providence, RI, USA
E. W. Bethel , Visualization Group, Lawrence Berkeley Nat. Lab., Berkeley, CA, USA
H. Childs , Visualization Group, Lawrence Berkeley Nat. Lab., Berkeley, CA, USA
With the computing industry trending toward multi- and many-core processors, we study how a standard visualization algorithm, raycasting volume rendering, can benefit from a hybrid parallelism approach. Hybrid parallelism provides the best of both worlds: using distributed-memory parallelism across a large numbers of nodes increases available FLOPs and memory, while exploiting shared-memory parallelism among the cores within each node ensures that each node performs its portion of the larger calculation as efficiently as possible. We demonstrate results from weak and strong scaling studies, at levels of concurrency ranging up to 216,000, and with data sets as large as 12.2 trillion cells. The greatest benefit from hybrid parallelism lies in the communication portion of the algorithm, the dominant cost at higher levels of concurrency. We show that reducing the number of participants with a hybrid approach significantly improves performance.
Graphics processing unit, Rendering (computer graphics), Instruction sets, Parallel processing, Concurrent computing
M. Howison, E. W. Bethel and H. Childs, "Hybrid Parallelism for Volume Rendering on Large-, Multi-, and Many-Core Systems," in IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. 1, pp. 17-29, 2011.