Constant Bandwidth Supply for Priority Processing

Martijn M. H. P. van den Heuvel

doi:10.1109/TCE.2011.5955235

Constant Bandwidth Supply for Priority Processing

2011-05-01

4

OA

AI

M

Martijn M. H. P. van den Heuvel *

DOI：10.1109/TCE.2011.5955235

原文链接

原文求助

摘要

En 中文

Today's consumer electronic devices feature multiple applications which have to share scarcely available resources. We consider a priority-processing-based video application, which comprises multiple scalable video algorithms (SVAs) that are executed on a shared, virtual platform. This application is given a guaranteed processor share by means of a constant-bandwidth server (CBS). A decision scheduler distributes the assigned processor share among the SVAs on a time-slot basis, with the aim to maximize their overall output quality. To correctly distribute this processor share based on fixed-sized time slots, we introduce the concept of a virtual timer. This timer only advances when its associated virtual platform is executing. Because priority processing can guarantee real-time performance even under fluctuating load, we apply a resource reclaiming mechanism to our CBS which makes it possible to efficiently exploit spare processor time(1).

Keyword:

scalable video algorithms

resource management

reservations

dynamic resource allocation

Constant Bandwidth Supply for Priority Processing

摘要

期刊

机构