In this paper we review and summarize research results concerning video encoding parallelization, with a primary focus on medium and fine grained methods that operate at block or inner block levels. Taxonomies are illustrated wherever applicable with emphasis to scalability issues. Given the reported results, we turn our attention into the problem of allocating resources (processing cores) to parallel tasks performed by the encoder so as to achieve high speedup. We advocate that a parallelization scheme taking advantage of independently coded areas (e.g., tiles), wavefront parallelism within each area and inner block parallelism at the CTU compression level, can achieve significantly higher parallelization degree compared to standalone methods. An algorithm is then proposed that takes resource allocation decisions at all the aforementioned levels. Both the proposed algorithm and standalone representative approaches from the relevant literature are evaluated in terms of scalability using CTU coding times recorded by CU split parallelism in VTM 6.2. Results show that the potential scalability of the proposed scheme surpasses alternatives.
Tiles and slices provide different frame partitioning options. While they can both be used for video coding parallelization, tiles offer better scalability to the number of available processors, especially as far as video quality is concerned, e.g., in the HEVC case. On the other hand, slices can be useful in video transmission. Since slices can be defined as a series of consecutive (raster order) tiles, properly balancing them can lead to viable trade-offs between parallelization and transmission requirements. In this paper we study the combined problem of tile and slice partitioning with the goals of maximizing the achievable parallelism speedup, while minimizing size difference among slices. These goals might conflict with each other, while producing multiple Pareto frontier solutions can introduce additional time overhead. For these reasons, we map the two-function optimization problem to a single one, using constant weighting and develop algorithms that perform tile resizing and slice definition so as to optimize the composite target function. Experiments with common class A and class B test sequences and the reference HEVC encoder (HM), reveal that compared to static uniform tile partitioning and to literature alternatives that resize tiles in order to increase parallelization speedup, the proposed algorithm achieves considerable gains in slice balancing, while also improving speedup over the static approach. Furthermore, these performance merits come with negligible overhead to the encoding process.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.