Difference Between SSTF and C-LOOK
SSTF DISK SCHEDULING ALGORITHM | C-LOOK DISK SCHEDULING ALGORITHM |
---|---|
SSTF algorithm can manipulate the requests in both directions. | Whereas, C-LOOK algorithm services the requests only in one direction. |
In SSTF algorithm there is an burden of finding closest request. | Here, this algorithm causes more seek time as compared to SSTF. |
SSTF algorithm lags in performance. | But, the performance of C-LOOK is far better than SSTF. |
In above example of SSTF algorithm, the head starts from 53 and analyse the request which is closest to it and hence moves in that direction. | In above example of C-LOOK algorithm, the head moves from 53, serves all requests in right direction till it reaches the last request in one end. Then it jumps to the remaining requests and serve them in right direction only. |
SSTF algorithm can leads to starvation. | C-LOOK algorithm will never cause starvation to any requests. |
SSTF provides high variance in average waiting time and response time. | Whereas C-LOOK algorithm provides low variance in average waiting time and response time. |
Difference Between SSTF and C-LOOK Disk Scheduling Algorithm
The secondary storage scheduling algorithm known as SSTF decides how the disk’s head and arm will move in response to read and write requests while in C-SCAN the head services request only in one direction(either left or right) until all the requests in this direction are not serviced and then jumps back to the farthest request in the other direction and services the remaining requests which gives a better uniform servicing as well as avoids wasting seek time for going till the end of the disk. You will discover the distinction between the SSTF and C-LOOK disk scheduling algorithms in this post. However, you must first understand the distinctions between the SSTF and C-LOOK disk scheduling algorithms.