Dynamically Scheduled Region-Based Image Compositing
Compositing
DOI:
10.2312/pgv.20161184
Publication Date:
2016-06-30
AUTHORS (3)
ABSTRACT
Algorithms for sort-last parallel volume rendering on large distributed memory machines usually divide a dataset equally across all nodes rendering. Depending the features that user wants to see in dataset, will rarely finish at same time. Existing compositing algorithms do not often take this into consideration, which can lead significant delays when are wait other still In paper, we present an image algorithm uses spatial and temporal awareness dynamically schedule exchange of regions progressively composite images as they become available. Running Edison supercomputer NERSC, show scheduler-based with contribution from each node outperform traditional algorithms.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....