{
  "id": 20808885,
  "title": "The Elevator Algorithm: Why SSTF Starvation Forced SCAN Scheduling",
  "url": "https://urgent.news/2026/11/19/the-elevator-algorithm-why-sstf-starvation-forced-scan-scheduling",
  "topic": "tech",
  "section": "Tech",
  "published": "2026-11-19T21:51:42.000Z",
  "source": {
    "name": "Dev.to",
    "slug": "dev-to",
    "url": "https://dev.to/binarydose/the-elevator-algorithm-why-sstf-starvation-forced-scan-scheduling-4h5k"
  },
  "original_language": "en",
  "account": null,
  "summary": "The Elevator Algorithm, also known as SCAN, was developed to address the issue of disk access latency caused by Seek Time in magnetic disk storage controllers and enterprise storage arrays. Traditional disk scheduling algorithms, such as First-Come, First-Served (FCFS) and Shortest Seek Time First (SSTF), optimize for minimizing total head movement but introduce severe starvation issues. FCFS can result in oscillating head movements, while SSTF can cause requests far from the current head position to starve. To eliminate starvation while preserving high throughput, the SCAN algorithm was adopted, mimicking an architectural elevator by sweeping continuously in one direction and servicing all pending requests along its path. Upon reaching the end boundary, the actuator arm reverses direction and sweeps backward, ensuring every request is guaranteed service within a bounded maximum of two full disk sweeps.",
  "key_points": [],
  "editors_take": null,
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}