Share Email Print

Proceedings Paper

BEST scheduler for integrated processing of best-effort and soft real-time processes
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Algorithms for allocating CPU bandwidth to soft real-time processes exist, yet best-effort scheduling remains an attractive model for both application developers and users. Best-effort scheduling is easy to use, provides a reasonable trade-off between fairness and responsiveness, and imposes no extra overhead for specifying resource demands. However, best-effort schedulers provide no resource guarantees, limiting their ability to support processes with timeliness constraints. Reacting to the need for better support of soft real-time multimedia applications while recognizing that the best-effort model permeates desktop computing for very good reasons, we have developed BEST, an enhanced best-effort scheduler that combines desirable aspects of both types of computing. BEST provides the well-behaved default characteristics of best-effort schedulers while significantly improving support for periodic soft real-time processes. BEST schedules using estimated deadlines based on the dynamically detected periods of processes exhibiting periodic behavior, and assigns pseudo-periods to non-periodic processes to allow for good response time. This paper discusses the BEST scheduling model and our implementation in Linux and presents results demonstrating that BEST outperforms the Linux scheduler in handling soft real-time processes, outperforms real-time schedulers in handling best-effort processes, and sometimes outperforms both, especially in situations of processor overload.

Paper Details

Date Published: 10 December 2001
PDF: 15 pages
Proc. SPIE 4673, Multimedia Computing and Networking 2002, (10 December 2001); doi: 10.1117/12.449988
Show Author Affiliations
Scott A. Banachowski, Univ. of California/Santa Cruz (United States)
Scott Brandt, Univ. of California/Santa Cruz (United States)

Published in SPIE Proceedings Vol. 4673:
Multimedia Computing and Networking 2002
Martin G. Kienzle; Prashant J. Shenoy, Editor(s)

© SPIE. Terms of Use
Back to Top