Practice mode Operating Systems

What is the main drawback of SSTF disk scheduling?

Correct answer A. Requests far from the current head position can starve

Explanation

SSTF picks whichever request is nearest to the head. If new requests keep arriving close to the head's current area, a distant request may be postponed indefinitely, just as long jobs can starve under SJF. SCAN and C-SCAN avoid this by sweeping across the disk in a fixed pattern, so every request is served within one or two sweeps.

Report a problem

Answer checked 26 October 2026 How we write and check questions

Tip: press A, B, C or D to answer, and N for the next question.

What is the main drawback of SSTF disk scheduling?

Discussion

Have a question about this answer? Cancel reply

What is the main drawback of SSTF disk scheduling?

More Operating Systems questions

Processes P0 to P3 share resources A, B and C. Allocation: P0 (1,0,1), P1 (2,1,1), P2 (1,0,2), P3 (0,1,0). Maximum: P0 (3,2,2), P1 (3,2,2), P2 (2,1,3), P3 (1,2,2). Available: (1,1,1). Which is a safe sequence under the Banker’s algorithm?

What is the relationship between a safe state and deadlock?

Under the Banker’s algorithm, a process has Maximum demand (7, 5, 3) and currently holds Allocation (0, 1, 0). What is its Need vector?

Three processes share identical units of one resource type, and each may need up to 4 units. What is the minimum number of units that guarantees deadlock cannot occur?

Discussion

Have a question about this answer? Cancel reply