BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TN-94-8
       ENTRY:: May 10, 1994
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Emulating Soft Real-Time Scheduling Using Traditional
               Operating System Schedulers
        TYPE:: Technical Note
      AUTHOR:: Adelberg, Brad
      AUTHOR:: Garcia-Molina, Hector
      AUTHOR:: Kao, Ben
       PAGES:: 38
    ABSTRACT:: 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.
       NOTES:: [Adminitrivia V1/Prg/19940510]
         END:: STAN//CS-TN-94-8