Performance evaluation of local real-time schedulers

Abstract

Through the use of a simulation study, the authors show how the effectiveness of a scheduling algorithm varies depending on the metric of interest and the execution environment under which it runs. They describe the timing requirements of real-time jobs. Three measures of response time controls are described. The model of a scheduling algorithm's execution environment is described, followed by a discussion on the variations in execution environment necessary to investigate adequately the behavior of a given scheduling algorithm. A simulation case study is described. A description of the modeling and simulation of a single processor running M job classes is included. Two scheduling algorithms for controlling response times are described, the results of running three scheduling algorithms under varying execution environments are presented.<>