Constant-bandwith supply for priority processing

M.M.H.P. Heuvel, van den, M.J. Holenderski, R.J. Bril, J.J. Lukkien

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)
34 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)873-881
JournalIEEE Transactions on Consumer Electronics
Volume57
Issue number2
DOIs
Publication statusPublished - 2011

Fingerprint

Servers
Processing
Bandwidth
Consumer electronics

Cite this

@article{52debb335a754466937a64babc23264f,
title = "Constant-bandwith supply for priority processing",
abstract = "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.",
author = "{Heuvel, van den}, M.M.H.P. and M.J. Holenderski and R.J. Bril and J.J. Lukkien",
year = "2011",
doi = "10.1109/TCE.2011.5955235",
language = "English",
volume = "57",
pages = "873--881",
journal = "IEEE Transactions on Consumer Electronics",
issn = "0098-3063",
publisher = "Institute of Electrical and Electronics Engineers",
number = "2",

}

Constant-bandwith supply for priority processing. / Heuvel, van den, M.M.H.P.; Holenderski, M.J.; Bril, R.J.; Lukkien, J.J.

In: IEEE Transactions on Consumer Electronics, Vol. 57, No. 2, 2011, p. 873-881.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Constant-bandwith supply for priority processing

AU - Heuvel, van den, M.M.H.P.

AU - Holenderski, M.J.

AU - Bril, R.J.

AU - Lukkien, J.J.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1109/TCE.2011.5955235

DO - 10.1109/TCE.2011.5955235

M3 - Article

VL - 57

SP - 873

EP - 881

JO - IEEE Transactions on Consumer Electronics

JF - IEEE Transactions on Consumer Electronics

SN - 0098-3063

IS - 2

ER -