Research Article
Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 40 - Issue 11 |
| Published: December 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 },
year = { 2012 },
volume = { 40 },
number = { 11 },
pages = { 28-35 },
doi = { 10.5120/5010-7329 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Sourav Kumar Bhoi
%A Sanjaya Kumar Panda
%A Imran Hossain Faruk
%T Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)%T
%J International Journal of Computer Applications
%V 40
%N 11
%P 28-35
%R 10.5120/5010-7329
%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
- H. M. Deitel, “Operating Systems”, 2nd Edn., Pearson Education Pte. Ltd., 2002, ISBN 81-7808-035-4.
- W. Stallings, “Operating Systems”, 4th Edn., Pearson Education Pte. Ltd., 2007, ISBN 81-7808-503-8.
- A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles”, 7th Edn., John Wiley and Sons, 2008, ISBN 978-81-265-0962-1.
- Z. Dimitrijevic, R. Rangaswami and E. Y. Chang, “Support for Preemptive Disk Scheduling”, IEEE Transactions on computers, Vol. 54, No. 10, Oct 2005.
- 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.
- 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.
- 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.
- 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.
- W. A. Burkhard and J. D. Palmer, “Rotational Position Optimization (RPO) Disk Scheduling”, FAST, Monterey, California, 28-29th Jan 2002.
- 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.
- M. Andrews, M. A. Bender and L. Zhang, “New Algorithms For Disk Scheduling”.
Index Terms
Keywords