Abstract:
Best-effort CPU scheduling is an attractive model for desktop computing because it is simple to use. However, best-effort models do not provide support for applications with deadlines. Soft real-time schedulers allocate the CPU for workloads containing soft deadlines by relying on developers and users to supply timing requirements to the system. BEST is an enhanced best-effort scheduler designed to meet soft real-time deadlines without prior knowledge of the workload. BEST dynamically detects the periods of processes, and schedules using estimated deadlines. By assigning pseudo-deadlines to non-periodic processes, BEST provides good response time to all applications while meeting deadlines of soft real-time applications. This paper discusses the work-in-progress on the BEST scheduler implementation. 1.
Citations
|
2316
|
Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
– Liu, Layland
- 1973
|
|
219
|
The Design and Implementation of the 4.4BSD Operating System
– McKusick, Bostic, et al.
- 1996
|
|
216
|
The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications
– Nieh, Lam
- 1997
|
|
194
|
Real-time Mach: Towards a predictable real-time system
– Tokuda, Nakajima, et al.
- 1990
|
|
167
|
Processor capacity reserves: Operating system support for multimedia applications
– Mercer, Savage, et al.
- 1994
|
|
115
|
SVR4 UNIX Scheduler Unacceptable for Multimedia Applications
– Nieh, Hanko, et al.
- 1993
|
|
83
|
Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler
– Duda, Cheriton
- 1999
|
|
72
|
A rate-based execution abstraction for multimedia computing
– Jeffay, Bennett
- 1995
|
|
61
|
An overview of the Rialto real-time architecture
– Jones, Barbera, et al.
- 1996
|
|
50
|
Linux Kernel Internals
– Beck, Bohme, et al.
- 1998
|
|
20
|
A scheduler for best effort and realtime tasks
– BERT
- 1998
|
|
17
|
Flexible soft real-time processing in middleware. Real-Time Systems
– Brandt, Nutt
- 2002
|
