Paper Info
Title
Better Real-Time Response for Time-Share Scheduling
Abstract
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CPU schedulers derived from time-share algorithms; because they are based on best-effort policies, these general-purpose systems provide little support for real-time constraints. This paper describes BeRate, a scheduler that integrates best-effort and soft real-time processing using a best-effort programming model in which soft real-time application parameters are inferred from runtime behavior. We show that with no a priori information about applications, BeRate outperforms Linux when scheduling workloads containing soft real-time applications.
Year
DOI
Venue
2003
10.1109/IPDPS.2003.1213246
IPDPS
Keywords
Field
DocType
real-time constraint,general-purpose system,best-effort programming model,time-share algorithm,different timeliness constraint,better real-time response,runtime behavior,soft real-time processing,soft real-time application parameter,time-share scheduling,soft real-time application,best-effort policy,cpu scheduling,scheduling algorithm,degradation,programming model,application software,best effort,real time systems,quality of service,computer science,linux,real time,time sharing
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Scheduling (computing),Parallel computing,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
ISSN
ISBN
Citations 
1530-2075
0-7695-1926-1
5
PageRank 
References 
Authors
0.51
15
2
Name
Order
Citations
PageRank
Scott A. Banachowski150.51
Scott A. Brandt2166394.81