ISRO-DEC2017-61

Question

Consider the following scheduling:
 

A.	Gang scheduling	s.	Guaranteed scheduling
B.	Rate monotonic scheduling	t.	Thread scheduling
C.	Fair share scheduling	u.	Real-time scheduling

Matching the table in the order $A,B,C$ gives

• A. t,u,s
• B. s,t,u 
• C. u,s,t
• D. u,t,s

Comments

https://gateoverflow.in/1214/gate-cse-2007-question-16

Answer 1

A.	Gang scheduling          : Thread scheduling
B.	Rate monotonic scheduling : Real-time scheduling
C.	Fair share scheduling : Guaranteed scheduling

A is answer

Answer 2

Gang scheduling	Schedules related threads to run simultaneously on different processors
Rate-monotonic scheduling (RMS)	Shorter duration job has higher priority. Simple to implement but not flexible; Not much overhead
Fair Share Scheduling	CPU usage is equally distributed among system users or groups not to the processes

answer is A