Kendall, WesleyPeterka, TomHuang, JianShen, Han-WeiRoss, RobertJames Ahrens and Kurt Debattista and Renato Pajarola2014-01-262014-01-262010978-3-905674-21-71727-348Xhttps://doi.org/10.2312/EGPGV/EGPGV10/101-110Radix-k was introduced in 2009 as a configurable image compositing algorithm. The ability to tune it by selecting k-values allows it to benefit more from pixel reduction and compression optimizations than its predecessors. This paper describes such optimizations in Radix-k, analyzes their effects, and demonstrates improved performance and scalability. In addition to bounding and run-length encoding pixels, k-value selection and load balance are regulated at run-time. Performance is systematically analyzed for an array of process counts, image sizes, and HPC and graphics clusters. Analyses are performed using compositing of synthetic images and also in the context of a complete volume renderer and scientific data. We demonstrate increased performance over binary swap and show that 64 megapixels can be composited at rates of 0.08 seconds, or 12.5 frames per second, at 32 K processes.Categories and Subject Descriptors (according to ACM CCS): I.3.1 [Hardware Architecture]: Parallel processing- I.3.2 [Graphics Systems]: Distributed / network graphics-I.3.7 [Three-Dimensional Graphics and Realism]: Raytracing-I.3.8 [Applications]: Image compositing-Volume rendering