The priority inversion is an undesirable situation in real-time scheduling. Let T1, T2, and T3 be the three periodic tasks with decreasing order of priorities. In addition, T1 and T3 share the same resource S.
(i) Specify how the priority inversion may happen in this example. [6 marks]
(ii) Determine the total blocking time for T1 based on the answer in Question 2(b)(i). [1 mark]
(iii) Give TWO (2) solutions to overcome the priority inversion problem. [2 marks]
(iv) Based on the given answers in Question 2(b)(iii), prescribe which one is the better solution. [4 marks]