Reference no: EM132494076 , Length: 4 pages

Question 1:

Table 1 provides the attributes of a set of 8 tasks. Each task requires a processor and some need an additional resource r. The scheduled start times sti and scheduled finish times fti are also given in Table 1.

Task τi	pid	C,	C;	d,	I)	Sti	ft;
Task τ1	1	50	25	100	-	0	50
Task T2	1	175	75	250	-	50	225
Task T3	1	75	50	350	-	225	300
Task T4	1	100	100	500	shared	300	400
Task T5	1	150	100	600	-	400	550
Task T6	2	150	125	150	-	0	150
Task T7	2	50	50	200	exclusive	150	200
Task T8	2	75	75	300	-	200	275
Task T9	2	100	100	600	exclusive	450	550
Task T10	3	50	50	50	-	0	50
Task T11	3	100	50	300	-	150	250
Task T12	3	150	100	450	shared	300	450
Task T13	3	100	100	475	-	450	550

Table 1. Task Parameters

Assume the number of processors as 3,
1. Draw the post mu schedule without resource reclaiming
2. With reference to the Basic Reclaiming Algorithm steps, Fill the following table:
Time
reclaim 8
3. Draw post run schedule with resource reclaiming .

Question 2:
a) Define Resource Reclaiming in Multiprocessor Real Time Systems.
b) Table 1 provides the attributes of a set of 8 tasks. Each task requires a processor and some need an additional resource r. The scheduled start times st and scheduled finish times ft are also given in Table 1.

Task τi	pid	Ci	Ci	di	ri	sti	fti
Task τ1	1	150	125	150	-	0	150
Task T2	1	50	50	200	exclusive	150	200
Task T3	1	75	75	300	-	200	275
Task T4	1	100	100	600	exclusive	450	550
Task T5	2	50	50	50	-	0	50
Task T6	2	100	50	300	-	150	250
Task T7	2	150	100	450	shared	300	450
Task T8	2	100	100	575	-	450	550

Table 1. Task Parameters

Feasible schedule S according to tasks' worst case computation tunes is given in Figure 2, Draw the post run schedule without resource reclaiming (Figure 3) and post run schedule with resource reclaiming (Figure 4) in the given separate sheet. Assume the number of processors as 2. Write your answers on the separate answer sheet (page 3).