edited by
9,705 views
37 votes
37 votes

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.$$\begin{array}{|ll|ll|} \hline \rlap{\textbf{Group I} }&& \rlap{\textbf{Group II}} \\\hline \text{(P)}&\text{Gang Scheduling} & \text{(1) }&\text{Guaranteed Scheduling} \\\hline
 \text{(Q)}&\text{Rate Monotonic Scheduling} & \text{(2)}&\text{Real-time Scheduling} \\\hline 
\text{(R)}&\text{Fair Share Scheduling} & \text{(3)}&\text{Thread Scheduling} \\\hline  \end{array}$$

  1. $P-3; Q-2; R-1$
  2. $P-1; Q-2; R-3$
  3. $P-2; Q-3; R-1$
  4. $P-1; Q-3; R-2$
edited by

2 Answers

Best answer
42 votes
42 votes
32 votes
32 votes

rate-monotonic scheduling (RMS) is a priority assignment algorithm used in real-time operating systems(RTOS) with a static-priority scheduling class

gang scheduling is a scheduling algorithm for parallel systems that schedules related threads or processesto run simultaneously on different processor.

Fair-share scheduling is a scheduling algorithm for computer operating systems in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution among processes.

Answer:

Related questions

24 votes
24 votes
4 answers
1
Kathleen asked Sep 21, 2014
8,132 views
An operating system used Shortest Remaining System Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following process...
16 votes
16 votes
4 answers
2
go_editor asked Apr 23, 2016
6,505 views
A process, has been allocated $3$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequenc...