Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.
View worked solution
Answer: A
To find the correct match, let us analyze each scheduling algorithm in Group I and its corresponding concept in Group II:
- (P) Gang Scheduling → (3) Thread Scheduling
Gang scheduling is a scheduling algorithm for parallel systems that schedules a set of related, tightly-coupled threads (a "gang") to run simultaneously on different processors. This minimizes latency and context-switching overhead among cooperating threads. - (Q) Rate Monotonic Scheduling → (2) Real-time Scheduling
Rate Monotonic Scheduling (RMS) is a classic static-priority scheduling algorithm used in hard real-time systems. It assigns priorities to periodic tasks based on their execution frequency (shorter periods get higher priorities). - (R) Fair Share Scheduling → (1) Guaranteed Scheduling
Fair Share Scheduling divides CPU time equitably among users or groups rather than individual processes. It ensures that each user receives a pre-allocated, guaranteed share of the system resources.
Thus, the correct mapping is:
Hence, the correct option is A.
Free practice · Your answers on this page are not saved.
