N-Step-SCAN
From Wikipedia, the free encyclopedia
N-Step-SCAN is a disk scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests. It segments the request queue into subqueues of length N. Breaking the queue into segments of N requests makes service guarantees possible. Subsequent requests entering the request queue won't get pushed into N sized subqueues which are already full by the elevator algorithm. As such, starvation is eliminated and guarantees of service within N requests is possible.
[edit] Analysis
N-Step-SCAN along with FSCAN prevents from "arm stickiness" unlike from SSTF, SCAN, and C-SCAN.
