0 votes 0 votes 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 t,u,s s,t,u u,s,t u,t,s Operating System isrodec2017 + – gatecse asked Dec 17, 2017 reopened Jul 11, 2022 by Arjun gatecse 1.8k views answer comment Share Follow See 1 comment See all 1 1 comment reply Arjun commented Jul 11, 2022 reply Follow Share https://gateoverflow.in/1214/gate-cse-2007-question-16 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes A. Gang scheduling : Thread scheduling B. Rate monotonic scheduling : Real-time scheduling C. Fair share scheduling : Guaranteed scheduling A is answer Anu007 answered Dec 20, 2017 selected Feb 9, 2018 by Prashant. Anu007 comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes 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 sh!va answered Jan 10, 2018 sh!va comment Share Follow See all 0 reply Please log in or register to add a comment.