Evaluation of heterogeneous scheduling algorithms for wavefront and tile parallelism in video coding
Date
2019Language
en
Sujet
Résumé
Video is by far the “biggest” Big Data, stretching network and storage capacity to their limits. To handle the situation, video compression has been an active field of study for many years, producing output of huge commercial interest, e.g., MPEG-2 and DVD. However, video coding is a computationally expensive process and for this reason, parallelization was proposed at various granularity levels. Of particular interest, are block level methods implemented in HEVC (High Efficiency Video Coding) which was designed to be the successor of H.264/AVC for the 4K era. Parallelization in HEVC is supported by the following three modes: slices, tiles and wavefront. While considerable research was conducted on the parallelization options of HEVC, it was focused on the case of homogeneous processors. In this paper we consider video coding parallelization when the processing elements are heterogeneous. In particular, we focus on wavefront and tile parallelism and measure the performance of scheduling schemes for the induced subtasks. Through simulation experiments with dataset values obtained from common benchmark sequences, we conclude on the relevant merits of the evaluated scheduling algorithms. © Springer Nature Switzerland AG 2019.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Evaluating the cost of emissions in a pool-based electricity market
Andrianesis P., Biskas P., Liberopoulos G. (2021)This paper proposes a methodology that quantifies the impact of emissions cost on the electricity price, the generation scheduling outcome, and the overall emissions in a pool-based electricity market. It employs a mid-term ... -
Online Algorithms for the Interval Scheduling Problem in the Cloud: Affinity Pair Threshold Based Approaches
Oikonomou P., Tziritas N., Loukopoulos T., Theodoropoulos G., Hanai M., Khan S.U. (2022)In the interval scheduling problem, jobs have known start and end times (referred to as job intervals) and must be assigned to processing nodes for their whole duration. Although the problem originally stems from the ... -
Bin Packing Heuristics for the Multiple Workflow Scheduling Problem
Pappas N., Oikonomou P., Tziritas N., Kolomvatsos K., Loukopoulos T. (2021)In the multiple workflow scheduling problem a set of workflows has to be scheduled concurrently onto system's available resources. Workflows exhibit different characteristics e.g., topological structure, size and ...