search
Log In

Recent questions tagged round-robin

1 vote
2 answers
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
asked Feb 11 in Operating System Lakshman Patel RJIT 145 views
1 vote
1 answer
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$
asked Oct 25, 2019 in Operating System Lakshman Patel RJIT 85 views
2 votes
0 answers
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 __________________
asked Mar 11, 2019 in Operating System srestha 242 views
0 votes
0 answers
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?
asked Jan 4, 2019 in Operating System subho16 104 views
–1 vote
0 answers
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.
asked Oct 21, 2018 in Operating System Prakhar Singh Gaharw 94 views
0 votes
0 answers
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?
asked Oct 12, 2018 in Operating System himanshu6398 103 views
0 votes
0 answers
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 ?
asked Aug 22, 2018 in Operating System Harsh Kumar 1.1k views
3 votes
2 answers
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.
asked Aug 22, 2018 in Operating System Karan Dodwani 1 758 views
0 votes
0 answers
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.]
asked Apr 11, 2018 in Operating System ytr567 433 views
1 vote
1 answer
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
asked Jan 9, 2018 in Operating System sh!va 101 views
2 votes
1 answer
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
asked Jan 2, 2018 in Operating System srestha 468 views
0 votes
1 answer
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
asked Dec 10, 2017 in Operating System Parshu gate 526 views
6 votes
1 answer
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 :)
asked Nov 15, 2017 in Operating System sunil sarode 3k views
1 vote
1 answer
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.
asked Oct 30, 2017 in Operating System manu nandhan 112 views
1 vote
1 answer
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".
asked Oct 28, 2017 in Operating System Rohit Gupta 8 535 views
5 votes
2 answers
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.
asked Aug 26, 2017 in Operating System rahul sharma 5 1.1k views
3 votes
2 answers
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) ?
asked Aug 12, 2017 in Operating System Xylene 2.3k views
0 votes
2 answers
20
What happens to average Turn Around Time if time quantum increased?
asked May 13, 2017 in Operating System AnilGoudar 1.6k views
1 vote
1 answer
22
How many time context switch in Round Robin? ( if only one process remain in ready queue at end of scheduling does that count every time, when time slice over or only one time?)
asked Jan 7, 2017 in Operating System sanyam53 800 views
2 votes
1 answer
23
Find each of the following cases with detailed explanation by an example schedule.d
asked Nov 1, 2016 in Operating System Prabhanjan_1 260 views
To see more, click for the full list of questions or popular tags.
...