Task scheduling in time-triggered real-time systems

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.