High performance predictable histogramming on gpus: exploring and evaluating algorithm trade-offs

Graphics Processing Units (GPUs) are suitable for highly data parallel algorithms such as image processing, due to their massive parallel processing power. Many image pro-cessing applications use the histogramming algorithm, which fills a set of bins according to the frequency of occurrence of pixel values taken from an input image. Histogramming has been mapped on a GPU prior to this work. Although significant research effort has been spent in optimizing the mapping, we show that the performance and performance predictability of existing methods can still be improved. In this paper, we present two novel histogram-ming methods, both achieving a higher performance and predictability than existing methods. We discuss perfor-mance limitations for both novel methods by exploring al-gorithm trade-offs. Both the novel and the existing histogramming methods are evaluated for performance. The first novel method gives an average performance increase of 33 % over existing meth-ods for non-synthetic benchmarks. The second novel method gives an average performance increase of 56 % over existing methods and guarantees to be fully data independent. While the second method is specifically designed for newer GPU architectures, the first method is also suitable for older ar-chitectures