Question C $(20$ points$)$ Course name

$-$

$$Real time systems

$-$

$$CPRE $558$

$1$ A system contains the following periodic tasks: $T_i=(c_i,p_i,b_i)$:$T_1=(2,8,2)$;$T_2$

$=(1,3,1)$;$T_3=(4,12,0),$ where $b_i$ is the blocking time of $T_i$ by lower priority

tasks. Does this task set RM schedulable? Show your answer using exact analysis.

$2$ Please read the document "blocking time calculation" posted as "Lecture notes"

as part of this homework assignment, and no additional reading is required to

answer this question. This document includes selective pages from the text "Real$-$

time Systems" by Jane S$.$ Liu. Read pages $297-299$ to answer Question $8\mathrm{.}3$ on

page $327.$ Blocking includes direct blocking, priority$-$inheritance blocking, and

priority$-$ceiling blocking.