Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
6Activity
0 of .
Results for:
No results containing your search query
P. 1
Disk Scheduling Algorithms

Disk Scheduling Algorithms

Ratings: (0)|Views: 3,754|Likes:
Published by Lokesh Kumar

More info:

Published by: Lokesh Kumar on Mar 11, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

12/17/2012

pdf

text

original

 
Disk Scheduling Algorithms
work queue
: list of disk operations requested1.
FCFS
(First Come, First Served)
o
 perform operations in order requested
o
no reordering of work queue
o
no
starvation
: every request is serviced
o
 poor performance2.
SSTF
(Shortest Seek Time First)
o
after a request, go to the closest request in the work queue, regardless of direction
o
reduces total seek time compared to FCFS
o
Disadvantages
starvation
is possible; stay in one area of the disk if very busy
switching directions slows things down3.
SCAN
 
o
go from the outside to the inside servicing requests and then back from theoutside to the inside servicing requests.
o
repeats this over and over.
o
reduces variance compared to SSTF.4.
LOOK 
 
o
like SCAN but stops moving inwards (or outwards) when no morerequests in that direction exist.5.
C-SCAN
(circular scan)
o
moves inwards servicing requests until it reaches the innermost cylinder;then jumps to the outside cylinder of the disk without servicing anyrequests.
o
repeats this over and over.
o
variant: service requests from inside to outside, and then skip back to theinnermost cylinder.6.
C-LOOK 
 
o
moves inwards servicing requests until there are no more requests in thatdirection, then it jumps to the outermost outstanding requests.
o
repeast this over and over.
o
variant: service requests from inside to outside, then skip back to theinnermost request.
 Howard HamiltonWed Feb 2 10
 
Examples of Disk Scheduling Algorithms
 Work Queue
: 23, 89, 132, 42, 187
there are 200 cylinders numbered from 0 - 199
the diskhead stars at number 100
1.
FCFS
 total time is estimated by total arm motion2.
SSTF
 3.
SCAN
 
o
assume we are going inwards (i.e., towards 0)
 
4.
LOOK 
 
o
reduce variance compared to SCAN5.
C-SCAN
 

Activity (6)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Hell Dex liked this
khagubrt liked this
Nirali Dutiya liked this
geetikas liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->