Call for Paper - November 2023 Edition
IJCA solicits original research papers for the November 2023 Edition. Last date of manuscript submission is October 20, 2023. Read More

Design and Performance Evaluation of Median Range Scheduling Algorithm

Print
PDF
 
Download Full Text
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 172 - Number 4
Year of Publication: 2017
Authors:
Jainil Vachhani, Yash Turakhia
10.5120/ijca2017915124

Jainil Vachhani and Yash Turakhia. Design and Performance Evaluation of Median Range Scheduling Algorithm. International Journal of Computer Applications 172(4):6-8, August 2017. BibTeX

@article{10.5120/ijca2017915124,
	author = {Jainil Vachhani and Yash Turakhia},
	title = {Design and Performance Evaluation of Median Range Scheduling Algorithm},
	journal = {International Journal of Computer Applications},
	issue_date = {August 2017},
	volume = {172},
	number = {4},
	month = {Aug},
	year = {2017},
	issn = {0975-8887},
	pages = {6-8},
	numpages = {3},
	url = {http://www.ijcaonline.org/archives/volume172/number4/28237-2017915124},
	doi = {10.5120/ijca2017915124},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Disk system performance can be dramatically improved by dynamically scheduling, ordering and pending requests. Past analysis of disk scheduling algorithms has to largely experimental with little effort to develop algorithms with measurable performance guarantees. In this paper, the authors propose an algorithm that reduces average seek time. Then the proposed algorithm is compared with conventional scheduling algorithm and measurable evidence is provided for the same. Our results and calculations show that the proposed algorithm will improve the performance of the disk by reducing average seek time and thereby providing a faster disk subsystem

References

  1. 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–251.
  2. M. M. Kumar and B. R. Rajendra, “An improved approach to maximize the performance of disk scheduling algorithm by minimizing the head movement and seek time using sort mid current comparison (smcc) algorithm,” Procedia Computer Science, vol. 57, pp. 222–231, 2015.
  3. W. Basu and S. Chaudhuri, “Missed deadlines should be consideredproposals for modifying existing real-time disk scheduling algorithms,” International Journal of Advanced Research in Computer Science, vol. 7, no. 3, 2016.
  4. M. Lee, “A disk scheduling algorithms based on the insertion and two-way scan techniques,” International Information Institute (Tokyo). Information, vol. 19, no. 5, p. 1565, 2016.
  5. 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–15.

Keywords

Operating System, Scheduling Algorithm, Optimization.