We propose an adaptive scheduling technique to schedule highly dynamic multimedia tasks on a CPU. We use a combination of two techniques: the first one is a feedback mechanism to track the resource requirements of the tasks based on local observations. The second one is a mechanism that operates with a global visibility, reclaiming unused bandwidth. The combination proves very effective: resource reclaiming increases the robustness of the feedback, while the identification of the correct bandwidth made by the feedback increases the effectiveness of the reclamation. We offer both theoretical results and an extensive experimental validation of the approach.
|Titolo:||A robust mechanism for adaptive scheduling of multimedia applications|
|Data di pubblicazione:||2011|
|Appare nelle tipologie:||1.1 Articolo su Rivista/Article|