Register

ISRO2007-17

3,104 views

1 Answer

Best answer
7 votes
7 votes
FIFO with pre-emption = Fair-share scheduling i.e. Round Robin scheduling
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jun 10, 2016
4,700 views
ISRO2007-64, ISRO2008-50
Feedback queues are very simple to implement dispatch tasks according to execution characteristics are used to favour real time tasks require manual intervention to implement properly
Feedback queuesare very simple to implementdispatch tasks according to execution characteristicsare used to favour real time tasksrequire manual intervention to implement...
User Avatar
8 votes
8 votes
2 answers
2
go_editor asked Jun 10, 2016
7,791 views
ISRO2007-43
On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wait time? 5, 12, 9, 18 5, 9, 12, 18 12, 18, 9, 5 9, 12, 18, 5
On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wai...
User Avatar
5 votes
5 votes
3 answers
3
go_editor asked Jun 10, 2016
13,201 views
ISRO2007-12
Consider a job scheduling problem with 4 jobs $J_1, J_2, J_3$ and $J_4$ with corresponding deadlines: $(d_1, d_2, d_3, d_4) = (4, 2, 4, 2)$. Which of the following is not a feasible schedule without violating any job schedule? $J_2, J_4, J_1, J_3$ $J_4, J_1, J_2, J_3$ $J_4, J_2, J_1, J_3$ $J_4, J_2, J_3, J_1$
Consider a job scheduling problem with 4 jobs $J_1, J_2, J_3$ and $J_4$ with corresponding deadlines: $(d_1, d_2, d_3, d_4) = (4, 2, 4, 2)$. Which of the following is not...
User Avatar
21 votes
21 votes
6 answers
4
go_editor asked Jun 10, 2016
12,968 views
ISRO2007-11, GATE CSE 2001 | Question: 1.19
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will resul...
User Avatar
Link Copied!