Round Robin

Prakhar Singh Gaharw asked Oct 21, 2018

441 views

0 votes

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.

Operating System
operating-system
round-robin-scheduling
process-scheduling

+ –

Prakhar Singh Gaharw asked Oct 21, 2018

Prakhar Singh Gaharw

441 views

See all

1 1 comment

saxena0612

commented Oct 21, 2018

Please post question correctly.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

3 answers

Mrityudoot asked Jan 24

304 views

Operating System Round Robin
Does Round Robin guarantee bounded waiting?

Does Round Robin guarantee bounded waiting?

Mrityudoot

304 views

Mrityudoot asked Jan 24

Operating System
operating-system
round-robin-scheduling
process-scheduling

+ –

0 votes

1 answer

anupamsworld asked Jun 6, 2022

1,366 views

Operating System | Process Scheduling | Round Robin
Lets consider one situation where, OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue is also P1 (this case is possible in Round Robin). ... take place in Round Robin scheduling method with quantum=3unit for the given data below. AT=Arrival Time, BT=Burst Time

Lets consider one situation where,OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue ...

anupamsworld

1.4k views

anupamsworld asked Jun 6, 2022

Operating System
operating-system
process-scheduling
round-robin-scheduling
context-switch

+ –

3 votes

3 answers

Karan Dodwani 1 asked Aug 22, 2018

2,681 views

Round Robin Scheduling
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 ... ii. Response time of the 1st Request of the last Process. iii. Response time of the subsequent request of any process.

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 co...

Karan Dodwani 1

2.7k views

Karan Dodwani 1 asked Aug 22, 2018

Operating System
round-robin-scheduling
process-scheduling
operating-system

+ –

6 votes

1 answer

sunil sarode asked Nov 15, 2017

11,351 views

CPU efficiency in round robin algorithm
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 ... Can somebody please explain option c and hence option D with example ,Thanks and sorry if it is naive question :)

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 t...

sunil sarode

11.4k views

sunil sarode asked Nov 15, 2017

Operating System
round-robin-scheduling
operating-system
context-switch
process-scheduling

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

1 1 comment