Yusuf, Gregorius Neven and Istiono, Wirawan (2020) Comparative Analysis of SCAN And CSCAN Disk Scheduling Algorithm. International Journal of Advanced Studies in Computers, Science and Engineering, 9 (5).
Full text not available from this repository.Abstract
Abstract-In operating systems, seek time is very crucial part, because all device requests are linked in queues. Disk Scheduling Algorithms are used to reduce the total seek time of any request to make performance of operating system is faster. A comparison between two disc scheduling algorithm, such as SCAN (Elevator) algorithm and CSCAN (Circular SCAN) algorithm, is tested by exploring the unique character of each algorithm and then it will be decided which algorithm is the best in performing disc scheduling which can be implemented in the operating system. To compare these algorithms, a software named Track Animation will be used. With track animation software we can see a simulation of various disc scheduling algorithms. The result from this research between SCAN and CSCAN shown the CSCAN algorithm produces less seek time compared to the SCAN algorithm. In addition, CSCAN results in more uniform waiting times compared to SCAN, but with difference dataset which have small standard deviations and variance, SCAN algorithm will make disk performance faster and efficient than CSCAN algorithm.
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 15 Oct 2021 06:39 |
| Last Modified: | 15 Oct 2021 06:39 |
| URI: | https://kc.umn.ac.id/id/eprint/18814 |
Actions (login required)
 |
View Item |
