.png){kind=icon}
.png){kind=icon}
Return
Constant Bandwidth Supply for Priority Processing
.png){kind=icon}
OA
AI
DOI：10.1109/TCE.2011.5955235.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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).
Keywords:
scalable video algorithms
resource management
reservations
dynamic resource allocation
Journal
IF:
10.9
Papers:
5.1K
Citations:
6.8K