Title :
An image compositing solution at scale
Author :
Moreland, Kenneth ; Kendall, Wesley ; Peterka, Tom ; Huang, Jian
Author_Institution :
Sandia Nat. Labs., Albuquerque, NM, USA
Abstract :
The only proven method for performing distributed-memory parallel rendering at large scales, tens of thousands of nodes, is a class of algorithms called sort last. The fundamental operation of sort-last parallel rendering is an image composite, which combines a collection of images generated independently on each node into a single blended image. Over the years numerous image compositing algorithms have been proposed as well as several enhancements and rendering modes to these core algorithms. However, the testing of these image compositing algorithms has been with an arbitrary set of enhancements, if any are applied at all. In this paper we take a leading production-quality image compositing framework, IceT, and use it as a testing frame work for the leading image compositing algorithms of today. As we scale IceT to ever increasing job sizes, we consider the image compositing systems holistically, incorporate numerous optimizations, and discover several improvements to the process never considered before. We conclude by demonstrating our solution on 64K cores of the Intrepid Blue Gene/P at Argonne National Laboratories.
Keywords :
distributed memory systems; parallel processing; rendering (computer graphics); IceT; distributed-memory parallel rendering; image composite; image compositing algorithm; image compositing solution; image compositing systems; production-quality image compositing framework; sort-last parallel rendering; Encoding; Geometry; Image coding; Optimization; Partitioning algorithms; Rendering (computer graphics); Software algorithms; Image compositing; Parallel scientific visualization;
Conference_Titel :
High Performance Computing, Networking, Storage and Analysis (SC), 2011 International Conference for
Conference_Location :
Seatle, WA
Electronic_ISBN :
978-1-4503-0771-0