Consider four periodic tasks T1, T2, T3, T4 (having decreasing priority), which share four resources R:...

 

Transcribed Image Text:

Consider four periodic tasks T1, T2, T3, T4 (having decreasing priority), which share four resources R: {A, B, C, D}, accessed using the Priority Inheritance Protocol (PIP). Compute the maximum blocking time B for each task, knowing that the longest duration D, for a task Tk on resource R is given in the following table (there are no nested critical sections): i. ii. Dk. T T T3 T4 A 12 10 0 10 B 5 0 3 0 Compute the maximum blocking time B that the longest duration Dk, for a task T C 9 7 0 8 D 8 0 7 0 for each task, knowing on every resource R How many times can the highest priority task, T, be blocked by each of the resources {A, B, C, D}? Is the blocking bounded? E 0 6 13 5 -/4 _/1 A G Consider four periodic tasks T1, T2, T3, T4 (having decreasing priority), which share four resources R: {A, B, C, D}, accessed using the Priority Inheritance Protocol (PIP). Compute the maximum blocking time B for each task, knowing that the longest duration D, for a task Tk on resource R is given in the following table (there are no nested critical sections): i. ii. Dk. T T T3 T4 A 12 10 0 10 B 5 0 3 0 Compute the maximum blocking time B that the longest duration Dk, for a task T C 9 7 0 8 D 8 0 7 0 for each task, knowing on every resource R How many times can the highest priority task, T, be blocked by each of the resources {A, B, C, D}? Is the blocking bounded? E 0 6 13 5 -/4 _/1 A G