Professional Documents
Culture Documents
ON
“SCAN-
EDF”
Presented by
Rashmi G.Nagdeote
Final Year
(Computer Science & Engineering)
Guided by
PROF.P.B.NIRANJANE
(Dept. of Computer Science &
Engineering)
SCAN-EDF
FLOW OF ALGORITHM
EXAMPLE OF SCAN-EDF
A D V A N TA G E S A N D
D IS A D V A N T A G E S
C O N C L U S IO N
R EFER EN C ES
AN OVERVIEW OF EDF
.
• Definition of EDF
Assigns priorities to jobs according to deadline
Advantages:
Deadlin 5 6 4 7 1 2 3
e
MOVEMENT OF DISK ARM:
cylinder number
1 5 10 15 20 25
time
ELEVATOR ALGORITHM OR
SCAN
Definition of scan algorithm
Scan(elevator) moves head edge to
considered
Advantages:
1.Current Head is at 0
2.Slack Factor=2
3.Nmax=30
4.Transmission Factor:
Seek factor=0.3
Read=0.6
FLOW OF ALGORITHM
Example(conti….)
Transi Arrival Track Block Start End Averag Deadli Modifi Trans
tion time(At locatio size Index Index e ne (Di) ed missio
ID ) n(ai) (bs) (SI) (EI) executi deadlin n time
on e (Mi) (TT)
T0 0 0 0 0 0 time
0 0 0 0
T3 1 16 4 16 19 6 13 13.53 2.4
• =1.5*3
• =4.5
• Deadline(D1)=At+(slack factor*AET)
=1+(2*4.5)=10
• Modified deadline=Di+f(Ni)=D1+(N1/Nmax)
=10+(7/30)
=10.23
• Transfer time=0.6*block size=0.6*3=1.8
SERVICE TABLE
is to be made that:
In SCAN - EDF , requests are normally served in EDF order .
However , if more than one request have the same
deadline , the SCAN algorithm is applied to these
requests , toresolve the conflict between the same
deadline .
ANY
QUERY???