CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Improved FCFS (IFCFS) Disk Scheduling Algorithm

by Manish Kumar Mishra
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 13
Year of Publication: 2012
Authors: Manish Kumar Mishra
10.5120/7248-0298

Manish Kumar Mishra . An Improved FCFS (IFCFS) Disk Scheduling Algorithm. International Journal of Computer Applications. 47, 13 ( June 2012), 20-24. DOI=10.5120/7248-0298

@article{ 10.5120/7248-0298,
author = { Manish Kumar Mishra },
title = { An Improved FCFS (IFCFS) Disk Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 13 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 20-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number13/7248-0298/ },
doi = { 10.5120/7248-0298 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:41:46.570737+05:30
%A Manish Kumar Mishra
%T An Improved FCFS (IFCFS) Disk Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 13
%P 20-24
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Since the time movable head disk came into existence, the I/O performance has been improved by proper scheduling of disk accesses. Disk scheduling involves a careful examination of pending requests to determine the most efficient way to service the requests. The two most common types of scheduling are seek optimization and rotational (or latency) optimization. Most of the scheduling algorithms concentrate on reducing seek times for a set of requests, because seek times tend to be an order of magnitude greater than latency times. Some of the most important scheduling algorithms are First-Come-First-Served (FCFS), Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. FCFS is the simplest form of disk scheduling algorithm. This algorithm is simple to implement, but it generally does not provide the fastest service. This paper describes an improvement in FCFS. A simulator program has been designed and tested the improved FCFS. After improvement in FCFS it has been found that the service is fast and seek time has been reduced drastically.

References
  1. H. M. Deitel, "Operating Systems", 2nd Edn. , Pearson Education Pte. Ltd. , 2002, ISBN 81-7808-035-4.
  2. Sourav Kumar Bhoi, Sanjaya Kumar Panda, and Imran Hossain Faruk, "Design and Performance Evaluation of an Optimized Disk Schedduling Algorithm (ODSA)", International Journal of Computer Applications, Vol. 40, No. 11, Feb 2012, pp. 28-35.
  3. A. Silberschatz, P. B. Galvin, and G. Gagne, "Operating System Concepts", 7th Edn. , John Wiley and Sons Inc, 2005, ISBN 0-471-69466-5.
  4. W. Stallings, "Operating Systems", 4th Edn. , Pearson Education Pte. Ltd. , 2007, ISBN 81-7808-503-8.
  5. Robert Geist, Stephen Daniel, "A Continuum of Disk Scheduling Algorithms" ACM Transactions on Computer Systems" Vol. 5, No. 1, Feb 1987, pp. 77-92
  6. 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.
  7. A. L. N. Reddy, Jim Wyllie and K. B. R. Wijayaratne, "Disk Scheduling in a Multimedia I/O System" ACM Transactions on Multimedia Computing, Communications and Applications" Vol. 1, No. 1, Feb 2005, pp. 37-59
Index Terms

Computer Science
Information Sciences

Keywords

Disk Scheduling Seek Time Average Seek Time Fcfs Ifcfs

Powered by PhDFocusTM