A

Seminar
on
Study of RG-SCAN:
Reschedulable Group SCAN
Presented By
VIKRAM NANDANWAR
FINAL YR. CSE
B.N.C.O.E. PUSAD

GUIDED BY:
PROF. S.Y.AMDANI

Babasaheb Naik College Of Engg.,Pusad

CONTENTS:-
1. Overview of Previous algorithms
2. DM-SCAN Algorithm
3. Drawbacks of DM-SCAN Algorithm
4. What is meant by Reschedulable Group
5. Condition for making R-Groups
6. Example-1
7. Flow
8. Example-2
9. Advantages & disadvantages
10. References
11. Conclusion
Previous Proposed Algorithms

EDF

SCAN-EDF

DM-SCAN
CONTINUED-----
EDF

(Transactions are served as per the deadline)

SCAN-EDF

(Transactions which have same deadlines are

served according to the SCAN Algorithm)

DM-SCAN

(Maximum-Scannable Group (MSG) are prepared)

DM-SCAN Algorithm

 Modification of deadlines

Making MSG Groups

Applying SCAN algorithm

Drawbacks of DM-SCAN

Modification of deadline is needed.

Groups are narrow.

Throughput is reduced.
 What is meant by R-Group?

It is the group of continuous disk transactions.

It does not need input to be in order.

Noviolation of Real Time Constraints while

making groups.
•Conditions For making R-Groups

 Following is the two conditions for making R-

Group

I. fi+m<=min{di}

II. Max{rk}<=si for k=i to i+m

 Where fi+m is the finish time of the latest

transaction, di ,si is the deadline of ith
transaction,rk is release time of kth transaction.
EXAMPLE
Flow of Algorithm:-
Example:-
Assumptions:-
i)Transaction ID
ii)Released Time
iii)Block Location
iv)Block Size
v)Start Index
vi)End Index
vii)Slack Factor(2)
viii)Seek Factor(0.3)
 Example:-
Transaction Released Block Block Start End Average Deadline Transfer
ID Time Location Size Index Index Execution (ri + slack Time
(ri) (BS) Time(AET) factor * AET) (0.6*BS)
(1.5*BS)

T1 1 4 3 4 6 4.5 10 1.8

T2 0 2 2 2 3 3 6 1.2

T3 3 11 2 11 12 3 9 1.2

T4 4 13 5 13 17 7.5 19 3.0

T5 6 8 3 8 10 4.5 15 1.8
Service Table
Cj,i i=1 i=2 i=3 i=4 i=5

j=1 - 2.7 4.2 4.5 2.7

j=2 2.7 - 3.0 5.7 3.9

j=3 4.2 1.5 - 6.3 4.5

j=4 6.0 5.4 6.9 - 4.8

j=5 6.6 3.9 5.4 3.3 -

•Example(conti…)
Groups Formed are,
DM-SCAN RG-SCAN
G1= {T1,T2} G1= {T1,T2,T3}
G2= {T2}
G3= {T3}
G4= {T4,T5} G4= {T4,T5}
G5= {T5} G5= {T5}

Schedule as per the algorithms

1.DM-SCAN= T3T2T1T5T4

2.RG-SCAN= T2 T3T1T5T4
•Timing diagram
For DM-SCAN

All are hit

Timing Diagram
For RG-SCAN
Advantages

1.The Groups formed using this algorithm

is more wide as compared to the groups
in the DM-SCAN algorithm.

2.Throughput of this algorithm is more as

compared to the previous algorithm.

3.No deadline modification

Disadvantages

• The
seek optimization is only within the Local
Groups.

• Narrow size groups are formed.

 Conclusion
• Here we applying the seek optimizing rescheduling scheme to
local groups formed using our algorithm to improve throughput
however previous algorithm limit their flexibility and
performance since the rescheduling scheme was not applied.
 References
• Chang H.P.,Chang R.I.,Shih,W.K. Chang,R.C.,2000.Enlarged
Maximum Scannable Group for real time disk scheduling in a
multimedia system.

• Chang R.I.,Shih,W.K. Chang,R.C.,1989.Deadline Modification

SCAN with Maximum Scannable Group for multimedia real time
disk scheduling .
Thank you
ANY QUERIES???