2D Image Convolution using Three Parallel Programming Models on the Xeon Phi

11/27/2017
by   Ashkan Tousimojarad, et al.
0

Image convolution is widely used for sharpening, blurring and edge detection. In this paper, we review two common algorithms for convolving a 2D image by a separable kernel (filter). After optimising the naive codes using loop unrolling and SIMD vectorisation, we choose the algorithm with better performance as the baseline for parallelisation. We then compare the parallel performance of the optimised code using OpenMP, OpenCL and GPRM implementations on the Intel Xeon Phi. We also measure the effects of optimisation techniques and demonstrate how they affect both sequential and parallel performance. Apart from comparing the code complexity as well as the performance of the chosen parallel programming models, we investigate the impact of a parallelisation technique, task agglomeration in GPRM.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/28/2022

Black-Scholes Option Pricing on Intel CPUs and GPUs: Implementation on SYCL and Optimization Techniques

The Black-Scholes option pricing problem is one of the widely used finan...
research
09/11/2018

Parallel Separable 3D Convolution for Video and Volumetric Data Understanding

For video and volumetric data understanding, 3D convolution layers are w...
research
06/14/2021

Dilated filters for edge detection algorithms

Edges are a basic and fundamental feature in image processing, that are ...
research
06/07/2019

Lightweight Parallel Foundations: a model-compliant communication layer

We present the Lightweight Parallel Foundations (LPF), an interoperable ...
research
07/01/2018

Framework for the hybrid parallelisation of simulation codes

Writing efficient hybrid parallel code is tedious, error-prone, and requ...
research
04/01/2019

A Comparative Study of Asynchronous Many-Tasking Runtimes: Cilk, Charm++, ParalleX and AM++

We evaluate and compare four contemporary and emerging runtimes for high...
research
04/19/2021

Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms

Empirical studies are fundamental in assessing the effectiveness of impl...

Please sign up or login with your details

Forgot password? Click here to reset