Home | Legals | Sitemap | KIT

Scheduling Theory in Real-Time Systems

Scheduling Theory in Real-Time Systems
type: lecture
chair: Chair of Micro Hardware Technologies for Automation
semester: >=5
place:

 SR 119 at Faculty of Informatics, Gebäude 50.34 (Notice for room change from original room 102 at 40.28)

time:

Monday, 14:00-15:45 weekly

start: 18.10.2010
lecturer:

Juniorprofessor Dr. Jian-Jia Chen

sws: 2
ects: 3
lv-no.: lv24075
information:

Course Description: Real-time systems play a crucial role in many applications, such as avionic control systems, automotive electronics, telecommunications, industrial automation, and robotics. Such safety-critical applications require high reliability in timing assurance to prevent from serious damage to the environment and significant human loss.

In this course, we will study scheduling theories to provide formal design and verification of real-time systems.  The main objectives are to introduce the basic concepts of real-time scheduling, illustrate the most significant and state-of-the-art results in the field, and provide the basic methodologies for designing predictable computing systems which can be used to support critical control applications. The following subjects will be covered in the course:

  * Introduction to Task Models and Scheduling
  * Uniprocessor Scheduling for Periodic/Sporadic Tasks
  * Resource Sharing and Priority Inversion
  * Resource Reservation Servers (TBS, CBS, PS, SS, and DS)
  * Worst-Case Execution Time Analysis
  * Multiprocessor Scheduling
  * Real-Time Calculus
  * Schedulability with Resource-Sharing for Multiprocessor
  * Real-Time Kernel Design
 

Prerequisite: Computer Operating Systems or equivalent.  A basic background in algorithm analysis, data structures, and discrete math will be assumed.

TextBook: Giorgio C. Buttazzo, “Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications”, Springer, Second Edition, 2004.  ISBN: 0-387-23137-4