The week's pick
Reseach Article
Design and Simulation of Optimal Range Scheduling Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 177 - Number 6 |
| Year of Publication: 2017 |
| Authors: Jay Mohta, Suraj Patel |
10.5120/ijca2017915791
|
Jay Mohta, Suraj Patel . Design and Simulation of Optimal Range Scheduling Algorithm. International Journal of Computer Applications. 177, 6 ( Nov 2017), 1-4. DOI=10.5120/ijca2017915791
Abstract
Disk Scheduling is performed by operating system to schedule IO requests arriving for disk. Disk system performance can be improved by dynamically scheduling and ordering the pending requests in the queue. Past analysis of the algorithms is experimental on certain datasets and not guaranteeing the optimal performance. In this paper, author proposes a disk scheduling algorithm which aims at reducing the seek time. Then the proposed algorithm is compared with conventional scheduling algorithms and simulated evidences are provided in the paper. Our results show that the proposed algorithm will improve the performance of disk by reducing the average seek time and thereby providing a faster disk subsystem.
References
- B. L.Worthington, G. R. Ganger, and Y. N. Patt, Scheduling algorithms for modern disk drives,. in ACM SIGMETRICS Performance Evaluation Review, vol. 22, no. 1. ACM, 1994, pp. 241 to 251.
- M. Y. Javed and I. Khan, Simulation and performance comparison of four disk scheduling algorithms,. in TENCON 2000. Proceedings, vol. 2. IEEE, 2000, pp. 10 to 15.
- J Vachhani and Y. Turakhia, Design and Performance Evaluation of Median Range Scheduling Algorithm,. in International Journal of Computer Application Volume 172 No4 (August 2017).
Index Terms
Keywords