a.) What is the total processor utilization of this system? b.) Is the periodic task set a harmonic task set? c.) What is the hyperperiod of this system? d.) Create a frame-based static cyclic schedule for these tasks. Take care that it satisfies all the following constraints: • the execution of each job fits within a single frame • the frame of a job begins no earlier than the job's release time • the frame of a job ends no later than the job's deadline If you have many possible frames, choose the largest one. Present your schedule in the form of a Gantt chart. e.) What is the worst-case response time of each task in your schedule above? f.) If the execution time of TB changes to 4, create a cyclic schedule for the task set or argue that a valid schedule does not exist.

Fig: 1

Fig: 2