Answer Happy

6.7 This problem is concerned with the performance and behavior of rate-monotonic and earliest- deadline-first algorithms. (a) Construct the initial segments in the time interval (0, 750) of a rate-monotonic schedule and an earliest-deadline-first schedule of the periodic tasks (100, 20), (150, 50), and (250, 100), whose total utilization is 0.93. (b) Construct the initial segments in the time interval (0, 750) of a rate-monotonic schedule and an earliest-deadline-first schedule of the periodic tasks (100, 20), (150, 50), and (250, 120), whose total utilization is 1.1.