A

seminar
on
SSEDV ALGORITHM

Submitted by
RAVINDRA DHULE Guided by
FINAL YR. CSE
B.N.C.O.E. PUSAD PROF. S.Y.AMDANI
CONTENTS:-
1. Overview of previous algorithm
2. Introduction of SSEDV
3. Working of SSEDV
4. Comparison with SSEDO
5. Performance of SSEDV
6. Flow of Algorithm
Example of
7.
SSEDV
8. Advantages & Disadvantages
9. Conclusion

10 References
•Overview of Previous algorithms

FD-SCAN

P-SCAN

SSEDO
FD-SCAN:
earliest feasible deadline is used to determine the scan direction.

P-SCAN:
In Priority Scan (P-Scan) all request in the I/O queue are divided into multiple
priority levels. The Scan algorithm is used within each level.

SSEDO:
In SSEDO algorithm, the scheduler uses only the ordering information of
request deadlines
 • Introduction of SSEDV:
(Shortest Seek & Earliest Deadline By Value)
 Discovered by Shenze Chen, James Kurose in 1990-91.

• What is need ?
 Timing constraint & disk service time
•Working of SSEDV:

Let,
ri: be the i/o request with ith smallest deadline at a scheduling

instance.
di: the distance between current arm position & request Ri position.

Li: be the deadline of Ri.

Comparison with SSEDO:
Assume that, deadline of r1 is less than deadline of r2,But r2
position is very close to current arm position .
Then SSEDO algorithm will schedule r2 first & may result in loss of r1.
But SSEDV algorithm will schedule r1 & r2 both.
•Performance of SSEDV:
• Disk Service Time ‘S’ Is:

S=Xs + Xr + Xt
Where, Xr = Rotational Latency

Xt = transfer Time

Xs= seek Time defined as

Xs= a+b√I ; if I >0

0 ; if I =0
Flow of Algorithm:-
Example:-
Assumptions:-

I.Transaction Size

II.Arrival time

III.Di(distance between two arm position)

IV. Slack Factor(constant=2)

V.Transaction ID
Example:-
Transaction Arrival Transaction Average Deadline Di values
ID Time ri Size Execution (ri + slack factor *
Time(AET) AET)
(1.5*TS)

T1 2 10 15 32 5

T2 18 8 12 42 7

T3 10 15 22.5 55 15

T4 5 5 7.5 23 10

T5 30 11 16.5 63 11
• Example(conti…)

• Deadline=arrival time+(slack factor*AET)

• Associate priority value using formula-

α.di+(1-α).li
Where,α=scheduling parameter having value(0&1)

Sequence obtained using SSEDV is-

T1,T4,T2,T5,T3

Sequence obtained using SSEDO is-

T1,T2,T4,T5,T3
 Timing Diagram of SSEDV:-

SCAN=T0T1T2T3

No.of Hit=4 , No of Miss=1

•Timing Diagram of SSEDO:

No.of Hit=2
No.of Miss=3
•Advantages:

It consider both timing constraint and disk service time.

After comparing with different algorithm this significantly
reduces the transaction loss ratio up to 38%.

• Disadvantages:
As the load increase the disk access time decrease
 REFERENCES:

Technical Report No. 2005-499 Scheduling Algorithms for Real-Time

Systems Arezou Mohammadi and Selim G. Akl.

Huang, J., Stancovic J., A.,Towsley D. and Ramamritham, K., “Experimental

Evaluation of real time transaction processing,” Dec.1989.

Shenze Chen, John A. Stankovic, James Kurose and Don Towsley “Performance
Evaluation of Two New Disk Scheduling Algorithms”, The Journal of Real-Time
Systems, 1990 .
Scheduling I/O Requests with Deadlines: a Performance Evaluation
CH2933-0/90/0000/0113 1990 IEEE Robert K. Abbott Hector Garcia-Molina
Thank you
ANY QUERIES???