Disk scheduling algorithms determine the order in which disk I/O requests are serviced. These algorithms aim to minimize seek time, which occurs when the disk head needs to move to different positions on the disk. This visualization demonstrates various disk scheduling algorithms and their efficiency in handling different request patterns.
Processes requests in the exact order they arrive, without any optimization.
Always chooses the request that requires the least head movement from current position.
Moves the head in one direction until reaching the end, then reverses direction. Always goes to the disk boundaries.
Similar to SCAN, but when the head reaches one end, it immediately jumps to the other end and continues scanning in the same direction.
Similar to SCAN, but the head only goes as far as the last request in each direction, not all the way to the disk boundaries.
Similar to LOOK, but when the head reaches the last request in one direction, it immediately jumps to the furthest request in the opposite direction and continues in the same initial direction.