Shared memory tile-based vs hybrid memory GOP-based parallel algorithms for HEVC encoder

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

After the emergence of the new High Efficiency Video Coding standard, several strategies have been followed in order to take advantage of the parallel features available in it. Many of the parallelization approaches in the literature have been performed in the decoder side, aiming at achieving real-time decoding. However, the most complex part of the HEVC codec is the encoding side. In this paper, we perform a comparative analysis of two parallelization proposals. One of them is based on tiles, employing shared memory architectures and the other one is based on Groups Of Pictures, employing distributed shared memory architectures. The results show that good speed-ups are obtained for the tile-based proposal, especially for high resolution video sequences, but the scalability decreases for low resolution video sequences. The GOPbased proposal outperforms the tile-based proposal when the number of processes increases. This benefit grows up when low resolution video sequences are compressed.

Cite

CITATION STYLE

APA

Migallón, H., López-Granado, O., Galiano, V., Piñol, P., & Malumbres, M. P. (2016). Shared memory tile-based vs hybrid memory GOP-based parallel algorithms for HEVC encoder. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10048 LNCS, pp. 521–528). Springer Verlag. https://doi.org/10.1007/978-3-319-49583-5_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free