A comparison of two parallel algorithms using predictive load balancing for video compression

Authors:
Carlos-Julian Genis-Triana;Abelardo Rodriguez-Leon;Rafael Rivera-Lopez
Affiliations:
Departamento de Sistemas y Computación, Instituto Tecnológico de Veracruz, Veracruz, Ver., México;Departamento de Sistemas y Computación, Instituto Tecnológico de Veracruz, Veracruz, Ver., México;Departamento de Sistemas y Computación, Instituto Tecnológico de Veracruz, Veracruz, Ver., México
Venue:
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
Year:
2011

Citing 3
Cited 0

The design of a standard message passing interface for distributed memory concurrent computers

Parallel Computing - Special issue: message passing interfaces
A Parallel Implementation of H.26L Video Encoder (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Overview of the H.264/AVC video coding standard

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows a comparison of two parallel algorithms for video compression that use predictive load balancing. One algorithm uses an exhaustive estimation of movements and the other one has an adaptive scheme. These algorithms are based on the H.264 standard of video compression and they are constructed using a Group of Pictures (GOP) level of parallelization. These algorithms are evaluated to determine their speedup when they are executed with a different number of nodes in a cluster processing videos of different types and resolutions. This evaluation is used for determining the equation that is used for calculating the number of nodes required to obtain a video compression in real time.