Scribd
Upload
477 views

Disk Scheduling Algorithms

This document discusses and compares several disk scheduling algorithms: 1) First Come First Served (FCFS) has the longest seek time but is easy to program. 2) Shortest Seek Time First (SSTF) has the shortest seek time but can be more complex. 3) SCAN and C-SCAN algorithms move the disk arm across the disk in one direction before reversing, providing more uniform wait times than FCFS or SSTF. 4) LOOK and C-LOOK are variants of SCAN that reverse direction after reaching the final request in each direction rather than traversing the full disk.

Uploaded by

shubham
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
477 views

Disk Scheduling Algorithms

This document discusses and compares several disk scheduling algorithms: 1) First Come First Served (FCFS) has the longest seek time but is easy to program. 2) Shortest Seek Time First (SSTF) has the shortest seek time but can be more complex. 3) SCAN and C-SCAN algorithms move the disk arm across the disk in one direction before reversing, providing more uniform wait times than FCFS or SSTF. 4) LOOK and C-LOOK are variants of SCAN that reverse direction after reaching the final request in each direction rather than traversing the full disk.

Uploaded by

shubham
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

INDEX

Introduction
Types of disk Scheduling Algorithm
1. First Come First Served Scheduling
Algorithm(FCFS)
2. Shortest Seek Time First Scheduling
Algorithm(SSTF)
3. SCAN Scheduling Algorithm/Elevator
Algorithm
C-SCAN Scheduling Algorithm
4. LOOK Scheduling Algorithm
C-LOOK Scheduling Algorithm
INTRODUCTON
1. Seek Time:-
“Seek time is the time for disk arm to move the
heads to the track containing desired sector”.
2. Rotational Latency:-
“Rotational Latency is the additional time for
disk to rotate desired sector to the disk head”.
3. Bandwidth:-
“The disk bandwidth is total number of bytes
transferred , divided by the total time between
the first request for service and the completion of
last transfer”.
1.First Come First Served Scheduling Algorithm(FCFS):-
This algorithm is easy to program, but generally does not
provide the fastest service.
QUEUE:-98,183,37,122,14,124,65,67
Head start at:-53
0 14 37 53 65 67 98 122 124 183

Seek Distance

Total head movement=45+85+146+85+108+110+59+2


=640 tracks.
2. Shortest Seek Time First disk scheduling algorithm(SSTF):-
The SSTF algorithm selects the request with the minimum
Seek time from current head position.
QUEUE:-98,183,37,122,14,124,65,67
Head starts at:-53
0 14 37 53 65 67 98 122 124 183

59 Seek Distance

Total head movement are=12+2+30+23+84+24+2+59


=236 tracks.
3. SCAN scheduling algorithm/Elevator algorithm:-
The disk arm starts at one end of disk and moves towards the
other end, servicing as it reaches each track until it gets to the other
end of disk.
QUEUE:-98,183,37,122,14,124,65,67
Head starts at:-53
0 14 37 53 65 67 98 122 124 183
16
23
51 2 31 24 2 59 Seek Distance

Total head movement=16+23+51+2+31+24+2+59


=208 tracks.
4.C-SCAN Scheduling:-
Circular –SCAN is a variant of scan designed to provide a
more uniform wait time.
QUEUE:-98,183,37,122,14,124,65,67
Head starts at:-53
0 14 37 53 65 67 98 122 124 183
12
2
31
24
2
59

169 23 Seek distance

Total head movements=12+2+31+24+2+59+169+23


=322 tracks.
5. LOOK Scheduling Algorithm:-
Both SCAN and C-SCAN move disk arm across the full
width of disk. Arm goes only as far as the final request in each
direction. Then it reverses direction .
QUEUE:-98,183,37,122,14,124,65,67
Head starts at=53
0 14 37 53 65 67 98 122 124 183
12
2
31
24
2
59
23 146
Seek Distance

Total head movement=12+2+31+24+2+59+23+146


=299 tracks.
6. C-LOOK Scheduling Algorithm:-
QUEUE:-98,183,37,122,14,124,65,67
Head starts at=53
0 14 37 53 65 67 98 122 124 183
12
2
31
24
2
169 59
23
Seek Distance
Total head movement=12+2+31+24+2+59+169+23
=322 tracks.

You might also like