Abstract | ||
---|---|---|
Demand for real-time capability in general-purpose systems is rising arid as systems are retrofitted with new scheduling features they become increasingly complex. To counter this trend we present the best-effort bandwidth server (BEBS), an aperiodic server for flexible and efficient support of best-effort applications in a real-time system. Recognizing that the responsiveness of a server depends on its period, and that not every best-effort task requires equal responsiveness, the algorithm adjusts its period based on run-time behavior of tasks. We created a prototype implementation of the system to demonstrate that it performs suitably as a general-purpose scheduler in comparison to Linux, and outperforms a common type of hierarchy used in existing general-purpose systems. The result is a system that integrates real-time scheduling with best-effort support, both simple and powerful enough to be used as the only scheduler in a general-purpose operating system. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1109/REAL.2004.26 | RTSS |
Keywords | Field | DocType |
operating system,best effort,real time systems,real time,scheduling | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
ISSN | ISBN | Citations |
1052-8725 | 0-7695-2247-5 | 11 |
PageRank | References | Authors |
0.71 | 20 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Scott Banachowski | 1 | 145 | 6.39 |
Timothy Bisson | 2 | 172 | 8.04 |
Scott A. Brandt | 3 | 1663 | 94.81 |