Dynamic Resource Allocation in Multimedia Applications
I am a researcher at the System Architecture and Networks (SAN) group at the Eindhoven University of Technology (TU/e) This page describes my master project, finished as of July 2009.
by: Martijn van den Heuvel
Contact:email: m.m.h.p.v.d.heuvel (at) tue.nl
web: [Main page]
Scalable video algorithms using novel priority processing can guarantee real-time performance on programmable platforms even with limited resources. According to the priority processing principle, as developed at BTU, scalable video algorithms follows a priority order. Hence, important image parts are processed first and less important parts are subsequently processed in a decreasing order of importance. After creation of an initial output by a basic function, processing can be terminated at an arbitrary moment in time, yielding the best output for given resources. This characteristic of priority processing allowing preliminary termination, requires appropriate mechanisms.
Dynamic Resource Allocation
Dynamic resource allocation is required to maximize the overall output quality of competing, independent priority-processing algorithms that are executed on a shared platform. To distribute the available processor time, among these competing algorithms, a scheduling policy has been developed. This policy aims at maximizing the total progress of the algorithms on a frame-basis. Allocation of processor resources to priority processing algorithms can be established by means of different mechanisms.
The allocation of the processor requires monitoring mechanisms to provide the control component with information about the progress of the individual algorithms relative to the amount of consumed time. Based on this information, the control component decides which algorithm to allocate the processor for a fixed time slice.
The priority processing applications are prototyped in a Matlab/Simulink environment and executed on a multi-core platform under Microsoft Windows XP. This platform is used to compare the performance of different implementations of the above described mechanisms.
- Investigate which supplies are needed for preliminary termination of priority processing.
- Investigate efficient allocation of resources for competing, independent scalable priority-processing algorithms.
- Graduation Supervisor: Reinder Bril
- Graduation Tutor: Mike Holenderski
- Internship Supervisor: Christian Hentschel
- Internship Tutor: Stefan Schiemenz
- External committee member: Pieter Cuijpers
- Master Thesis: Dynamic Resource Allocation in Multimedia Applications
- Presentation at BTU (08-07-2009): Dynamic Resource Allocation for Priority Processing
- Presentation at TU/e (23-07-2009): Dynamic Resource Allocation for Priority Processing
- Related publications:
- M.M.H.P. van den Heuvel, R.J. Bril, S. Schiemenz and C. Hentschel, Dynamic Resource Allocation for Real-time Priority Processing Applications, IEEE Transactions on Consumer Electronics (TCE), pp. 879--887, vol. 56, issue 2, May 2010 [bibtex] [doi]
- M.M.H.P. van den Heuvel, R.J. Bril, S. Schiemenz and C. Hentschel, Dynamic Resource Allocation for Real-time Priority Processing Applications, 28th IEEE International Conference on Consumer Electronics (ICCE), Digest of Technical Papers, pp 67--68, Las Vegas, NV, USA, January 2010 [bibtex] [poster] [doi]