REAL TIME DISK SCHEDULING PARAMETERS &

THEIR CALCULATION

Presented By:
Kaushal
4R-33
Guided By:
Prof. Ms. P.B. Niranjane

Department of Computer Science & Engineering

B.N. College of Engineering ,Pusad
 CONTENTS
Terms Related To Scheduling
Parameters

Calculation
Conclusion

References

12/7/21
 PROBLEM

S
C
H
E
D
U
L
A Queue
R Disk

Transaction
Request
 Disk Parameter
 Disk Size
• No. of tracks ,Sectors & cylinder
• As a Block -100 block size

 Seek Time & Rotational Latency

• Considering only Seek time & ignoring the
Rotational Latency
 Transfer Time
• Time to transmit data from Disk to CPU
or vice-versa

12/7/21
 OPERATION ON DISK
• Read

• Write

• Read & Write

• Read, Write & Compute

Tra n s m i s s i o n Fa c t o r s
• Read-0.6

• Write-0.6

• Read & Write-1.2

• Read , Write & Compute-1.8

12/7/21
 Transaction Request Parameter
 Arrival Time
• Periodic
• Aperiodic /Sporadic

Arrival time=Arrival time + Inter arrival time

 Transaction Size/ Block Size
 Access Block

12/7/21
 Scheduling Parameter
• Transaction ID
• An ID assigned to each requested transaction
• Average Execution Time
• Deadline

12/7/21
 Creating Deadline
• For the creation of deadline of any transaction.
• Calculate
• Average execution time
= 1.5*block Size
• Deadline

= Arrival time+ (Slack factor * AET)

• Slack factor-tolerance-assumed to be 2

12/7/21
 Execution Calculation
Seek time =abs(Initial Block head – Block to access)* seek factor
• Where 0<Seek factor <0.6
Transfer
Time=block size * transmission factor
• Where
Transmission type Transmission factor
Read 0.6
Write 0.6
Read & write 1.2
Read , write & compute 1.8

Total Transaction Time= Seek Time + Transfer Time

12/7/21
 CALCULATION
Tid At To Bs Ai AET Di Rt Hi Si Li St TT TTT Ct

Start Block to be accessed

Average Execution Time

Current Head Position

Total Transaction Time

Arrival/Release Time
Transmission Type

Completion Time
Response Time
Transaction ID

Transfer Time
Access Block

Seek Time
Block Size

End Block
Deadline

T1 0 Read/
R 2 6 =1.53 *Block6 12 =Initial
0>=Arrival Time6 head8 1.8 1.2 =Response
3.0 3.0
between
Write/Re1 Size1 to
Between position
=Block
=Access
size * =(Start time +
Or =Access Block-
toad100 100 or Transition
Block
=Completion
End Head Block+ Total Time
Initial
=Seek
write/Rea time Block
factor
Size Transmissi
Head)*seek
+Transfer
d Write =Arrival Time location
+ on Time
Factor Time
Compute (Slack factor
*Average execution
12/7/21 Time)
 Scheduler Flow

Request

Schedu
No Request
ler
Queue

Yes
Update the queue

12/7/21
 S
C SOLUTION
H
E
T T T T T T
D
6 5 4 3 2 1
U
L
A Queue
R
Disk
Transaction
Request Initial Disk head position=12
Tid At To Bs Ai AET Di Tid Rt Hi Si Li ST TT TTT Ct

T1 0 R 2 6 3 6 T1 0 12 6 8 1.8 1.2 3.0 3.0

T2 6 R 4 40 6 18 T2 6 8 40 44 9.6 2.4 12.0 18
T3 10 R 2 30 3 16 T3 18 44 30 32 4.2 1.2 5.4 23.4
T4 12 R 6 80 9 30 T4 23.4 32 80 86 11.4 3.6 15 38.4
T5 18 R 8 16 12 42 T5 38.4 86 16 24 21.0 4.8 25.8 64.2
T6 30 R 2 12 3 36 T6 64.2 24 12 14 3.6 1.2 4.8 69
 CONCLUSION
Thus we are familiar with the terms &
parameter to be used in the upcoming
scheduling algorithm.
And also we have learned how to calculate
these parameter.
How scheduling is done by the scheduler?

12/7/21
 References
• C.L. Liu & J.W. Layland , ”Scheduling Algorithm for
multiprogramming in hard real time environment ” , Journal of
the ACM ,vol-20,no.-1 pp.46-61,1973
• Ramamritham, K: and J. Stankovic, "Dynamic Task Scheduling in
Distributed Hard Real-Time Systems," IEEE Software, Vol. 1, No.
3, July 1984.
• Ben Kao, Hector Garcia-Molina, An overview of Real time
database System

12/7/21
THAT’S ALL!!!