Task scheduling in time-triggered real-time systems

Abstract

Three scheduling algorithms are examined, static priority-driven scheduling, time sliced scheduling and deadline-driven sheduling. Their characteristics are compared for scheduling tasks in real time. New, more simple proof is offered to show that deadline-driven scheduling algorithm is capable to utilize all proocessor resource without transient overloads.

Related Papers

• → The improved EDF scheduling algorithm for embedded real-time system in the uncertain environment(2010)10 cited
• → One-level and two-level scheduling for real-time systems(2013)1 cited
• Dynamic Scheduling Algorithm Based on Limited Number of Priority(2007)
• → Task scheduling in time-triggered real-time systems(2014)