High Performance Parallel Summed-Area Table Kernels for Multi-core and Many-core Systems

A. Papatriantafyllou, D. Sacharidis:
"High Performance Parallel Summed-Area Table Kernels for Multi-core and Many-core Systems";
Vortrag: 22nd International European Conference on Parallel and Distributed Computing (Euro-Par 2016), Grenoble, France; 22.08.2016 - 26.08.2016; in:"Euro-Par 2016: Parallel Processing, 22nd International Conference on Parallel and Distributed Computing, Proceedings", P. Dutot, D. Trystram (Hrg.); Springer International Publishing, LNCS 9833 (2016), ISBN: 978-3-319-43658-6; S. 306 - 318.

[ Publication Database ]


The summed-area table (SAT), also known as integral image, is a data structure extensively used in computer graphics and vision for fast image filtering. The parallelization of its construction has been thoroughly investigated and many algorithms have been proposed for GPUs. Generally speaking, state-of-the-art methods cannot efficiently solve this problem in multi-core and many-core (Xeon Phi) systems due to cache misses, strided and/or remote memory accesses. This work proposes three novel cache-aware parallel SAT algorithms, which generalize parallel block-based prefix-sums algorithms. In addition, we discuss 2D matrix partitioning policies which play an important role in the efficient operation of the cache subsystem. The combination of a SAT algorithm and a partition is manually tuned according to the matrix layout and the number of threads. Experimental evaluation of our algorithms on two NUMA systems and Intel´s Xeon Phi, and for three datatypes (int, float, double) by utilizing all system cores, shows, in all experimental settings, better performance compared to the best known CPU and GPU approaches (up to 4.55× on NUMA and 2.8× on Xeon Phi).