| Full Form |
Shortest Seek Time First |
Circular LOOK |
| Operation Principle |
Serves the task request closest to the current position of the head |
The head starts from the first request in one direction and moves towards the last request at the other end, then jumps to the beginning of the requests and continues serving in the same direction |
| Efficiency |
Very efficient in total seek time |
Efficient for systems with specific workloads; may have some inefficiency if requests are scattered |
| Head Movement |
Minimizes total head movement by choosing the closest request |
Jumps from one end to the other, ignoring requests in between in the opposite direction, potentially resulting in more head movement |
| Handling Requests |
Prioritizes requests based on proximity to the current head position |
Serves requests in a continuous sweeping motion in one direction, skipping over some requests in the opposite direction |
| Fairness |
Efficient but may not be as fair in handling all requests |
May not provide as fair a distribution of service to all requests |
