Dynamic Resource Allocation forReal-time Priority Processing

M.M.H.P. van den Heuvel – R.J. Bril – S. Schiemenz – C. Hentschel

Basic mechanisms:

Enhance time

basicquality(0%)

preliminary termination

bestquality(100%)

Performance comparison:

• Traditional vs. Priority Processing:

Maximize the overall output quality of independent, competing priority processing algorithmsthat are executed on a shared platform.

Priority Processing Concept [1]:

Dynamic Resource Allocation:

Affiliations:Eindhoven University of TechnologyDepartment of Mathematics and Computer ScienceSystem Architecture and Networking (SAN) Groupden Dolech 2, 5612 AZ Eindhoven, The Netherlands

Brandenburg University of TechnologyDepartment of Media Technology

Konrad-Wachsmann-Allee 1, 03046 Cottbus, Germany

• Comparison of different implementations for thebasic mechanism resource allocation. Schedulingbased on priority manipulation gives a significantimprovement over suspend/resume due to reducedcontrol overhead. The scheduling strategy is definedby reinforcement learning (RL) [2].

References:[1] C. Hentschel and S. Schiemenz, Priority-processing foroptimized real-time performance with limited processing re-sources., International Conference on Consumer Electron-ics (ICCE). Digest of Technical Papers., Jan. 2008.[2] S. Schiemenz, Echtzeitsteuerung von skalierbarenPriority-Processing Algorithmen, Tagungsband ITG Fach-tagung - Elektronische Medien, pp. 108 – 113, March 2009.

SortBasic

Strategies for dynamic resource allocation have been ad-dressed in [2]. We identify the underlying mechanismsfor dynamic resource allocation and compare the perfor-mance of different implementations on a general purposeplatform.

1. Preliminary Termination:Skip remainder of the framewhen the deadline is reached.

2. Resource Allocation:Allocate processor to an algorithmfor an entire time-slot.

3. Monitoring:Account for assigned time-slots andthe relative progress of an algorithm.