Home › GATE CSE › computerscience › Operating Systems › Starvation in SJF (a long job never running) is …
Starvation in SJF (a long job never running) is typically cured by
Aaging: gradually boosting waiting processes' priority
Bswitching the scheduling algorithm to FCFS mid-execution
Cincreasing the RR quantum to infinity
Dduplicating the long process so one copy runs
Answer & Solution
Correct answer: A. aging: gradually boosting waiting processes' priority
Aging adds a time-based boost to each process's effective priority/score, so a process that has waited long enough eventually becomes the highest-priority candidate. This guarantees no process waits forever. Switching algorithms mid-run is rarely done; infinite quantum disables preemption (different problem); duplicating processes is nonsense.
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