Name
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BFb0019272 | NOSSDAV |
Keywords | Field | DocType |
cpu scheduling algorithm,continuous media applications,cpu scheduling | Computer science,Computer network,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Distributed computing,Fair-share scheduling,Deadline-monotonic scheduling,Algorithm,Earliest deadline first scheduling,Dynamic priority scheduling,Stride scheduling,Round-robin scheduling | Conference |
ISBN | Citations | PageRank |
3-540-60647-5 | 14 | 1.41 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rajendra Yavatkar | 1 | 259 | 68.96 |
| K. Lakshman | 2 | 62 | 7.03 |