reopened by
1,755 views
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

  1. t,u,s
  2. s,t,u 
  3. u,s,t
  4. u,t,s
reopened by

2 Answers

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

selected by
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

Answer:

Related questions

6 votes
6 votes
2 answers
1
gatecse asked Dec 17, 2017
3,131 views
A counting semaphore was initialized t o $7$. Then $\text{20 P (wait)}$ operations and$\text{x V (signal)}$ operations were completed on this semaphore. If the final valu...
2 votes
2 votes
1 answer
3
gatecse asked Dec 17, 2017
2,923 views
Consider the following table :$\begin{array}{|l|l|l|} \hline \textbf{A.} & \text{Activation record} & \textbf{p.} & \text{Linking loader} \\\hline \textbf{B.} & \text{Loc...