Assignment 2: COSC 5340-01 / 4301-01 (Real-Time Systems)

Exercise 1. Let us consider the following preemptive task set (JS is a sporadic task):

J1: S1 = 0, c1 = 1, p1 = d1 = 5
J2: S2 = 0, c2 = 2, p2 = d2 = 7
JS: SS = 0, cS = 1, pS = dS = 4

a) compute the utilization rate.

b) check the applicability of RM-scheduling method based on schedulability test 7.
c) run the RM-scheduler for the above task set.

Exercise 2. Let us consider the following preemptive task set (JS is a sporadic task):

J1: S1 = 0, c1 = 1, p1 = d1 = 4
J2: S2 = 0, c2 = 2, p2 = d2 = 7
JS: SS = 0, cS = 1, pS = dS = 4

a) compute the utilization rate.

b) check the applicability of RM-scheduling method based on schedulability test 7.
c) find a RM-scheduler for the above task set.

Exercise 3. Let us consider the following non-preemptive task set (JS is a sporadic task):

J1: S1 = 0, c1 = 2, p1 = d1 = 5
J2: S2 = 0, c2 = 2, p2 = d2 = 8
JS: SS = 0, cS = 2, pS = dS = 8

a) compute the utilization rate.

b) check the applicability of RM-scheduling method based on schedulability test 8.
c) find a RM-scheduler for the above task set, if one exists.

Exercise 4. Let us consider the set of non-preemptive tasks T = {J1, J2, J3, J4} with the following:

1. precedence constraints: J1 à J2, J1 à J3, J2 à J4, J3 à J4

2. computation times and deadlines:
a. J1: c1 = 2, d1 = 5,
b. J2: c2 = 3, d2 = 7,
c. J3: c3 = 2, d3 = 10,
d. J4: c4 = 8, d4 = 18,

a) compute the task precedence graph.

b) investigate the applicability of Algorithms A and B to T.
Exercise 5. Let us consider the set of non-preemptive tasks T = {J1, J2, J3} with the following:

1. J2 must rendezvouz with J3 after the first scheduling block.

2. J3 must rendezvouz with J2 after the second scheduling block.
3. computation times and deadlines:
1. J1: c1 = 2, d1 = p1 = 15.
2. J2: c2, 1 = 1, c2, 2 = 2, d2 = p2 =5.
3. J3: c3, 1 = 2, c3, 2 = 2, d3 = p3 = 15.

1. compute the utilization rate for T.

2. compute the precedence constraints between tasks’ blocks.
3. investigate the deterministic rendezvous model algorithm for finding an EDF-schedule.