Adelberg, B. and Garcia-Molina, H. and Kao, B. (1994) Emulating Soft Real-Time Scheduling Using Traditional Operating System Schedulers. Technical Report. Stanford InfoLab. (Publication Note: 15th IEEE Real-Time Systems Symposium (RTSS 1994) San Juan, Puerto Rico, December 7-9, 1994)
Real-time scheduling algorithms are usually only available in the kernels of real-time operating systems, and not in more general purpose operating systems, like Unix. For some soft real-time problems, a traditional operating system may be the development platform of choice. This paper addresses methods of emulating real-time scheduling algorithms on top of standard time-share schedulers. We examine (through simulations) three strategies for priority assignment within a traditional multi-tasking environment. The results show that the emulation algorithms are comparable in performance to the real-time algorithms and in some instances outperform them. Keywords: soft real-time, priority assignment, scheduling.
|Item Type:||Techreport (Technical Report)|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/strip.html|
|Deposited By:||Import Account|
|Deposited On:||25 Feb 2000 16:00|
|Last Modified:||05 Feb 2009 15:19|
Repository Staff Only: item control page