Open In App
Related Articles

GATE | GATE-CS-2007 | Question 85

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.

     Group I                          Group II
(P) Gang Scheduling              (1) Guaranteed Scheduling
(Q) Rate Monotonic Scheduling    (2) Real-time Scheduling
(R) Fair Share Scheduling        (3) Thread Scheduling
(A)

P – 3 Q – 2 R – 1

(B)

P – 1 Q – 2 R – 3

(C)

P – 2 Q – 3 R – 1

(D)

P – 1 Q – 3 R – 2



Answer: (A)

Explanation:

Gang scheduling for parallel systems that schedules related threads or processes to run simultaneously on different processors. 
Rate monotonic scheduling is used in real-time operating systems with a static-priority scheduling class. The static priorities are assigned on the basis of the cycle duration of the job: the shorter the cycle duration is, the higher is the job’s priority. 
Fair Share Scheduling is a scheduling strategy in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution among processes. It is also known as Guaranteed scheduling. 

See question 2 of http://www.geeksforgeeks.org/operating-systems-set-12/



Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads