Rate-monotonic scheduling in the presence of timing unpredictability

Scheduling periodic hard real time tasks is of great importance to many real time applications, such as open architecture machine tool controllers and avionic systems. The rate monotonic scheduling algorithm has been proven to provide an optimal static priority assignment under idealized conditions. However some of these conditions are not met in a real computer system. In particular the release times of tasks can deviate from the specified time instants because of operating system software timer unpredictability. We investigate the timer behaviors in three commercial real time operating systems, VxWorks, QNX and pSOSystem. Based on our findings, we propose an empirical task schedulability model, called RMTU (Rate Monotonic in the presence of Timing Unpredictability), to augment the rate monotonic scheduling theory in order to handle timing unpredictability. We then design an approach to systematically derive the model parameters by measurements. With RMTU, task deadlines can be empirically guaranteed. The validity of RMTU is supported by our measurement data. These results are useful not only to control application developers, but also to real time practitioners at large.

[1]  Jay K. Strosnider,et al.  Fixed Priority Scheduling Theory for Hard Real-Time Systems , 1991 .

[2]  Wei-Kuan Shih,et al.  Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines , 1991, IEEE Trans. Software Eng..

[3]  Lei Zhou,et al.  Probabilistic Real-Time Data Access with Interval Constraints , 1996, RTDB.

[4]  B. Silverman.  Density estimation for statistics and data analysis , 1986 .

[5]  Jay K. Strosnider,et al.  A modeling methodology for real-time/multimedia operating systems , 1995, Proceedings Real-Time Technology and Applications Symposium.

[6]  Sanjoy K. Baruah,et al.  Jitter concerns in periodic task systems , 1997, Proceedings Real-Time Systems Symposium.

[7]  Steve Vestal.  On the accuracy of predicting rate monotonic scheduling performance , 1990, TRI-Ada '90.

[8]  Lui Sha,et al.  Real-time synchronization protocols for multiprocessors , 1988, Proceedings. Real-Time Systems Symposium.

[9]  Kang G. Shin,et al.  Semaphore Queue Priority Assignment for Real-Time Multiprocessor Synchronization , 1995, IEEE Trans. Software Eng..

[10]  John P. Lehoczky,et al.  Rate-monotonic analysis for real-time industrial computing , 1994, Computer.

[11]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[12]  Alan Burns,et al.  Putting fixed priority scheduling theory into engineering practice for safety critical applications , 1996, Proceedings Real-Time Technology and Applications.

[13]  Mark Klein,et al.  A practitioner's handbook for real-time analysis - guide to rate monotonic analysis for real-time systems , 1993, The Kluwer international series in engineering and computer science.

[14]  Kevin Jeffay,et al.  Accounting for interrupt handling costs in dynamic priority task systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[15]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[16]  Parameswaran Ramanathan,et al.  Real-time computing: a new discipline of computer science and engineering , 1994, Proc. IEEE.

[17]  Lei Zhou,et al.  Real-time performance guarantees in manufacturing systems , 1999 .

[18]  Lei Zhou,et al.  Performance evaluation of modular real-time controllers , 1996 .