Vous êtes sur la page 1sur 15

REAL PARAMETERS

DISKSCHEDULING &
TIME THEIR
CALCULATION

Presented
By :
Kaushal
4R-33
G u id e d B y :
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
PROBLEM

Queue
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
OPERATION ON DISK
• Read
• Write
• Read & Write
• Read, Write & Compute
 Tr a n s m i s s i o n F a c t o r s
• Read-0.6
• Write-0.6
• Read & Write-1.2
• Read , Write & Compute-1.8

Transaction Request Parameter
qArrival Time
• Periodic
• Aperiodic /Sporadic

 Arrival time=Arrival time + Inter arrival time

qTransaction Size/ Block Size


qAccess Block
Scheduling Parameter
• Transaction ID
• An ID assigned to each requested
transaction
• Average Execution Time
• Deadline
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
Execution Calculation
qSeek time =abs(Initial Block head – Block to
access)* seek factor
Where 0<Seek factor <0.6
qTransfer Time=block size * transmission
factor Transmission type Transmission
• Where Read factor
0.6
Write 0.6

Read & write 1.2
• Read , write & 1.8
compute


qTotal Transaction Time= Seek Time +
Transfer Time
CALCULATION
Tid At To Bs Ai AET Di Rt Hi Si Li St TT TTT Ct
Tra Arr Tra Blo Acc Aver Dea Res Curr Start En See TranTotal Com
nsa iva ns ck ess age dlin pons ent Bloc d k sfer Transa pletio
ctio l/R mis SizeBlo Exec e e Hea k to Bl Ti Tim ction n
n ele sio ck ution Tim d be oc me e Time Time
ID ase n Time e Posi acces k
Ti Typ tion sed
me e

T1 0 R 2 =61.5 *3Block 6Size 0 12 6 8 1.8 1.2 3.0 3.0


between 1 to Between
100 =Initial head position
1 to 100 >=Arrival Time
or
Read/ =Access
Or =Completion
=Block =Access
Block
time
size
= Block
Response+ Block
time Size
* Transition + Total Transmiss
factor
End Head =(
location
Start Block-Initial Head)*seek
/Read write/Read Write Compute =Seek Time +Transfer

=Arrival Time + (Slack factor *Average execution Time)


Scheduler Flow

Request

Scheduler No Request
Queue

Update the queue


Yes
SOLUTION
T T T4T3 T T
6 5 2 1

Queue
Init
ial Disk
Transaction Disk
Request
head
Tid At To Bs Ai AETDi Tidposi
Rt Hi Si Li ST TT TTT Ct
tion
T1 0 R 2 6 3 6 T1=120 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?
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
THAT’S ALL!!!