Understanding Disk Scheduling FIFO Algorithm
Uploaded by
dharekasaravanasamy06Understanding Disk Scheduling FIFO Algorithm
Uploaded by
dharekasaravanasamy06Understanding Disk
Scheduling: FIFO
Algorithm
Explore the First-In, First-Out (FIFO) disk scheduling algorithm. It is
the simplest method and serves as a baseline for comparison with
other algorithms.
DHARSHINI PRIYA R D
727326BSC063
Understanding Disk
Scheduling
Goal Requests
Minimize disk access and IO requests arrive
seek time for efficiency unpredictably on the disk
queue
Scheduling
Algorithms decide the order requests get serviced
FIFO Scheduling: How it
Works
Order of Service No Optimization
Requests served strictly Does not prioritize or
in the order they arrive minimize head
movement
Simplicity
Very easy to implement with minimal logic
FIFO Example
Request Queue 98, 183, 37, 122, 14, 124, 65, 67
Initial Head Position 53
Total Head Movement 640 cylinders
Visualizing FIFO
The head moves sequentially, traveling long distances and causing large seek times.
Total head movement sums up to 640 cylinders in this example.
FIFO Advantages and
Disadvantages
Advantages
• Simple and straightforward
• Fair to all requests
• Easy to implement
Disadvantages
• Poor efficiency, long seek times
• Can cause performance bottlenecks
• Prone to the "elevator effect"
FIFO vs. Other Algorithms
SSTF
Chooses nearest request, reduces seek time but risks starvation.
SCAN
Moves head back and forth for uniform servicing, less starvation.
C-SCAN
Moves in one direction, resets quickly, more overhead.
Performance
Depends heavily on request arrival patterns.
Conclusion
FIFO is basic and fair but not optimal for performance.