A CPU scheduling algorithm for continuous media applications

  • Raj Yavatkar
  • K. Lakshman
Session VI: Scheduling and Synchronization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1018)


We provide an overview of a CPU management algorithm called RAP (Rate-based Adjustable Priority Scheduling) that provides predictable service and dynamic QOS control in the presence of varying compute times, arrival and departure of processes, and CPU overloads. A significant feature of RAP includes an application-level QOS manager that implements policies for graceful adaptation in the face of CPU overload.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andrew Campbell, Geoff Coulson, and David Hutchison. A multimedia enhanced transport service in a quality of service architecture. In 4th International NOSSDAV Workshop, pages 124–137, 1993.Google Scholar
  2. 2.
    K. Lakshman and Raj Yavatkar. Adaptive CPU Management for Multimedia Applications. Technical report, University of Kentucky — Dept. of Computer Science, March 1995.Google Scholar
  3. 3.
    K.K. Ramakrishnan and Operating system support for a video-on-demand file service. In 4th International NOSSDAV Workshop, pages 216–227, 1993.Google Scholar
  4. 4.
    Hide Tokuda and Takuro Kitayama. Dynamic QOS Control based on Real-Time threads. In 4th International NOSSDAV Workshop, pages 114–123, 1993.Google Scholar
  5. 5.
    Hui Zhang and Domenico Ferrari. Rate-controlled static priority queueing. In Proc. IEEE Infocom '93, May 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Raj Yavatkar
    • 1
  • K. Lakshman
    • 1
  1. 1.Department of Computer ScienceUniversity of KentuckyLexington

Personalised recommendations