SlideShare a Scribd company logo
Present By : Ishara Amarasekera
Prabath Weerasinghe
By
Edward G. Coffman and Leonard Kleinrock
• Stochastic Process – A process that describes the data of
a random process.
• Markov Property - The memory less characteristic of
stochastic process.
• Memory less - Future state can be predicted without
knowing the previous states
1
What is Scheduling?
Scheduling is the method by which threads, processes or
data flows are given access to system resources.
Why need Scheduling?
To load balance and share system resources effectively or
achieve a target quality service.
2
P
QUEUEA(t)
PROCESS
OR
B(r)
q
• Units arrive from infinite source
• Units take the end of the queue immediately on their arrival
• Served a fixed amount of service (q) on FCFS basis
• If a unit being served completely within q, it exits the system
• If not, is removed from the processor and put back to the end of
the queue
How it works
3
• Once all units ahead are served, the interrupted unit is again
served. –Preemptive Resume
• The same will continue for all the units in the queue
How it works
P
QUEUEA(t)
PROCESS
OR
B(r)
q
4
• Average service time B(r) and Average arrival time A(r) is constant
• Q = Total Capacity or No. of instructions can be processed per
second
• n= No of units per second
• Therefore, Q/n = Amount of capacity shared among each unit per
second.
.
Consider RR system in which q 0
Q
PROCESSOR
q 0n
5
• Thus the processor is being shared among all units with Q/n
amount.
This leads to a Processor Shared Model
By making all units in the system receive service concurrently and
experience no waiting time in the queue.
Consider RR system in which q 0
Q
PROCESSOR
q 0n
6
• Input traffic is broken into P separate priority groups.
• Service Time given to a unit with priority p when q = 0 = gpq
• when q = 0
Service Time given to a unit with priority p = gp/ ∑ gini
f1
f1
.
.
f1
f2
f2
.
.
f2
.
.
fp
fp
.
fp
.
.
ƛp
N1 PRIORITY
UNITS
N2 PRIORITY
UNITS
NP PRIORITY
UNITS
• Unit with priority p might get a service time which is > Q/n due
to it’s priority
• A generalization of the processor shared model.
gp = Priority group
ni = number of members
from the group I present in
the system
7
How it works
PROCESSOR
q
ƛ
N
2
1
:
:
P
• Unit at the service point at any given queue level will not be
serviced unless all tower level queues are empty
•Unit at service is given a quantum (q) of service like in the RR
model
•If q is not enough, the unit will be subsequently placed at the end
of the next higher level queue 8
When q 0 and N is finite it gives a FCFS Model
When q 0 and N is infinite it gives a RR Model
i + 1
i
:
PROCESSOR
q
ƛ
N
1
P
:
9
i +
1
i
:
PROCESSOR
q
ƛ1
1
P
:
ƛ2
ƛp
• Different quantum sizes for different levels and different mean
times for different priory-level units are given.
• Units can come from outside.
•Until the Lowest level is the highest priority queue is processed
they need to wait.
10
• For all the models no overhead or swap time is
associated with the process of unloading and loading
units from the processor .
• Therefore the results may be viewed as upper bound of
system performance.
11
• Process with smallest time will be processed first
• Waiting time in the queue W(t).
• Non pre emptive, therefore this results slow response
time to new jobs.
t - service time
λ - Arrival rate
µ - Service rate
12
RR – Round Robin
Processor-Shared Models(q -> 0)
Priority Processor-Shared Model
Multiple Level FB Model
Priority Based Multiple Level FB Model
Shortest Job First
FCFS
When q limits to zero q -> 0
With priorities assigned – gp
With priorities assigned – gp
13
• Performances differ on each model.
• So need to analysis before recommending.
• Using Average Waiting Time W(t) is a good choice.
Wait.. define Average
Waiting Time.
14
“Average wait time for a given model is the sum of the
time spent in queues and the service.”
15
• Considering q ≠ 0 and time in service as negligible,
only the time in queue is taken to calculate the
average wait time.
• In FBN N -> α
• Wk = W(t) – t
• A graph is drawn with the average waiting time Wk
against the load ƿ.
• Load ƿ can be considered as the number if arrivals
per service.
ƿ = λ/μ 16
17
•FCFS is used as a reference.
•With respect to that;
o The average waiting time behavior of FN and RR
models at low load values.
o Which one is better for short service time units ?
o Which one is better for longer service time units ?
18
• When q ≠ 0, N -> α, λ = 0.5 sec,
μ = 1.0 sec
• Two separate graphs for both RR and FBα with two
events.
• 2 seconds service time event and 0.5 sec service time
event.
19
What is this ?
Why is this saw
tooth shape ?
What explains the
upper envelope
slope…..
20
Same questions can
be asked as of the
RR model
21
• Why those serrations ?
• What makes the increasing slopes ?
• What makes the decreasing slopes ?
• Reasoning the behavior between two
discontinuities ?
22
Unit with 2 sec service time.
System with 1 sec average service time.
Model A : q = 2.0 – ε
Model B : q = 1.0 – ε
What would contribute to the wait time the most ?
23
•Number of levels = 4
•Below 2/3 sec quantum size -> Sends the unit to level 4
24
•Processor-Shared Model
•Preemptive Processor-Shared Model
•Shortest Job First
All the above get analyzed in two graphs.
25
26
27
• Round Robin Model : Late – Arrival Systems Average
Wait Time
28
• There’s one in all kind of scheduling model.
• All are different in their own ways and usage differs
with the applications
• According to the Conservation Law :
- Any favors to some units would result in a
discrimination of some others.
• This is because of having a constant CPU capability.
29
Feedback Queueing Models for Time Shared Systems

More Related Content

What's hot (20)

ODP
Boost.Pipeline scheduling of segments
erenon
 
PPT
Communication
Pradyut Sanki
 
PPT
Mmclass10
Hassan Dar
 
PPTX
INTERRUPT LATENCY AND RESPONSE OF THE TASK
JOLLUSUDARSHANREDDY
 
PPTX
Transport layer and Application layer
TharuniDiddekunta
 
PPT
Homework solution1
Ignåciø Såråviå
 
PPTX
Round-ribon algorithm presntation
Jamsheed Ali
 
PPTX
Arithmatic pipline
A. Shamel
 
PDF
RR and priority scheduling
A. S. M. Shafi
 
PPT
Os5
issbp
 
PDF
Comparision of different Round Robin Scheduling Algorithm using Dynamic Time ...
Editor IJMTER
 
PPT
3D-DRESD Polaris
Marco Santambrogio
 
PPTX
Dynamic Resource Management In a Massively Parallel Stream Processing Engine
Kasper Grud Skat Madsen
 
PPT
message passing
Ashish Kumar
 
PDF
Packet scheduling
Manuel Pizarro
 
PPTX
Round Robin Algorithm.pptx
Sanad Bhowmik
 
PPTX
Mule batch introduction
Son Nguyen
 
PPTX
Scope of parallelism
Syed Zaid Irshad
 
PPTX
The paxos commit algorithm
ahmed hamza
 
PDF
Real Time most famous algorithms
Andrea Tino
 
Boost.Pipeline scheduling of segments
erenon
 
Communication
Pradyut Sanki
 
Mmclass10
Hassan Dar
 
INTERRUPT LATENCY AND RESPONSE OF THE TASK
JOLLUSUDARSHANREDDY
 
Transport layer and Application layer
TharuniDiddekunta
 
Homework solution1
Ignåciø Såråviå
 
Round-ribon algorithm presntation
Jamsheed Ali
 
Arithmatic pipline
A. Shamel
 
RR and priority scheduling
A. S. M. Shafi
 
Os5
issbp
 
Comparision of different Round Robin Scheduling Algorithm using Dynamic Time ...
Editor IJMTER
 
3D-DRESD Polaris
Marco Santambrogio
 
Dynamic Resource Management In a Massively Parallel Stream Processing Engine
Kasper Grud Skat Madsen
 
message passing
Ashish Kumar
 
Packet scheduling
Manuel Pizarro
 
Round Robin Algorithm.pptx
Sanad Bhowmik
 
Mule batch introduction
Son Nguyen
 
Scope of parallelism
Syed Zaid Irshad
 
The paxos commit algorithm
ahmed hamza
 
Real Time most famous algorithms
Andrea Tino
 

Similar to Feedback Queueing Models for Time Shared Systems (20)

PPTX
Operating system 30 preemptive scheduling
Vaibhav Khanna
 
PPT
Queuing theory and traffic analysis in depth
IdcIdk1
 
PDF
OS Process Chapter 3.pdf
Kp Sharma
 
PPTX
Unit - 5 Pipelining.pptx
Medicaps University
 
PPT
dataprocess using different technology.ppt
ssuserf6eb9b
 
PPT
CPU Scheduling Algorithms(FCFS,SJF,RR).ppt
2350482
 
PDF
cpu scheduling.pdfoieheoirwuojorkjp;ooooo
baijusurya7
 
PDF
Ch6 cpu scheduling
Welly Dian Astika
 
PPT
3 process scheduling
ahad alam
 
PPT
3_process_scheduling.ppt
AbdulRahman491811
 
PPT
Process Scheduling Algorithms for Operating Systems
KathirvelRajan2
 
PPT
3_process_scheduling.ppt
ShrutiArora343479
 
PPT
fggggggggggggggggggggggggggggggfffffffffffffffffff
adugnanegero
 
PPT
3_process_scheduling.ppt----------------
DivyaBorade3
 
PPT
Operating Systems Process Scheduling Algorithms
sathish sak
 
PPT
Introduction_pipeline24.ppt which include
GauravDaware2
 
PPTX
Cpu scheduling
Abhijith Reloaded
 
PPT
Window scheduling algorithm
Binal Parekh
 
PPT
Ch6
C.U
 
Operating system 30 preemptive scheduling
Vaibhav Khanna
 
Queuing theory and traffic analysis in depth
IdcIdk1
 
OS Process Chapter 3.pdf
Kp Sharma
 
Unit - 5 Pipelining.pptx
Medicaps University
 
dataprocess using different technology.ppt
ssuserf6eb9b
 
CPU Scheduling Algorithms(FCFS,SJF,RR).ppt
2350482
 
cpu scheduling.pdfoieheoirwuojorkjp;ooooo
baijusurya7
 
Ch6 cpu scheduling
Welly Dian Astika
 
3 process scheduling
ahad alam
 
3_process_scheduling.ppt
AbdulRahman491811
 
Process Scheduling Algorithms for Operating Systems
KathirvelRajan2
 
3_process_scheduling.ppt
ShrutiArora343479
 
fggggggggggggggggggggggggggggggfffffffffffffffffff
adugnanegero
 
3_process_scheduling.ppt----------------
DivyaBorade3
 
Operating Systems Process Scheduling Algorithms
sathish sak
 
Introduction_pipeline24.ppt which include
GauravDaware2
 
Cpu scheduling
Abhijith Reloaded
 
Window scheduling algorithm
Binal Parekh
 
Ch6
C.U
 
Ad

More from Ishara Amarasekera (9)

PDF
Key Steps in Agile Software Delivery Roadmap
Ishara Amarasekera
 
PPTX
UI Evaluation for Mobile Dashboard based on Jakob Nielsen's Principles.pptx
Ishara Amarasekera
 
PDF
How to write a simple java program in 10 steps
Ishara Amarasekera
 
PDF
iOS Contact List Application Tutorial
Ishara Amarasekera
 
PPTX
A Common Database Approach for OLTP and OLAP Using an In-Memory Column Database
Ishara Amarasekera
 
PPTX
Model-Driven Testing with UML 2.0
Ishara Amarasekera
 
PPTX
Activity Recognition using Cell Phone Accelerometers
Ishara Amarasekera
 
PDF
Layered programatical api framework for real time mobile social network
Ishara Amarasekera
 
PPTX
Goal-Oriented Requirements Engineering: A Guided Tour
Ishara Amarasekera
 
Key Steps in Agile Software Delivery Roadmap
Ishara Amarasekera
 
UI Evaluation for Mobile Dashboard based on Jakob Nielsen's Principles.pptx
Ishara Amarasekera
 
How to write a simple java program in 10 steps
Ishara Amarasekera
 
iOS Contact List Application Tutorial
Ishara Amarasekera
 
A Common Database Approach for OLTP and OLAP Using an In-Memory Column Database
Ishara Amarasekera
 
Model-Driven Testing with UML 2.0
Ishara Amarasekera
 
Activity Recognition using Cell Phone Accelerometers
Ishara Amarasekera
 
Layered programatical api framework for real time mobile social network
Ishara Amarasekera
 
Goal-Oriented Requirements Engineering: A Guided Tour
Ishara Amarasekera
 
Ad

Recently uploaded (20)

PPTX
ENGLISH 8 WEEK 3 Q1 - Analyzing the linguistic, historical, andor biographica...
OliverOllet
 
PPTX
Unlock the Power of Cursor AI: MuleSoft Integrations
Veera Pallapu
 
PPTX
Cleaning Validation Ppt Pharmaceutical validation
Ms. Ashatai Patil
 
PPTX
K-Circle-Weekly-Quiz12121212-May2025.pptx
Pankaj Rodey
 
PPTX
Dakar Framework Education For All- 2000(Act)
santoshmohalik1
 
PPTX
Cybersecurity: How to Protect your Digital World from Hackers
vaidikpanda4
 
PPTX
Introduction to Probability(basic) .pptx
purohitanuj034
 
PPTX
Top 10 AI Tools, Like ChatGPT. You Must Learn In 2025
Digilearnings
 
DOCX
Modul Ajar Deep Learning Bahasa Inggris Kelas 11 Terbaru 2025
wahyurestu63
 
PPTX
YSPH VMOC Special Report - Measles Outbreak Southwest US 7-20-2025.pptx
Yale School of Public Health - The Virtual Medical Operations Center (VMOC)
 
PDF
John Keats introduction and list of his important works
vatsalacpr
 
PPTX
Virus sequence retrieval from NCBI database
yamunaK13
 
PDF
Module 2: Public Health History [Tutorial Slides]
JonathanHallett4
 
PDF
My Thoughts On Q&A- A Novel By Vikas Swarup
Niharika
 
PPTX
Gupta Art & Architecture Temple and Sculptures.pptx
Virag Sontakke
 
PDF
The Minister of Tourism, Culture and Creative Arts, Abla Dzifa Gomashie has e...
nservice241
 
PPTX
Continental Accounting in Odoo 18 - Odoo Slides
Celine George
 
PPTX
Python-Application-in-Drug-Design by R D Jawarkar.pptx
Rahul Jawarkar
 
PDF
Tips for Writing the Research Title with Examples
Thelma Villaflores
 
DOCX
Unit 5: Speech-language and swallowing disorders
JELLA VISHNU DURGA PRASAD
 
ENGLISH 8 WEEK 3 Q1 - Analyzing the linguistic, historical, andor biographica...
OliverOllet
 
Unlock the Power of Cursor AI: MuleSoft Integrations
Veera Pallapu
 
Cleaning Validation Ppt Pharmaceutical validation
Ms. Ashatai Patil
 
K-Circle-Weekly-Quiz12121212-May2025.pptx
Pankaj Rodey
 
Dakar Framework Education For All- 2000(Act)
santoshmohalik1
 
Cybersecurity: How to Protect your Digital World from Hackers
vaidikpanda4
 
Introduction to Probability(basic) .pptx
purohitanuj034
 
Top 10 AI Tools, Like ChatGPT. You Must Learn In 2025
Digilearnings
 
Modul Ajar Deep Learning Bahasa Inggris Kelas 11 Terbaru 2025
wahyurestu63
 
YSPH VMOC Special Report - Measles Outbreak Southwest US 7-20-2025.pptx
Yale School of Public Health - The Virtual Medical Operations Center (VMOC)
 
John Keats introduction and list of his important works
vatsalacpr
 
Virus sequence retrieval from NCBI database
yamunaK13
 
Module 2: Public Health History [Tutorial Slides]
JonathanHallett4
 
My Thoughts On Q&A- A Novel By Vikas Swarup
Niharika
 
Gupta Art & Architecture Temple and Sculptures.pptx
Virag Sontakke
 
The Minister of Tourism, Culture and Creative Arts, Abla Dzifa Gomashie has e...
nservice241
 
Continental Accounting in Odoo 18 - Odoo Slides
Celine George
 
Python-Application-in-Drug-Design by R D Jawarkar.pptx
Rahul Jawarkar
 
Tips for Writing the Research Title with Examples
Thelma Villaflores
 
Unit 5: Speech-language and swallowing disorders
JELLA VISHNU DURGA PRASAD
 

Feedback Queueing Models for Time Shared Systems

  • 1. Present By : Ishara Amarasekera Prabath Weerasinghe By Edward G. Coffman and Leonard Kleinrock
  • 2. • Stochastic Process – A process that describes the data of a random process. • Markov Property - The memory less characteristic of stochastic process. • Memory less - Future state can be predicted without knowing the previous states 1
  • 3. What is Scheduling? Scheduling is the method by which threads, processes or data flows are given access to system resources. Why need Scheduling? To load balance and share system resources effectively or achieve a target quality service. 2
  • 4. P QUEUEA(t) PROCESS OR B(r) q • Units arrive from infinite source • Units take the end of the queue immediately on their arrival • Served a fixed amount of service (q) on FCFS basis • If a unit being served completely within q, it exits the system • If not, is removed from the processor and put back to the end of the queue How it works 3
  • 5. • Once all units ahead are served, the interrupted unit is again served. –Preemptive Resume • The same will continue for all the units in the queue How it works P QUEUEA(t) PROCESS OR B(r) q 4
  • 6. • Average service time B(r) and Average arrival time A(r) is constant • Q = Total Capacity or No. of instructions can be processed per second • n= No of units per second • Therefore, Q/n = Amount of capacity shared among each unit per second. . Consider RR system in which q 0 Q PROCESSOR q 0n 5
  • 7. • Thus the processor is being shared among all units with Q/n amount. This leads to a Processor Shared Model By making all units in the system receive service concurrently and experience no waiting time in the queue. Consider RR system in which q 0 Q PROCESSOR q 0n 6
  • 8. • Input traffic is broken into P separate priority groups. • Service Time given to a unit with priority p when q = 0 = gpq • when q = 0 Service Time given to a unit with priority p = gp/ ∑ gini f1 f1 . . f1 f2 f2 . . f2 . . fp fp . fp . . ƛp N1 PRIORITY UNITS N2 PRIORITY UNITS NP PRIORITY UNITS • Unit with priority p might get a service time which is > Q/n due to it’s priority • A generalization of the processor shared model. gp = Priority group ni = number of members from the group I present in the system 7
  • 9. How it works PROCESSOR q ƛ N 2 1 : : P • Unit at the service point at any given queue level will not be serviced unless all tower level queues are empty •Unit at service is given a quantum (q) of service like in the RR model •If q is not enough, the unit will be subsequently placed at the end of the next higher level queue 8
  • 10. When q 0 and N is finite it gives a FCFS Model When q 0 and N is infinite it gives a RR Model i + 1 i : PROCESSOR q ƛ N 1 P : 9
  • 11. i + 1 i : PROCESSOR q ƛ1 1 P : ƛ2 ƛp • Different quantum sizes for different levels and different mean times for different priory-level units are given. • Units can come from outside. •Until the Lowest level is the highest priority queue is processed they need to wait. 10
  • 12. • For all the models no overhead or swap time is associated with the process of unloading and loading units from the processor . • Therefore the results may be viewed as upper bound of system performance. 11
  • 13. • Process with smallest time will be processed first • Waiting time in the queue W(t). • Non pre emptive, therefore this results slow response time to new jobs. t - service time λ - Arrival rate µ - Service rate 12
  • 14. RR – Round Robin Processor-Shared Models(q -> 0) Priority Processor-Shared Model Multiple Level FB Model Priority Based Multiple Level FB Model Shortest Job First FCFS When q limits to zero q -> 0 With priorities assigned – gp With priorities assigned – gp 13
  • 15. • Performances differ on each model. • So need to analysis before recommending. • Using Average Waiting Time W(t) is a good choice. Wait.. define Average Waiting Time. 14
  • 16. “Average wait time for a given model is the sum of the time spent in queues and the service.” 15
  • 17. • Considering q ≠ 0 and time in service as negligible, only the time in queue is taken to calculate the average wait time. • In FBN N -> α • Wk = W(t) – t • A graph is drawn with the average waiting time Wk against the load ƿ. • Load ƿ can be considered as the number if arrivals per service. ƿ = λ/μ 16
  • 18. 17
  • 19. •FCFS is used as a reference. •With respect to that; o The average waiting time behavior of FN and RR models at low load values. o Which one is better for short service time units ? o Which one is better for longer service time units ? 18
  • 20. • When q ≠ 0, N -> α, λ = 0.5 sec, μ = 1.0 sec • Two separate graphs for both RR and FBα with two events. • 2 seconds service time event and 0.5 sec service time event. 19
  • 21. What is this ? Why is this saw tooth shape ? What explains the upper envelope slope….. 20
  • 22. Same questions can be asked as of the RR model 21
  • 23. • Why those serrations ? • What makes the increasing slopes ? • What makes the decreasing slopes ? • Reasoning the behavior between two discontinuities ? 22
  • 24. Unit with 2 sec service time. System with 1 sec average service time. Model A : q = 2.0 – ε Model B : q = 1.0 – ε What would contribute to the wait time the most ? 23
  • 25. •Number of levels = 4 •Below 2/3 sec quantum size -> Sends the unit to level 4 24
  • 26. •Processor-Shared Model •Preemptive Processor-Shared Model •Shortest Job First All the above get analyzed in two graphs. 25
  • 27. 26
  • 28. 27
  • 29. • Round Robin Model : Late – Arrival Systems Average Wait Time 28
  • 30. • There’s one in all kind of scheduling model. • All are different in their own ways and usage differs with the applications • According to the Conservation Law : - Any favors to some units would result in a discrimination of some others. • This is because of having a constant CPU capability. 29