TRT 3241 Real-Time Systems

Trimester 2 (2410)

Tutorial 4 Tasks

1. Each of the following systems contains independent and preemptable periodic

tasks and is scheduled by the cyclic code scheduling algorithm. For each system,
calculate its major cycle, choose an appropriate frame size, and construct the
schedule of the first major cycle.
a) T1 = (3,1), T2 = (6,1), T3 = (9,2)
b) T1 = (4,1), T2 = (8,1), T3 = (12,2), T4 = (12,3)
c) T1 = (5,1), T2 = (10,2), T3 = (20,5)

2. The following systems of independent and preemptable periodic tasks are

scheduled by the RM algorithm. Construct the schedule in the segment of (0,25)
for each system.
a) T1 = (4,1), T2 = (8,2), T3 = (10,3)
b) T1 = (4,1), T2 = (5,1), T3 = (7,1), T4 = (10,1)
c) T1 = (3,1), T2 = (6,1), T3 = (8,2), T4 = (12,4)

3. Schedule the following one-shot tasks with hard deadlines on a uniprocessor by

the EDF algorithm. Assume that all tasks are independents and preemptable.
4. The following systems of independent and preemptable periodic tasks are
scheduled by the EDF algorithm. Construct the schedule in the segment of (0,15)
for each system.
a) T1 = (3,1), T2 = (5,3)
b) T1 = (4,1), T2 = (5,1), T3 = (6,3)
c) T1 = (5,1), T2 = (6,3), T3 = (9,2)