O'Reilly logo

Real-Time Embedded Systems by Gabriele Manduchi, Ivan Cibrario Bertolotti

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

13

 

 

Schedulability Analysis Based on Utilization

 

CONTENTS

13.1 Processor Utilization

13.2 Sufficient Schedulability Test for Rate Monotonic

13.2.1 Ulub for Two Tasks

13.2.2 Ulub for N Tasks

13.3 Schedulability Test for EDF

13.4 Summary

The previous chapter introduced the basic concepts in process scheduling and analyzed the two classes of scheduling algorithms: fixed priority and variable priority. When considering fixed-priority scheduling, it has been shown that Rate Monotonic (RM) Scheduling is optimal, that is, if a task set is schedulable under any-fixed priority schema, then it will be under RM. For variable-priority assignment, the optimality of Earliest Deadline First (EDF) has been enunciated and will be proved in this chapter. ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required