Scribd
Upload
96 views16 pages

Os PPT Disk Sheduling 22

Uploaded by

lokeshpatil4889109
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
96 views16 pages

Os PPT Disk Sheduling 22

Uploaded by

lokeshpatil4889109
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 16

SUBJECT – OPERATING SYSTEM

TOPIC - Disk Scheduling


Disk Queues
 Each disk has a queue of jobs waiting to access disk
 read jobs
 write jobs
 Each entry in queue contains the following
 pointer to memory location to read/write from/to
 sector number to access
 pointer to next job in the queue
 OS usually maintains this queue
Disk Queues

Entry 3 Entry 2 Entry 1


Sector Z Sector Y Sector X

Mem Ptr 2 Mem Ptr 1 Mem Ptr 0

next entry next entry next entry

head
tail Disk
First-In, First-Out (FIFO)
 Do accesses in the order in which they are presented to
the disk
 This is very fair to processes
 This is very simple to implement
 Approximates random accesses to disk
 gives rated, average latency for every read
 will have large average seeks between each access
 Not a good policy
FIFO
•Reference String: 5, 35, 2, 14, 12, 21, 3, 9, 22, 20

20 2 22 12 9 6 3 18 21 9 12 2 14 12 2 33 35 30 5

tail head

•Calculation of total seek distance:


30 + 33 + 12 + 2 + 9 + 18 + 6 + 12 + 2 = 124
FIFO

 Obviously, reordering the accesses to the disk could


greatly reduce the seek distance
 seek distance ~ seek time
 Want to put close accesses next to each other in the
queue
Disk Scheduling

 Recall, statistical average seek time is 9 ms


 randomly accessing all over disk
 Multiple requests to disk will arrive while one is being
serviced
 Can drastically reduce average seek time by intelligent
scheduling accesses
Shortest Seek Time First (SSTF)

 When a new job arrives, calculate its seek distance


from the current job
 Place it in disk queue accordingly
 Service the next closest access when the current job
finishes
SSTF
•Reference String: 5, 35, 2, 14, 12, 21, 3, 9, 22, 20

35 13 22 1 21 1 20 6 14 2 12 3 9 7 2 1 3 2 5

tail head

•Calculation of total seek distance:


2 + 1 + 7 + 3 + 2 + 6 + 1 + 1 + 13 = 35
SSTF
 Provides substantial improvement in seek time over
FCFS
 One major issue
 STARVATION
 What if some accesses are on far end of disk from
current access
 jobs are constantly arriving in a real system
 jobs closest to the current access will keep getting serviced
 jobs on the far end will starve
Elevator Algorithm

 Similar to SSTF
 One major difference
 next job scheduled is closest to current job but in one
particular direction
 all jobs in other direction are put at the end of the list
 Similar to an elevator
 it goes up first and then comes back down
Elevator Algorithm
•Reference String: 5, 35, 2, 14, 12, 21, 3, 9, 22, 20

2 1 3 32 35 13 22 1 21 1 20 6 14 2 12 3 9 4 5

tail head

•Calculation of total seek distance:


4 + 3 + 2 + 6 + 1 + 1 + 13 + 32 + 1 = 63
Elevator Algorithm

 Avoids starvation
 Provides very good performance
 Still has one major issue
 FAIRNESS
 Jobs in the middle of the disk get serviced twice as
much as jobs at the ends
One-Way Elevator Algorithm
 Exactly like elevator algorithm except scheduling is done
in only one direction
 for example, elevator always goes “up”
 This will require one long seek after finished going up
 have to go back to the beginning
 This is okay because one long seek doesn’t take very
long
 IBM disk: 15 ms from one end to the other
 This long seek is done infrequently
One-Way Elevator Algorithm
•Reference String: 5, 35, 2, 14, 12, 21, 3, 9, 22, 20

3 1 2 33 35 13 22 1 21 1 20 6 14 2 12 3 9 4 5

tail head

•Calculation of total seek distance:


4 + 3 + 2 + 6 + 1 + 1 + 13 + 33 + 1 = 64

You might also like