CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Design and Performance Evaluation of Median Range Scheduling Algorithm

by Jainil Vachhani, Yash Turakhia
journal cover thumbnail

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, Yash Turakhia . Design and Performance Evaluation of Median Range Scheduling Algorithm. International Journal of Computer Applications. 172, 4 ( Aug 2017), 6-8. DOI=10.5120/ijca2017915124

@article{ 10.5120/ijca2017915124,
author = { Jainil Vachhani, Yash Turakhia },
title = { Design and Performance Evaluation of Median Range Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Aug 2017 },
volume = { 172 },
number = { 4 },
month = { Aug },
year = { 2017 },
issn = { 0975-8887 },
pages = { 6-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume172/number4/28237-2017915124/ },
doi = { 10.5120/ijca2017915124 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:19:25.189528+05:30
%A Jainil Vachhani
%A Yash Turakhia
%T Design and Performance Evaluation of Median Range Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 172
%N 4
%P 6-8
%D 2017
%I Foundation of Computer Science (FCS), NY, 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.
Index Terms

Computer Science
Information Sciences

Keywords

Operating System Scheduling Algorithm Optimization.

Powered by PhDFocusTM