Assume every process requires 3 milli seconds of service time in a system with single processor. If new processes are arriving at the rate of 100 processes per minute, then estimate the fraction of time CPU is busy in system?

What percentage of the CPU is wasted, that is used for scheduling work, if it takes 10 ms to decide to execute a process for 90 ms?

We have 4 periodical processes II₁, II, II and II, that process a video. We know their periods P; and their running times C; (in milliseconds). For: (a) the rate monotonic scheduling (RMS) algorithm and (b) the earliest deadline first (EDF) algorithm draw diagrams that displays the schedule for those processes for a period of 150 ms. The times are the following: Process Pi Ci II₁ 45 10 II2 40 10 II3 35 5 II4 50 10 In the case of equal priorities the process that is already running has the priority. If this is not the case then take the process with the lowest ID. Does any of the above algorithms fail?

In a batch operating system, three jobs are submitted for execution. each job involves and I/O activity, CPU time and another I/O activity of the same time span as the first. Job JOB1 requires a total 23ms, with 3ms CPU time;JOB2 requires requires a total time of 29 ms with 5ms CPU time; JOB3 requires a total time of 14 ms with 4ms CPU time. Illustrate their execution and find CPU utilization for uniprogramming and multiprogramming systems. Also,Graphical representations and numeric calculations are expected to be showned.