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
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.