The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+19 votes

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


$$\begin{array}{|l|l|} \hline \textbf{Group I} & \textbf{Group II} \\\hline \text{(P) Gang Scheduling} & \text{(1) Guaranteed Scheduling} \\\hline \text{(Q) Rate Monotonic Scheduling} & \text{(2) Real-time Scheduling} \\\hline \text{(R) Fair Share Scheduling} & \text{(3) 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
asked in Operating System by Veteran (52k points)
edited by | 2.4k views
Are these topics present in the current syllabus?

2 Answers

+29 votes
This topics are in syllabus or not
+11 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.

answered by (393 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,541 questions
54,084 answers
70,995 users