EE 4770Homework 4Due: 23 April 1999Problem 1:The tasks in the table below run on a system with a non-task preemptive OS with aquantum of 20 ms. Task A does IO after each 10 ms of computation, the IO takes 7 ms to complete.Show CPU activity and task states until the last task finishes.TaskPriorityArrivalRunActivityNameTimeTimeA310 ms50 msIO each 10 ms takes 7 ms.B220 ms70 msC1015 msProblem 2:Information about events and their handlers appear in the table below. Under theone-shot assumption, find the worst case latency and response time for each event. Show the eventsequences used.EventStrongWeakRunNamePriorityPriorityTime
This is the end of the preview.
access the rest of the document.
µs, Priority Arrival Time, weak priority, non-task preemptive OS