Better Real-Time Response for Time-Share Scheduling

  title={Better Real-Time Response for Time-Share Scheduling},
  author={Scott A. Banachowski and Scott A. Brandt},
Time-share CPU schedulers permeate general-purpose computer systems, yet provide little support for real-time constraints. We demonstrate that by making inferences from the behavior of applications, soft real-time scheduling performance is achievable using a best-effort policy in which the scheduler has no a priori knowledge of application resource needs. In a typical time-share scheduler, recent CPU usage is accounted for in a dynamic scheduling priority, so the behavior pattern of a process… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 10 extracted citations

Dynamic queue deadline first scheduling algorithm for soft real time systems

Proceedings of the IEEE Symposium on Emerging Technologies, 2005. • 2005

Integrating best-effort scheduling into a real-time system

25th IEEE International Real-Time Systems Symposium • 2004
View 2 Excerpts


Publications referenced by this paper.
Showing 1-10 of 31 references

The BEST scheduler for integrated processing of best-effort and soft real-time processes

S. Banachowski, S. Brandt
In Proceedings of Multimedia Computing and Networking • 2002
View 9 Excerpts
Highly Influenced

Linux preemptable kernel patch

R. M. Love, Oct • 2002
View 1 Excerpt

Using the best-effort scheduling model to support soft real-time processing

S. A. Banachowski
Master’s thesis, • 2002
View 2 Excerpts

Linux scheduling low-latency patch. akpm/linux/schedlat.html

A. Morton
View 1 Excerpt

Efficient Scheduling of Real-Time Multi-Task Applications in Dynamic Systems

IEEE Real Time Technology and Applications Symposium • 2000
View 1 Excerpt

Similar Papers

Loading similar papers…