Learn · Performance Evaluation of Computer Systems
Lecture 17 of 42Performance Evaluation of Computer Systems
Queuing theory-V
Prof. Krishna Moorthy Sivalingam · IIT Madras
Credits and licence
- From
- Performance Evaluation of Computer Systems, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Teens profiles and older. How courses are placed
All the lectures
- Introduction to performance evaluation of computer systems
- How to avoid common mistakes
- Selection of techniques and metrics
- Case study: Selection of techniques and metrics
- Random Variables and probability distributions
- Probability distributions-I
- Probability distributions-II
- Probability distributions-III
- Stochastic process
- Markov Chain
- Slotted Aloha protocol model and discrete-time birth death process
- Continuous time Markov chain and queuing theory-I
- Queuing theory – I (Continued)
- Queuing theory-II
- Queuing theory-III
- Queuing theory-IV
- Queuing theory-V
- Queuing theory-VI
- Queuing networks-I
- Queuing networks-II
- Slotted Aloha Markov model
- Simulations-I
- Simulations-II
- Simulations-III
- Operational laws-I
- Operational laws-II
- Open and closed queuing networks
- Approximate MVA
- Convolution algorithm-I
- Convolution algorithm-II
- Load-dependent service centers
- Hierarchical decomposition
- Balanced Job Bounds
- Confidence interval for propotions and introduction to experimental design
- 2k factorial design
- 2k r factorial design and 2k-p fractional factorial design
- Programming aspects of discrete-event simulations-I
- Programming aspects of discrete-event simulations-II
- Discrete-event simulations-III
- PetriNets-I
- PetriNets-II
- PetriNets-III