Home › GATE CSE › computerscience › Operating Systems › ROUND-ROBIN (RR) scheduling improves response ti…
ROUND-ROBIN (RR) scheduling improves response time by
Arunning each job to completion before switching
Balways picking the highest-priority job
Crunning shorter jobs first
Drunning each job for a small slice, then switching
Answer & Solution
Correct answer: D. running each job for a small slice, then switching
1. OSTEP §7.6 (Round Robin): RR runs each job for a TIME SLICE (or quantum), then SWITCHES to the next job in a circular queue.
2. This dramatically improves RESPONSE TIME (time from arrival to first run) compared to FIFO/SJF.
3. Trade-off: RR has WORSE TURNAROUND TIME than SJF/STCF because every job's completion is delayed by sharing the CPU.
4. The CHOICE OF TIME SLICE matters: too short → too much context-switching overhead; too long → response time worsens (approaching FIFO).
5. Options A, C, D describe other scheduling policies, not RR.
_Source: OSTEP Ch 7, §7.6 (Round Robin), p. 7-8._
Related questions
On a MULTI-CORE system, a SPIN LOCK is generallyDisabling INTERRUPTS as a way to implement mutual exclusion on a single-CPU system isA LIVELOCK differs from a DEADLOCK in thatSuppose thread A acquires lock L1, then thread B acquires lock L2. Now A tries to acquire Without atomic hardware support, building a correct mutual-exclusion lock for $N \geq 2$ tA CRITICAL SECTION isLinux's `pthread_mutex_lock()` is typically implemented as a HYBRID:What is the PRIMARY problem with using a SPIN LOCK on a SINGLE-CPU uniprocessor system (wi