Bölüm 11 · SimülatörDisk Scheduling? ← Bölüm 11 FCFS SSTF SCAN C-SCAN LOOK C-LOOK ← Low High →Jump Classic Random 1.5/sHead Max Queue CloseDisk SchedulingPending read/write requests are cylinder numbers. The disk head starts at a given cylinder and the scheduling algorithm decides the order in which requests are served. The chart shows the head position (left to right) over time (top to bottom); the goal is a small total head movement (seek distance).How to usePick an algorithm; for SCAN, C-SCAN, LOOK and C-LOOK also pick the initial direction.Set the head position, the highest cylinder and the request queue (up to 50 requests, separated by spaces), or use a preset.Play or step; the side list shows the pending requests in service order.Compare shows the total head movement of all six algorithms.AlgorithmsFCFSArrival order.SSTFNearest pending request; tie: earlier in queue.SCANSweep to the disk edge, reverse.C-SCANSweep to the edge, jump to the other edge, same direction.LOOKSCAN, but reverse at the last request.C-LOOKC-SCAN, but jump last request → first on the other side.JumpThe return jump serves nothing; the toggle decides whether it counts.HeadRequests at the head's cylinder are served first.Legend head path return jump ✓ served next target ◇ disk edgeKeys←→ stepSpace playHomeEnd first / lastEsc close