Notification: Our email services are now fully restored after a brief, temporary outage caused by a denial-of-service (DoS) attack. If you sent an email on Dec 6 and haven't received a response, please resend your email.
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
Reseach Article

Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)

by Sourav Kumar Bhoi, Sanjaya Kumar Panda, Imran Hossain Faruk
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 40 - Number 11
Year of Publication: 2012
Authors: Sourav Kumar Bhoi, Sanjaya Kumar Panda, Imran Hossain Faruk
10.5120/5010-7329

Sourav Kumar Bhoi, Sanjaya Kumar Panda, Imran Hossain Faruk . Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA). International Journal of Computer Applications. 40, 11 ( December 2012), 28-35. DOI=10.5120/5010-7329

@article{ 10.5120/5010-7329,
author = { Sourav Kumar Bhoi, Sanjaya Kumar Panda, Imran Hossain Faruk },
title = { Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA) },
journal = { International Journal of Computer Applications },
issue_date = { December 2012 },
volume = { 40 },
number = { 11 },
month = { December },
year = { 2012 },
issn = { 0975-8887 },
pages = { 28-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume40/number11/5010-7329/ },
doi = { 10.5120/5010-7329 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:28:24.827960+05:30
%A Sourav Kumar Bhoi
%A Sanjaya Kumar Panda
%A Imran Hossain Faruk
%T Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)
%J International Journal of Computer Applications
%@ 0975-8887
%V 40
%N 11
%P 28-35
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Management of disk scheduling is a very important aspect of operating system. Performance of the disk scheduling completely depends on how efficient is the scheduling algorithm to allocate services to the request in a better manner. Many algorithms (FIFO, SSTF, SCAN, C-SCAN, LOOK, etc.) are developed in the recent years in order to optimize the system disk I/O performance. By reducing the average seek time and transfer time, we can improve the performance of disk I/O operation. In our proposed algorithm, Optimize Disk Scheduling Algorithm (ODSA) is taking less average seek time and transfer time as compare to other disk scheduling algorithms (FIFO, SSTF, SCAN, C-SCAN, LOOK, etc.), which enhances the efficiency of the disk performance in a better manner.

References
  1. H. M. Deitel, “Operating Systems”, 2nd Edn., Pearson Education Pte. Ltd., 2002, ISBN 81-7808-035-4.
  2. W. Stallings, “Operating Systems”, 4th Edn., Pearson Education Pte. Ltd., 2007, ISBN 81-7808-503-8.
  3. A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles”, 7th Edn., John Wiley and Sons, 2008, ISBN 978-81-265-0962-1.
  4. Z. Dimitrijevic, R. Rangaswami and E. Y. Chang, “Support for Preemptive Disk Scheduling”, IEEE Transactions on computers, Vol. 54, No. 10, Oct 2005.
  5. C. Tsai, T. Huang, E. Chu, C. Wei and Y. Tsai, “An Efficient Real-Time Disk-Scheduling Framework with Adaptive Quality Guarantee”, IEEE Transactions on computers, Vol. 57, No. 5, May 2008.
  6. D. L. Martens and M. J. Katchabaw, “Optimizing System Performance Through Dynamic Disk Scheduling Algorithm Selection”, Department of Computer Science, The University of Western Ontario, London, Canada.
  7. B. L. Worthington, G. R. Ganger and Y. N. Patt, “Scheduling Algorithms for Modern Disk Drives”, Appeared in the Proceedings of the ACM Sigmetrics Conference, May 1994, pp. 241-251.
  8. A. Muqaddas, H. Abdulsalam, and A. Salman, “S-LOOK: A Preemptive Disk Scheduling Algorithm for Offline and Online Environments”, CSIT, Lviv, Ukraine, 15-17th Oct 2009, pp. 1-4.
  9. W. A. Burkhard and J. D. Palmer, “Rotational Position Optimization (RPO) Disk Scheduling”, FAST, Monterey, California, 28-29th Jan 2002.
  10. C. Staelin, G. Amir, D. B. Ovadia, R. Dagan, M. Melamed and D. Staas, “Real-time disk scheduling algorithm allowing concurrent I/O requests”, HP Laboratories, HPL-2009-344.
  11. M. Andrews, M. A. Bender and L. Zhang, “New Algorithms For Disk Scheduling”.
Index Terms

Computer Science
Information Sciences

Keywords

Disk Scheduling Sorting Seek Time Transfer Time Average Seek Time