Difference between C-SCAN and SSTF Disk Scheduling Algorithm
C-SCAN |
SSTF |
---|---|
C-SCAN algorithm services the requests only in one direction |
SSTF algorithm can handle the requests in both directions. |
This algorithm causes more seek time as compared to SSTF |
In SSTF algorithm, there is an overhead of finding closest request. |
Performance of C-SCAN is far better than SSTF. |
Whereas SSTF lags in performance. |
C-SCAN algorithm provides low variance in average waiting time and response time. |
Whereas SSTF provides high variance in average waiting time and response time. |
C-SCAN algorithm will never cause starvation to any requests. |
SSTF algorithm can cause starvation. |
Difference Between C-SCAN and SSTF Disk Scheduling Algorithm
In C-SCAN Algorithm it is necessary to take into account the direction, i.e., larger or smaller value. This algorithm serves disk requests by moving towards their conclusion while SSTF is a secondary storage scheduling method that decides how the disk’s head and arm will move to fulfil read and write requests. In this article, you will discover the distinction between the SSTF and C-SCAN disk scheduling algorithms in this post. However, you must first understand the distinctions between the SSTF and C-SCAN disk scheduling algorithms.