Abstract
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.
This research was supported in part by the National Science Foundation Grant No. NCR-9111323 and Grant no. STI-9108764.
Supported by the Center for Computational Sciences, University of Kentucky.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
K. Lakshman and Raj Yavatkar. Adaptive CPU Management for Multimedia Applications. Technical report, University of Kentucky — Dept. of Computer Science, March 1995.
K.K. Ramakrishnan and et.al. Operating system support for a video-on-demand file service. In 4th International NOSSDAV Workshop, pages 216–227, 1993.
Hide Tokuda and Takuro Kitayama. Dynamic QOS Control based on Real-Time threads. In 4th International NOSSDAV Workshop, pages 114–123, 1993.
Hui Zhang and Domenico Ferrari. Rate-controlled static priority queueing. In Proc. IEEE Infocom '93, May 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yavatkar, R., Lakshman, K. (1995). A CPU scheduling algorithm for continuous media applications. In: Little, T.D.C., Gusella, R. (eds) Network and Operating Systems Support for Digital Audio and Video. NOSSDAV 1995. Lecture Notes in Computer Science, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019272
Download citation
DOI: https://doi.org/10.1007/BFb0019272
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60647-5
Online ISBN: 978-3-540-48524-7
eBook Packages: Springer Book Archive