By Topic

Dynamic resource allocation for real-time priority processing applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
van den Heuvel, M.M.H.P. ; Eindhoven Univ. of Technol., Eindhoven, Netherlands ; Bril, R.J. ; Schiemenz, S. ; Hentschel, C.

Flexible signal processing on programmable platforms are increasingly important for consumer electronic applications and others. Scalable video algorithms (SVAs) using novel priority processing can guarantee real-time performance on programmable platforms even with limited resources. Dynamic resource allocation is required to maximize the overall output quality of independent, competing priority processing algorithms that are executed on a shared platform. In this paper, we describe basic mechanisms for dynamic resource allocation and compare the performance of different implementations.

Published in:

Consumer Electronics (ICCE), 2010 Digest of Technical Papers International Conference on

Date of Conference:

9-13 Jan. 2010