Register

Scheduling algorithms

3,964 views
1 1 vote
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin timesharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms ?

 

a)TQ=15ms

b)TQ=40ms

c)TQ=50ms

D)TQ=45ms

1 Answer

1 1 vote
i think all will give same response tym becz all the tym quantums are larger than the burst tym of process ....so we can choose least of them i.e 15
Voting & Accepting an answer helps improve the community
← Previous · Made easyNext → · sorting
← Previous in category · Virtual memoryNext in category → · OS Kernel
Position:
Show:

Related questions

0 0 votes
0 0 answers
308
308 views
Suleiman_Rock'n_Roll asked Feb 3
308 views
Operating Systems Concepts 5.3 Scheduling Algorithms.
I want to understand how will priority scheduling + round robin for ties will prevent indefinite blocking?
1 1 vote
0 0 answers
644
644 views
Anant Mishra asked Jun 19, 2024
644 views
Operating-system: Scheduling Algorithms
six jobs are waiting to be run . the expected running times are 9,7,5,2,1 and x respectively. where 5<x<7 & the average comp.time is 13. find the value of x using sjf alg...
1 1 vote
1 1 answer
647
647 views
Praks Sharma asked Jul 13, 2017
647 views
Process Scheduling Algorithms
With the use of SRTF the execution of three processes is as follows, the process A is scheduled first and A has been running for 6 units of time, the process B arrives ru...
0 0 votes
1 1 answer
703
703 views
anonymous asked Jan 19, 2016
703 views
CPU Scheduling Algorithms
Consider three processes, all arriving at time zero, with total execution time of l0,20and 30units, respectively. Each process spends the first 20% of the execution time ...