A system has 1 CPU-bound process and 17 10- bound processes. If the 10-bound processes request an issue once for every 1ms of CPU time, and that each 10-bound request takes 7ms. If the context switching time is 100 microseconds. Using Round robin algorithm with a time slice of 20 ms. The percentage CPU usage is? Correct up to 2 decimal places

A system has 1 CPU-bound process and 17 10- bound processes. If the 10-bound processes request an issue once for every 1ms of CPU time, and that each 10-bound request takes 7ms. If the context switching time is 100 microseconds. Using Round robin algorithm with a time slice of 20 ms. The percentage CPU usage is? Correct up to 2 decimal places

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Three processes of an operating system has P(arrival time, burst time) as follows: P1(0,6),P2(2,5), P3(4,2). Work out the average waiting time in this system when processes are scheduled with Shortest-Remaining-Time-First scheduling algorithm. a)1.3 b)3 c)4 d) 2.5 Note : please with explain Oprating system
Please help Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every 4 milliseconds of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also assume that the context-switching overhead is 2 milliseconds and that all processes are long-running tasks. Calculate the CPU utilization for a round-robin scheduler when the time quantum is 10 milliseconds (the result should be in the form of percentage, rational expression, or a ratio of two integers, such as 25/88, 81/121).
NOTE: "Exekveringstid(ms)" means execution time or burst time in milliseconds Assume that a system with a CPU at one time has the following processes queued in the CPU's READY queue: Calculate the waiting time for the seven processes: 1) If FCFS is being used 2) If LRU is being used 3) If RR with time quantum of 8ms
Assuming a Round-Robin Scheduling works with a quantum time of 5, draw the timeline for CPU- and I/Obursts for the following three processes; A, B, C, with their arrival times, execution and I/O times. k=5 m=10 p=3
Consider the following set of processes A, B, C, D with the following CPU burst time and I/O. Find the average waiting time with RR of quantum 10ms and context switch time=2ms. What is the average waiting time? Write the waiting time for processes A,B,C,D.
A single-CPU system has four processes, P1, P2, P3 and P4 in the ready queue. The execution times and I/O needs for these processes are given below. All times are in ms. (hint: when a process starts an IO operation, it is removed from the ready queue and put back at the end of the queue only when it completes its IO). Process P1: Arrives at 0ms, needs 23ms of CPU time. Performs I/O for 5ms after 10ms of its execution time, then another 5ms after 20ms of its execution time. Process P2: Arrives at 3ms, needs 12ms of CPU time. Performs I/O for 10ms after 5ms of its execution time. Process P3: Arrives at 1ms, needs 15ms of CPU time. Performs I/O for 1ms after 7ms of its execution time. Process P4: Arrives at 2ms, needs 8ms of CPU time. Performs I/O for 5ms after 4ms of its execution time. We assume that the CPU is idle if no one of these four processes is using it. Using Round Robin scheduling algorithm with a Time Quantum of 4ms and ignoring the context switch time, determine: a) The…
How would it be advantageous to prioritize the I/O queue above the process execution queue? If the I/O connection fails, who knows what will occur. No one knows how this could effect the CPU's maximum burst rate. I'm confused as to the nature of your question.
Consider the processes with given arrival times, burst times and priorities as below Process Arrival time Burst time Priority P0 0 10 3 P1 0 5 5 P2 10 10 2 P3 10 1 1 Assume the OS is using the following CPU scheduling algorithms. (a) FIFO (b) Round Robin with quantum = 5 ms (c) Priority scheduling Calculate the waiting and turnaround times for each process for each of the algorithms above. Provide the Gantt charts in your answers for each of the algorithms to show the execution of the processes. Fill in the columns in the format below for the waiting time and turnaround time Turnaround time and waiting time Process ID Waiting Time Turnaround Time P1 P2 P3 P4 Average waiting time = Average turnaround time =
In a multiprogrammed environment with 32MB of RAM where all processes require9MB of unshared RAM and spend 40% of their time in I/O wait, calculate themaximum achievable CPU utilization. If the RAM available is increased by 700%and time spent in I/O wait increases by 100%, calculate how much RAM will remainunused when CPU utilization is just above 99%.
When this option is available, the I/O queue should be prioritised above the process execution queue. In what ways may this be beneficial? Who knows what will take place if there is a disruption in the I/O. It is unclear at this time if this will have an effect on the maximum burst rate of the CPU. I'm not really clear on the point you're trying to make here.
consider the following set of processes , with the length of the CPU burst given in milliseconds: Draw the Gantt charts that illustrate the execution of these processes and compute the average waiting time, average turnaround, average response time using the following scheduling algorithms: 1) FCFS 2)Primitive SJF Process, burst time, arrival time P3 2 0 P2 4 1 P5 5 2 P1 10 3 P4 1 4
Consider the FIVE (5)process with their CPU burst time and arrival time. Process Arrival Time CPU burst time P0 0 1 P1 2 3 P2 1 4 P3 1 3 P4 3 2 Based on the above data, answer the following Calculate the turn-around time for SRT algorithm. Calculate average turn-around time for SRT algorithm. Calculate the response time for SJF. Calculate the waiting time for SJF. Which algorithm is the best among SJF and SRT? Justify your answer.