Skip to content

Scheduling principles and scheduling of periodic tasks

Goals

  • You will understand the important concepts behind scheduling.
  • You will understand how timing constraints may be specified.
  • You will understand what periodic and aperiodic tasks are.
  • You will learn about schedulability rules for periodic tasks.
  • You will learn and practice two algorithms used for periodic tasks.

Content

The present chapter aims at introducing aperiodic and periodic tasks, together with scheduling algorithms for periodic tasks. It covers:

  • Basic scheduling concepts.
  • Specification of timing constraints.
  • Periodic and aperiodic tasks.
  • Timeline Cyclic algorithm.
  • Monotonic Rate algorithm.

Course Slides

Practice

In the related codelab, you will first implement a simple case of periodic tasks using Timeline Cyclic Scheduling. Using this method, you will understand and experience limitations. You will then analyse, simulate and implement the same use case using the Rate Monotonic Algorithm. A number of exercices related to scheduling of periodic tasks can also be found at Exercices - Scheduling.