Group 1 contains some CPU scheduling algorithms and Group 2 contains some…

2007

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

  1. A.

    P – 3 Q – 2 R – 1

  2. B.

    P – 1 Q – 2 R – 3

  3. C.

    P – 2 Q – 3 R – 1

  4. D.

    P – 1 Q – 3 R – 2

Attempted by 263 students.

Show answer & explanation

Correct answer: A

Solution:

  • Gang Scheduling → Thread Scheduling. Gang scheduling groups related threads or processes and schedules them to run together across processors, so it is associated with scheduling threads/processes as a unit.

  • Rate Monotonic Scheduling → Real-time Scheduling. Rate Monotonic is a fixed-priority algorithm designed for periodic real-time tasks, so it belongs to real-time scheduling.

  • Fair Share Scheduling → Guaranteed Scheduling. Fair share scheduling ensures each user or group receives a guaranteed share of CPU resources, so it corresponds to guaranteed scheduling.

Final matching: Gang Scheduling — Thread Scheduling; Rate Monotonic Scheduling — Real-time Scheduling; Fair Share Scheduling — Guaranteed Scheduling.

Explore the full course: Gate Guidance By Sanchit Sir