Operating Systems - Disk Scheduling - SSTF, SCAN, C-SCAN
Which disk scheduling algorithm is best suited when minimizing the average seek time is the primary goal, regardless of request arrival order?
Which disk scheduling algorithm is best suited when minimizing the average seek time is the primary goal, regardless of request arrival order?
easy🔍 Pattern Recognition Q1 of Q15
Step-by-Step Solution
Solution:
Step 1: Understand SSTF's selection criteria
SSTF picks the request closest to the current head position, minimizing immediate seek time.Step 2: Analyze SCAN and C-SCAN behavior
SCAN and C-SCAN prioritize fairness and reduce starvation but do not always minimize average seek time.Step 3: Consider FCFS
FCFS does not reorder requests, often leading to longer average seek times.Final Answer:
Option A -> Option AQuick Check:
SSTF minimizes immediate seek distance, reducing average seek time [OK]
Quick Trick: SSTF always picks closest request to minimize seek time [OK]
Common Mistakes:
MISTAKES- Confusing fairness with seek time optimization
- Assuming SCAN always minimizes seek time
Trap Explanation:
PITFALL- Candidates often think SCAN or C-SCAN minimize seek time due to their systematic approach, but SSTF directly targets shortest seek.
Interviewer Note:
CONTEXT- Tests understanding of algorithm goals: seek time minimization vs fairness.
Master "Disk Scheduling - SSTF, SCAN, C-SCAN" in Operating Systems
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Operating Systems Quizzes