A variation of the round-robin scheduler is the regressive round-robin scheduler. This scheduler assigns each process...

A variation of the round-robin scheduler is the regressive round-robin scheduler. This scheduler assigns each process a time quantum and a priority. The initial value of a time quantum is 50 milliseconds. However, every time a process has been allocated the CPU and uses its entire time quantum (does not block for I/O), 10 milliseconds is added to its time quantum, and its priority level is boosted. (The time quantum for a process can be increased to a maximum of 100 milliseconds.) When a process blocks before using its entire time quantum, its time quantum is reduced by 5 milliseconds, but its priority remains the same. What type of process (CPU-bound or I/O-bound) does the regressive round-robin scheduler favor? Explain.

Expert Solution

The regressive round robin scheduler will favour the CPU-bound processes. Because CPU-bound processes when uses its entire time quantum, they get additionaly 10 milliseconds as time quantum as well as there priority gets boosted.

The regressive round robin scheduler will not favour the I/O-bound processes. Because these processes can be blocked for I/O before consuming the full quota of time quantum, and their priority will not get effected , its mean priority will be same as before.

Amanda K answered 2 years ago

There are n processes in a queue. Each process has namei and timei. The round-robin scheduling...

There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue. For example, we have the following queue with the quantum of 100ms. A(150) - B(80)...

There are n processes in a queue. Each process has namei and timei. The round-robin scheduling...

There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue. For example, we have the following queue with the quantum of 100ms. A(150) - B(80)...

The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...

The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority,with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process Burst Time Arrival Time...

In Linux, under the CFS ( Completely Fairs Scheduler ) Scheduler, whether a process runs immediately...

In Linux, under the CFS ( Completely Fairs Scheduler ) Scheduler, whether a process runs immediately , preempting the currently running process depends upon what factor? Note: Short Answer Please

Describe regressive, proportional, and progressive financing. Explain how each of the following is regressive, proportional, or...

Describe regressive, proportional, and progressive financing. Explain how each of the following is regressive, proportional, or progressive

Question 5 The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each...

Question 5 The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority,with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process Burst Time Arrival Time Priority P1 15 0 8...

In C, write a program that will simulate the operations of the following Round-Robin Interactive scheduling...

In C, write a program that will simulate the operations of the following Round-Robin Interactive scheduling algorithm. It should implement threads for the algorithm plus the main thread using a linked list to represent the list of jobs available to run. Each node will represent a Job with the following information: int ProcessID int time time needed to finish executing The thread representing the scheduler algorithm should continue running until all jobs end. This is simulated using the time variable...

Should an operating system process scheduler treat a process that makes extensive use of a hard-disk...

Should an operating system process scheduler treat a process that makes extensive use of a hard-disk storage device differently from one that makes extensive use of a solid-state storage device? Give your reasons.

A round-robin tournament involving n plays is modeled with digraph D where, for every two distinct...

A round-robin tournament involving n plays is modeled with digraph D where, for every two distinct vertices (players) u and v, either (u,v) is an edge (player u defeats player v) or (v,u) is an edge (player v defeats play u). Prove that if D is acyclic, i.e., no directed cycles, then there always exists a player who has defeated everyone (out-degree is n – 1) and a player who has lost to everyone (in-degree is n – 1).

A round-robin tournament is an event wherein every competing team plays every other team once and...

A round-robin tournament is an event wherein every competing team plays every other team once and only once. Assuming no ties, every game can be depicted on a graph G using a directed edge (x, y), where team x has defeated team y. (a) Assuming n teams participate in a round-robin tournament, how many vertices and edges will graph G depicting the tournament have? (b) Is it preferable to be a source or a sink in graph G? (c) Can...

Question

A variation of the round-robin scheduler is the regressive round-robin scheduler. This scheduler assigns each process...

Solutions

Expert Solution

Related Solutions

There are n processes in a queue. Each process has namei and timei. The round-robin scheduling...

There are n processes in a queue. Each process has namei and timei. The round-robin scheduling...

The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...

In Linux, under the CFS ( Completely Fairs Scheduler ) Scheduler, whether a process runs immediately...

Describe regressive, proportional, and progressive financing. Explain how each of the following is regressive, proportional, or...

Question 5 The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each...

In C, write a program that will simulate the operations of the following Round-Robin Interactive scheduling...

Should an operating system process scheduler treat a process that makes extensive use of a hard-disk...

A round-robin tournament involving n plays is modeled with digraph D where, for every two distinct...

A round-robin tournament is an event wherein every competing team plays every other team once and...