An Omniscient Scheduling Oracle for Systems with Harmonic Periods
MetadataShow full item record
CitationAtlas, Alia; Bestavros, Azer. "An Omniscient Scheduling Oracle for Systems with Harmonic Periods", Technical Report BUCS-1998-014, Computer Science Department, Boston University, September 2, 1998. [Available from: http://hdl.handle.net/2144/1770]
Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides schedules for periodic task sets with harmonic periods and variable resource requirements. Three different job value functions are described and implemented. Each corresponds to a different system goal. The oracle is used to examine the performance of different on-line schedulers under varying loads, including overload. We have compared the oracle against Rate Monotonic Scheduling, Statistical Rate Monotonic Scheduling, and Slack Stealing Job Admission Control Scheduling. Consistently, the oracle provides an upper bound on performance for the metric under consideration.