Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
The design, implementation and evaluation of SMART: a scheduler for multimedia applications
Proceedings of the sixteenth ACM symposium on Operating systems principles
Predicting MPEG execution times
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Theory of Rate-Based Execution
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Scheduling Aperiodic Requests under the Rate-Based Execution Model
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
| Hi-index | 0.00 |
Millions of applications have been developed on conventional time-sharing systems. We call those applications legacy applications. Many of them, typically multimedia applications, have Quality of Service (QoS) demands, which are not supported in time-sharing systems. Although many scheduling algorithms and schedulers have been proposed to schedule multimedia applications, it is not feasible to rebuild millions of legacy multimedia applications in a completely new programming model. Moreover, the execution pattern of multimedia applications is difficult to predict.This work presents a legacy application-compatible, adaptation-oriented scheduling framework. The new scheduler is implemented as a Linux loadable module. Thus users can either use the original Linux scheduler or use our scheduler by loading the module. In the new scheduler, users can reserve a default execution rate for legacy multimedia applications, and a rate adjustment mechanism is provided for adaptation. The framework also supports rate-based execution (RBE) and periodic threads that run at a constant rate, and non-real-time threads that have no QoS demand.