Parallelization of Full Search Motion Estimation Algorithm for Parallel and Distributed Platforms

  • Authors:
  • Eduarda Monteiro;Bruno Vizzotto;Cláudio Diniz;Marilena Maule;Bruno Zatt;Sergio Bampi

  • Affiliations:
  • Informatics Institute, PPGC, PGMICRO, Federal University of Rio Grande do Sul (UFRGS), Porto Alegre, Brazil;Informatics Institute, PPGC, PGMICRO, Federal University of Rio Grande do Sul (UFRGS), Porto Alegre, Brazil;Informatics Institute, PPGC, PGMICRO, Federal University of Rio Grande do Sul (UFRGS), Porto Alegre, Brazil;Informatics Institute, PPGC, PGMICRO, Federal University of Rio Grande do Sul (UFRGS), Porto Alegre, Brazil;Informatics Institute, PPGC, PGMICRO, Federal University of Rio Grande do Sul (UFRGS), Porto Alegre, Brazil;Informatics Institute, PPGC, PGMICRO, Federal University of Rio Grande do Sul (UFRGS), Porto Alegre, Brazil

  • Venue:
  • International Journal of Parallel Programming
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work presents an efficient method to map the Full Search algorithm for Motion Estimation (ME) onto General Purpose Graphic Processing Unit (GPGPU) architectures using Compute Unified Device Architecture (CUDA) programming model. Our method jointly exploits the massive parallelism available in current GPGPU devices and the parallelism potential of Full Search algorithm. Our main goal is to evaluate the feasibility of video codecs implementation using GPGPUs and its advantages and drawbacks compared to other platforms. Therefore, for comparison reasons, three solutions were developed using distinct programming paradigms for distinct underlying hardware architectures: (i) a sequential solution for general-purpose processor (GPP); (ii) a parallel solution for multi-core GPP using OpenMP library; (iii) a distributed solution for cluster/grid machines using Message Passing Interface (MPI) library. The CUDA-based solution for GPGPUs achieves speed-up compatible to the indicated by the theoretical model for different search areas. Our GPGPU Full Search Motion Estimation provides 2脳, 20脳 and 1664脳 speed-up when compared to MPI, OpenMP and sequential implementations, respectively. Compared to state-of-the-art, our solution reaches up to 17脳 speed-up.