Question

Assume a system in which the typical interaction time is 90 milliseconds. The CPU scheduler uses...

Assume a system in which the typical interaction time is 90 milliseconds. The CPU scheduler uses round-robin scheduling. Why is it not a good idea to set the quantum length to be 1 second in this system?

Homework Answers

Answer #1

Answer:

It is given that interaction time is 90 milliseconds and now if quantum length to be 1 second then the interaction time would be greater than quantum time, which is not a good idea at all, here are some reasons for this claim:

  • If indeed the quantity of time is lesser in comparison to typical interaction time, this would result in regular repetitive contextual switches resulting in a lot of CPU usage overload and depletion.
  • This would relate to less capacity as well.
  • But the size of the quantum must be greater than the typical time of interaction.
  • The quantum of time must also not be too high. In any circumstance, Round Robin scheduling activity would appear to schedule FCFS.
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Assume a system in which the typical interaction time is 90 milliseconds. The CPU scheduler uses...
Assume a system in which the typical interaction time is 90 milliseconds. The CPU scheduler uses round-robin scheduling. Why is it not a good idea to set the quantum length to be 50 milliseconds in this system?
Operating Systems. In round robin scheduling, Tq=8 milliseconds. Assume that there are n processes running, and...
Operating Systems. In round robin scheduling, Tq=8 milliseconds. Assume that there are n processes running, and that the worst-case waiting time to get the CPU again is Tw=112 milliseconds. Calculate the number of processes n. (show the calculation)
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling , Premtive PRIORITY Sheduling, Highest Response ratio Next (HRRN) and Round Robin(quantum=4). I need this in half hour
A set of processes along with their burst time in milliseconds is given below. The processes...
A set of processes along with their burst time in milliseconds is given below. The processes should execute in First Come First Served order. Assume that the quantum (q) is 3: Process Burst Time P1 22 P2 4 P3 12 P4 15 P5 2 Find the average waiting time using the Round Robin algorithm. Round your answer to 2 decimal places
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process            Burst Time Priority P1                               5 4 P2                               3 1 P3                               1 2 P4                               7 2 P5                               4 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. If nonpreemptive priority (a larger priority number implies a higher priority) is used, what is the average waiting time of...
Refer to the information provided below: Refer to the information provided below: Process Burst Arrival-time Priority...
Refer to the information provided below: Refer to the information provided below: Process Burst Arrival-time Priority A 2 1 3 B 8 0 2 C 3 1 2 D 12 2 1 Note: A lower priority number indicates a higher priority For each of the following CPU scheduling algorithms, determine the turnaround and wait times for each process as well as the average wait and turnaround times. First Come First Serve Round Robin with quantum=2 ms (assume 1ms = 1...
Compatible Timesharing System (CTSS) has a priority scheduler. A process initially gets 1 quanta of time,...
Compatible Timesharing System (CTSS) has a priority scheduler. A process initially gets 1 quanta of time, then 2 quanta, then 4 quanta, 8 quanta, 16 quanta, 32 quanta, and 64 quanta where quanta is the length of the time quantum. Between time quanta, the process is swapped out. Thus for a process that has a service time of 100, it would take 7 swaps to disk (including when it was loaded into memory for the first time). Suppose a process...
Process Burst Arrival-time Priority A 2 1 3 B 8 0 2 C 3 1 2...
Process Burst Arrival-time Priority A 2 1 3 B 8 0 2 C 3 1 2 D 12 2 1 Note: A lower priority number indicates a higher priority For each of the following CPU scheduling algorithms, determine the turnaround and wait times for each process as well as the average wait and turnaround times. 2. Round Robin with quantum=2 ms (assume 1ms = 1 CPU Burst) Continuation of https://www.chegg.com/homework-help/questions-and-answers/refer-information-provided-process-burst-arrival-priority-time-2-1-3-b-8-0-2-3-1-2-d-12-2--q58716840
The following processes are being scheduled using a preemptive, round-robin scheduling algorithm. (20 Marks) Process    ...
The following processes are being scheduled using a preemptive, round-robin scheduling algorithm. Process     Priority Burst Time Arrival P1 40 20 0 P2 30 25 25 P3 30 15 30 P4 35 10 60 P5 5 10 100 P6 10 10 105 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified...
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling for these jobs. [3 Marks] Answer (a) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16...