Please use this identifier to cite or link to this item:
|Title:||Approximating scheduling for multimedia applications under overload conditions|
|Authors:||Guan Tan, T.|
Predictable overload management
|Source:||Guan Tan, T.,Hsu, W. (1998-07). Approximating scheduling for multimedia applications under overload conditions. International Journal of Approximate Reasoning 19 (1-2) : 57-71. ScholarBank@NUS Repository.|
|Abstract:||With the increased demands in multimedia applications, the need to provide better system support is greater than ever. Multimedia applications have an added dimension of time in their execution which results in stringent timing requirements. These timing requirements are usually "soft" constraints, that is, they are potentially relaxable human preference constraints. In this paper, we investigate an approximating scheduling algorithm that attempts to derive a "good" schedule for multimedia processes even under the overload condition. A model is presented which is able to quantify the trade-off between conflicting goals in a multimedia application. Experiments are conducted to test the performance of the approximating scheduling algorithm. Results indicate that our proposed algorithm is able to adjust dynamically to transient overload situation without too much degradation in performance. © 1998 Published by Elsevier Science Inc. All rights reserved.|
|Source Title:||International Journal of Approximate Reasoning|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.