Grosset, A. V. PascalKnoll, AaronHansen, CharlesEnrico Gobbetti and Wes Bethel2016-06-092016-06-092016978-3-03868-006-21727-348Xhttps://doi.org/10.2312/pgv.20161184https://diglib.eg.org:443/handle/10Algorithms for sort-last parallel volume rendering on large distributed memory machines usually divide a dataset equally across all nodes for rendering. Depending on the features that a user wants to see in a dataset, all the nodes will rarely finish rendering at the same time. Existing compositing algorithms do not often take this into consideration, which can lead to significant delays when nodes that are compositing wait for other nodes that are still rendering. In this paper, we present an image compositing algorithm that uses spatial and temporal awareness to dynamically schedule the exchange of regions in an image and progressively composite images as they become available. Running on the Edison supercomputer at NERSC, we show that a scheduler-based algorithm with awareness of the spatial contribution from each rendering node can outperform traditional image compositing algorithms.I.3.1 [Computer Graphics]Hardware ArchitectureParallel processingI.3.2 [Computer Graphics]Graphics SystemsDistributed/network graphics10.2312/pgv.2016118479-88