Which of the following techniques is used in time-sharing systems to ensure fair CPU
allocation?
-
A.
First-come-first-served scheduling
-
B.
Priority scheduling
-
C.
Shortest job first scheduling
-
D.
Round-robin scheduling
Correct Answer:
D. Round-robin scheduling
Explanation:
The correct answer is Round-robin scheduling.
In time-sharing operating systems, the goal is to provide multiple users or tasks with the illusion of simultaneous execution and a quick response time. Round-robin scheduling is the primary technique used to achieve this fairness. It works by dividing CPU time into small, fixed units called time slices or quanta. Each process in the ready queue is given access to the CPU for one time slice in a circular, turn-based order.
If a process does not finish within its allotted time, the operating system preempts it and moves it to the back of the queue, allowing the next process to run. This ensures that every task receives an equal share of processing power and prevents any single long-running job from monopolizing the system, which is essential for maintaining an interactive and equitable environment for all users.
Click below to open Discussion & Feedback
0 Issues
Please
login to comment or Report Issues.