Consider the following Scheduling: Matching the table in the order A,B,C gives:

2017

Consider the following Scheduling:

image.png

Matching the table in the order A,B,C gives:

  1. A.

    t, u, s

  2. B.

    s, t, u

  3. C.

    u, s, t

  4. D.

    u, t, s

Attempted by 222 students.

Show answer & explanation

Correct answer: A

Gang scheduling (A) schedules related threads together, matching Thread scheduling (t). Rate Monotonic scheduling (B) is a priority-based algorithm for hard Real time systems, matching Real time scheduling (u). Fair share scheduling (C) ensures resource allocation guarantees, matching Guaranteed scheduling (s). Thus, the order for A, B, C is t, u, s.

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Isro