Scribd
Upload
76 views19 pages

A Novel Disk Scheduling Algorithm: Presented by

This document presents a novel disk scheduling algorithm. It discusses classical scheduling algorithms like FCFS, SCAN, C-SCAN and SSTF and their drawbacks in not considering time constraints. Real-time disk scheduling algorithms like EDF, SSEDO and SSEDV are also discussed. The proposed approach combines P-SCAN and SSEDO by assigning requests to priority levels and then selecting the request with the minimum deadline from the highest priority level. An example is provided to demonstrate how the proposed algorithm works and compare its performance to EDF, SSEDV and other algorithms in terms of number of hits and misses. The proposed algorithm is found to perform better than the other real-time algorithms.

Uploaded by

kaushal_bksc
Copyright
© Attribution Non-Commercial (BY-NC)
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
76 views19 pages

A Novel Disk Scheduling Algorithm: Presented by

This document presents a novel disk scheduling algorithm. It discusses classical scheduling algorithms like FCFS, SCAN, C-SCAN and SSTF and their drawbacks in not considering time constraints. Real-time disk scheduling algorithms like EDF, SSEDO and SSEDV are also discussed. The proposed approach combines P-SCAN and SSEDO by assigning requests to priority levels and then selecting the request with the minimum deadline from the highest priority level. An example is provided to demonstrate how the proposed algorithm works and compare its performance to EDF, SSEDV and other algorithms in terms of number of hits and misses. The proposed algorithm is found to perform better than the other real-time algorithms.

Uploaded by

kaushal_bksc
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 19

A NOVEL DISK SCHEDULING

ALGORITHM

PRESENTED BY
ASHWINI CHIRDE
FINAL YR. CSE
B.N.C.O.E. PUSAD

GUIDED BY
PROF. S.Y.AMDANI
CONTENTS:-
1. Why Disk Scheduling Problems Occur?
2. Classical Scheduling Algorithms
3. Real-Time Disk Scheduling Algorithms
4. Proposed Approach
5. Flow Of Algorithm
6. Example
7. Advantages & Disadvantages
8. Conclusion
9. References
Why Disk Scheduling Problems Occur:-

Disk Head
Movements

Problems

Goals To
Be
Achieved
Classical Scheduling Algorithms:-
FCFS(First-Come-First-Serve)

SCAN

C-SCAN(Circular-SCAN)

SSTF(Shortest Seek Time First)

Drawback:-
None of the classical scheduling algorithms takes
time constraint of request into account. So results in
poor performance
Real-Time Disk Scheduling Algorithms:-
Drawbacks
EDF(Earliest Deadline First)

SSEDO(Shortest Seek And Earliest


Deadline By Ordering)

SSEDV(Shortest Seek And Earliest


Deadline By Value)
Proposed Approach:-
Overview
P-SCAN+SSEDO
As in P-SCAN the I/O requests are divided
into three priority levels, as lowest, middle
and highest by using the formula.
After that the SSEDO algorithm will be
applied.
The algo. Selects the transaction with
minimum deadline from high priority level
and also serves the transaction that are
close to the current head position and then
serve the transaction with next minimum
deadline.
How To Assign The Priorities:- LOW_DL => Lower
Bound
Formula’s:- &
UP_DL => Higher
i)For Highest Priority:- Bound
If deadline <((LOW-DL+UP-DL)/4)
Then it will be assigned a highest priority.
ii)For Lowest Priority:-
If deadline>((LOW-DL+UP-DL)/2)
Then it will be assigned a lowest riority.
EX:-
Highest: ((0+20)/4)=5 => (T0,T6,T7)

Middle: => (T2,T3,T8)

Lower: ((0+20)/2)=10 => (T1,T4,T5)


Flow of Algorithm:-
Examples:-
Assumptions:-
i)Transaction ID
ii)Released Time
iii)Block Location
iv)Block Size
v)Start Block
vi)End Block
vii)Slack Factor(S.F.=2)
Example:-
Transaction Released Block Block Start End Average Deadline Transfer
ID Time Location Size Block Block Execution (Ri + slack Time
(Ri) (BS) Time(AET) factor * AET) (0.6*BS)
(1.5*BS)

T0 0 0 0 0 0 0 0 0

T1 1 2 3 2 4 4.5 10 1.8

T2 0 7 2 7 8 3 6 1.2

T3 3 9 2 9 10 3 9 1.2

T4 5 14 5 14 18 7.5 20 3

T5 4 19 3 19 21 4.5 13 1.8

T6 0 1 1 1 1 1.5 3 0.6

T7 1 5 1 5 5 1.5 4 0.6

T8 2 12 2 12 13 3 8 1.2
Service Table:-
Cj,i i=0 i=1 i=2 i=3 i=4 i=5 i=6 i=7 i=8

j=0 ------- 2.4 3.3 3.9 7.2 7.5 0.9 2.1 4.8

j=1 1.2 --------- 2.1 2.7 6 6.3 1.5 0.9 3.6

j=2 2.4 3.6 --------- 1.5 4.8 5.1 2.7 1.5 2.4

j=3 3 4.2 2.1 --------- 4.2 4.5 3.3 2.1 1.8


j=4
5.4 6.6 4.5 3.9 --------- 2.1 5.7 4.5 3

j=5 6.3 7.5 5.4 4.8 5.1 -------- 0.6 5.4 3.9

j=6 0.3 2.1 3 3.6 6.9 7.2 -------- 1.8 4.8

j=7 1.5 2.7 1.8 2.4 5.7 6 1.8 --------- 2.7

j=8 3.9 5.1 7.5 2.4 3.3 3.6 4.2 3 ---------


EDF:- T0,T6,T7,T2,T8,T3,T1,T5,T4

No. of hits:-06 (T0,T6,T7,T2,T8,T3)


No. of miss’:-03 (T1,T5,T4)
Proposed Algo.:-T0,T6,T1,T7,T2,T3,T8,T4,T5

No. of hits:-07 (T0,T6,T1,T7,T2,T3,T4)


No. of. miss’:-02 (T8,T5)
SSEDV: T6,T1,T7,T2,T3,T8,T4,T5
Vi=1-Di+(1-α)Li
[α=0.8]
t6 t1 t7 t2 t3 t8 t4 t5

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
22 23 24

No. of hits:-05 (T6,T1,T7,T2,T3,T5)


No. of miss’:-02 (T8,T5)

DISADVANTGE:- When value of α is increased from 0.8 to 1 then in above


schedule t1 comes before t6 which causes more transactions misses
Advantages:-
Reduces the arm movement
Gives better results than other real-time
algorithms in heavy workload

Disadvantages:-
 It does not give so much consideration
to deadline as it combine with distance
from current arm location.
It depends upon priority levels. if the
levels are increased then it degraded.
Conclusion:-
On comparing the proposed algorithm with the
other real-time disk scheduling algorithms, we
found that the proposed algorithm works better
than the others.
References:-
[1] G. R. Bamnote, Dr. M. S. Ali, S. Y. Amdani,
“A Novel Disk Scheduling Approach For Real-Time Database Systems”,
International Journal Of Computer Science And Applications Vol 1, No. 3,
December 2008.

[2] Shenze Chen, John A. Stankovic, James Kurose and Don Towsley,
“Performance Evaluation Of Two New Disk Scheduling Algorithms”, The Journal
Of Real-Time Systems, Vol 3, number 3,307-336,1991.

[3] R. About & H. Garcia-Molina , “Scheduling Real time Transactions: A


Performance evaluation ”,Proceeding of the 14th International conference on
very large Datatbases, Los Angeles,California ,pp:1-12,March 1998

[4] jayant R. haritsa Micheal J. Carey , & miron Livney,”Value based Scheduling
in Real Time Database System”,The VLDB Journal-the international journal of
very large Databases,Vol.2 Issue.2 pp:117-152,april 1993
Thank you
ANY QUERIES???

You might also like