Project ForgeGroup 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.
Group 1: P. Gang Scheduling, Q. Rate Monotonic Scheduling, R. Fair Share Scheduling Group 2: 1. Guaranteed Scheduling, 2. Real-time Scheduling, 3. Thread Scheduling
- P-3; Q-2; R-1
- BP-1; Q-2; R-3
- CP-2; Q-3; R-1
- DP-1; Q-3; R-2
Explanation
Gang Scheduling schedules a group of related threads together across processors — a form of Thread Scheduling (3). Rate Monotonic Scheduling assigns priority by period, the classic algorithm for periodic Real-time Scheduling (2). Fair Share Scheduling ensures each user/group gets a guaranteed proportional CPU share — Guaranteed Scheduling (1). So P-3, Q-2, R-1.
Source: GATE CS 2007 (2007)
This question is part of a 15-day revision cycle — sign in and Project Forge will bring it back the day before you'd forget it.