CFP last date
20 May 2024
Reseach Article

A New Optimized Real-Time Disk Scheduling Algorithm

by Nidhi, Dayashankar Singh
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 93 - Number 18
Year of Publication: 2014
Authors: Nidhi, Dayashankar Singh
10.5120/16433-6046

Nidhi, Dayashankar Singh . A New Optimized Real-Time Disk Scheduling Algorithm. International Journal of Computer Applications. 93, 18 ( May 2014), 7-12. DOI=10.5120/16433-6046

@article{ 10.5120/16433-6046,
author = { Nidhi, Dayashankar Singh },
title = { A New Optimized Real-Time Disk Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 93 },
number = { 18 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 7-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume93/number18/16433-6046/ },
doi = { 10.5120/16433-6046 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:16:02.949220+05:30
%A Nidhi
%A Dayashankar Singh
%T A New Optimized Real-Time Disk Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 93
%N 18
%P 7-12
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, a new approach of disk scheduling has been proposed to improve the throughput of modern storage device. After the invention of disk with movable head, researchers are making efforts continuously to improve the I/O performance by implementing many intelligent scheduling algorithms of disk accesses. Speeds of processor and memory capacity have been increased several times than the speed of the disk. Due to this difference in the speed of processor and the disk, I/O performance of disk has become an important bottleneck. Therefore, it is needed to develop some advanced methods for using disk more efficiently. Management of disk performance is an important aspect of operating system research and development. In this paper, a new disk scheduling algorithm has been developed and implemented to reduce the number of head movements. Experiment has been carried out to compare the performance of proposed algorithm with the performance of all six classical disk scheduling algorithms. Experiment shows that the numbers of head movements in existing classical disk scheduling algorithms such as FCFS, SSTF, SCAN, C-SCAN, LOOK and C-LOOK are high. But in proposed new optimized real-time disk scheduling algorithm, head movements are reduced and hence it maximizes the throughput for the modern storage devices.

References
  1. Operating System Principles, Silberschatz, Peter Bare Galvin, Greg Gagne.
  2. Mordern operating system (2nd edition) Andrew S. Tanenbaum.
  3. Operating Systems: A Concept-based Approach(2E) D. M. Dhamdhere
  4. Sandipon Saha, Md. Nasim Akhter, Mohammod Abul Kashem, "A New Heuristic Disk Scheduling Algorithm" International Journal of Scientific &Technology Research Volume 2, Issue1,pp. 49-53, January 2013
  5. Chang, R. , Shih, W. , And Chnag, R. "Real-time disk scheduling for multimedia application with deadline-modification scheme "International Journal of Time-critical Computing system 19(2000), 149-168.
  6. C. Reummler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3): 17-19, March 1994.
  7. Dees, B. Native Command queuing-advanced performance in desktop storage. Potentials, IEEE 24, 4(2005),4-7.
  8. Huang, Y. , And Huang, J. Disk scheduling on multimedia storage servers. Computers, IEEE Transactions on 53, 1(2004), 77-82.
  9. Reddy, A. L. N. , Wyllie, J. , and Wijyaratne, K. B. R. disk scheduling in a multimedia I/O system. ACM Trans. Multimedia Comput. Commun. Appl. 1, 1(2005), 37-59.
Index Terms

Computer Science
Information Sciences

Keywords

FCFS SSTF SCAN C-SCAN LOOK C-LOOK Scheduling Algorithm Scheduler Disk Head