SCAN disk scheduling algorithm:
In SCAN disk scheduling algorithm, head starts from one end of the disk and moves towards the other end, servicing requests in between one by one and reach the other end. Then the direction of the head is reversed and the process continues as head continuously scan back and forth to access the disk. So, this algorithm works as an elevator and hence also known as the elevator algorithm.
As a result, the requests at the mid range are serviced more and those arriving behind the disk arm will have to wait.
LOOK disk scheduling algorithm:
The LOOK algorithm services request similarly as SCAN algorithm meanwhile it also “looks” ahead as if there are more tracks that are needed to be serviced in the same direction. If there are no pending requests in the moving direction the head reverses the direction and start servicing requests in the opposite direction.
The main reason behind the better performance of LOOK algorithm in comparison to SCAN is because in this algorithm the head is not allowed to move till the end of the disk.
Difference between SCAN and LOOK Disk scheduling algorithms:
|SR. NO.||SCAN SCHEDULING||LOOK SCHEDULING|
|1.||This algorithm scans all the cylinder of the disk back and forth.||This is the improved version of SCAN algorithm.|
|2.||Head starts from one end of the disc and move towards the other processing all the requests coming in between. After it reaches the end, The head then reverses it’s direction and move towards the start again processing all the requests arising in between, the same process repeats itself.||Head starts from the first request and moves to the other end processing all the requests arising in between. Once it reaches the last requests at the other end, head reversing it’s direction and returns to the first request processing all the requests in between.|
|3.||It scans all the cylinders from one end to other even if there are no requests at the end.||It scans all the cylinders from first request at the start point to the last request.|
|4.||It causes the head to move till the last section of the disc even when there are no requests.||It does not cause the head to move till the last section of the disc when there is no requests.|
|5.||Less efficient.||Compared to SCAN, LOOK is more efficient.|
|6.||Assume we are going inwards (i.e.towards 0).||Reduce variance compared to SCAN.|
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Difference between FCFS and SCAN disk scheduling algorithms
- Difference between SCAN and CSCAN Disk scheduling algorithms
- SCAN (Elevator) Disk Scheduling Algorithms
- Difference between C-LOOK and C-SCAN Disk Scheduling Algorithm
- Difference between C-SCAN and SSTF Disk Scheduling Algorithm
- N-Step-SCAN disk scheduling
- C-SCAN Disk Scheduling Algorithm
- Difference between LOOK and C-LOOK Disk scheduling algorithms
- Difference between Rotational Latency and Disk Access Time in Disk Scheduling
- Disk Scheduling Algorithms
- FCFS Disk Scheduling Algorithms
- Difference between Transfer Time and Disk Access Time in Disk Scheduling
- Difference between Seek Time and Disk Access Time in Disk Scheduling
- Advantages and Disadvantages of various Disk scheduling algorithms
- Difference between SSTF and LOOK disk scheduling algorithm
- Difference between FCFS and C-LOOK disk scheduling algorithm
- Difference between FCFS and SSTF Disk Scheduling Algorithm
- Difference between Rotational Latency and Transfer Time in Disk Scheduling
- Difference between Seek Time and Rotational Latency in Disk Scheduling
- Difference between Interlaced Scan and Progressive Scan
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.