# Recent questions tagged round-robin

1 vote
1
Jobs keep arriving at a processor. A job can have an associated time length as well as a priority tag. New jobs may arrive while some earlier jobs are running. Some jobs may keep running indefinitely. A ... the following job-scheduling policies is starvation free? Round - robin Shortest job first Priority queuing Latest job first None of the others
1 vote
2
Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectively wasted (overhead). For round-robin scheduling with quantum $Q$, give a formula for the CPU efficiency for each of the following: $Q = \infty$ $Q > T$ $S < Q < T$ $Q = S$ $Q\: \text{nearly}\: 0$
3
Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.
4
Consider a system having $10$ IO bound jobs and $1$ CPU bound job.. If IO bound job issue an IO request once for every ms of CPU computation and that each IO request takes $10$ ms. If context switch overhead is $0.1$ ms.Using round -robin scheduling with a time quantum of $10$ ms. , the CPU efficiency is __________________
5
In round robin scheduling, which process gets the chance first if a process comes to ready state from running(i.e time quantom getting over) and another from new to ready(i.e due to same arrival time) ? Is there a convention or will it be specified in the question?
–1 vote
6
processes 1,2,3,4,5 with burst time as 4,1,8,1,2 and arrival time as 0+ RoundRobin used with TQ=1 what will be arrival time chart for processes 1,2,3,4,5.
7
Why P1 is still running after 2ms, shouldn't P2 get the cpu burst? In the video they said that are are no processes present other than P1 when the timer interrupts after 2 time slices. Isn't the gantt chart wrong. What i am missing here, can anyone explain it right?
8
The following processes are being scheduled using a preemptive, roundrobin scheduling algorithm. 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 ( ... 't it the case that in Round Robin, we neglect the priorities and schedule only on the basis of time quantum ?
9
Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request consumes 20 ms of CPU time after which it spends 10 ms of time on I/O,thereafter intiates subsequent ... Process. ii. Response time of the 1st Request of the last Process. iii. Response time of the subsequent request of any process.
–1 vote
10
11
In a computing center there are four types of jobs according to their arrival times (in seconds), their priorities and their run times (in seconds); see the table below: -----------------Type 1------ Type 2---- Type 3---- Type 4 arrival ... robin on every priority level - the higher the priority, the sooner they run) scheduling algorithm. [please use a quantum that provides short response time.]
1 vote
12
Three processors with their respective process IDs given by P1, P2 and P3, having estimated completion time of 8 ms, 4 ms and 2 ms, respectively, enter a ready queue together in the order P1, P2 and P3. What is the average turn time in the Round Robin Scheduling Algorithm with time 2 ms? (a) 10 ms (b) 15 ms (c) 20 ms (d) 25 ms
13
Consider 4 processes sharing the CPU in round robin fashion. If context switch time is 1 sec , what must be the time quantum q such that the number of context switches are reduced , but at the same time each process is guaranteed to get the turn at the CPU for every 10 secs? ------------------- ... --------------------------- Ans 2 or 1.5 . Is here any formula used like (n-1)q+ns explain in detail
14
Choose correct answer from the below options: If the following jobs are to be executed on a single processor system The jobs are arrived at time 0 and in the order a, b, c, d, e. Calculate the departure time (completion time) for job ‘a’ if scheduling is round robin with time slice 1 15 5 9 11
15
Measurements of a certain system have shown that a process runs, on the average, for time T before blocking for Input/Output. Process switch requires time S which is overhead. For round robin scheduling with quantum Q, give a formula for the cpu efficiency in each of the ... goes to 0 Can somebody please explain option c and hence option D with example ,Thanks and sorry if it is naive question :)
1 vote
16
Ques: Can Round Robin algorithm be non-preemptive ? My answer: RR with largest Burst Time as Time Quantum is FCFS in nature and its non-preemptive Am I right ? Please corret me if am wrong.
1 vote
17
Round robin will always result in better output compared to FCFS. Is this statement TRUE? I know statement is FALSE when time quantum of RR is greater than longest CPU burst time of all the process, so isn't its answer will be FALSE because it talking of "always".
18
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.Assume that dispatching the process first time is not counted as a context switch.
19
Here what are the number of context switches ? Is it 5 or 6? Do we consider context switch before P1 (i.e during the start) ?
20
What happens to average Turn Around Time if time quantum increased?