Article ID: | iaor2008131 |
Country: | United Kingdom |
Volume: | 7 |
Issue: | 2 |
Start Page Number: | 105 |
End Page Number: | 117 |
Publication Date: | Mar 2004 |
Journal: | Journal of Scheduling |
Authors: | Verhaegh Wim F.J., Wst Clemens C. |
Keywords: | markov processes |
Many media processing applications create a load that varies significantly over time. Hence, if such an application is assigned a lower processing-time budget than needed in its worst-case load situation, deadline misses are likely to occur. This problem can be dealt with by designing media processing applications in a scalable fashion. A scalable media processing application can run in multiple qualities, leading to correspondingly different resource demands. The problem we consider is to find an accompanying quality control strategy, which minimizes both the number of deadline misses and the number of quality changes, while maximizing the quality of processing. We present an initial approach to the above problem by modeling it as a Markov decision process (MDP). Our model is based on measuring relative progress at milestones. Solving the MDP results in a quality control strategy that can be applied during runtime with only little overhead. We evaluate our approach by means of a practical example, which concerns a scalable MPEG-2 decoder.