Performance Evaluation of Computer Systems

0( 0 REVIEWS )
1 STUDENTS

Contents:
Introduction – How to avoid common mistakes – Selection of techniques and metrics – Case study: Selection of techniques and metrics – Random Variables and probability distributions – Probability distributions – Stochastic process – Markov Chain – Slotted Aloha protocol model and discrete-time birth death process – Queuing theory – Continuous time Markov chain and queuing theory – Queuing networks – Slotted Aloha Markov mode-Simulations – Operational laws

Open and closed queuing networks – Approximate MVA – Convolution algorithm – Load-dependent service center – Hierarchical decomposition Balanced Job Bound s- Confidence interval for pro potions and introduction to experimental design – 2k factorial design – 2k r factorial design and 2k-p fractional factorial design-Programming aspects of discrete – event simulations – Discrete – event simulations – PetriNets

Course Curriculum

Mod-01 Lec-01 Introduction to performance evaluation of computer systems Details 30:54
Mod-01 Lec-02 How to avoid common mistakes Details 58:19
Mod-01 Lec-03 Selection of techniques and metrics Details 56:16
Mod-01 Lec-04 Case study: Selection of techniques and metrics Details 34:4
Mod-01 Lec-05 Random Variables and probability distributions Details 47:25
Mod-01 Lec-06 Probability distributions-I Details 37:28
Mod-01 Lec-07 Probability distributions-II Details 38:24
Mod-01 Lec-08 Probability distributions-III Details 56:1
Mod-01 Lec-09 Stochastic process Details 44:38
Mod-01 Lec-10 Markov Chain Details 1:7:10
Mod-01 Lec-11 Slotted Aloha protocol model and discrete-time birth death process Details 1:5:3
Mod-01 Lec-12 Continuous time Markov chain and queuing theory-I Details 53:5
Mod-01 Lec-12b Queuing theory — I (Continued) Details 53:21
Mod-01 Lec-13 Queuing theory — II Details 1:2:26
Mod-01 Lec-14 Queuing theory-III Details 31:52
Mod-01 Lec-15 Queuing theory-IV Details 59:21
Mod-01 Lec-16 Queuing theory-IV Details 46:7
Mod-01 Lec-17 Queuing theory-V Details 1:50
Mod-01 Lec-18 Queuing theory-VI Details 48:7
Mod-01 Lec-19 Queuing networks-I Details 46:26
Mod-01 Lec-20 Slotted Aloha Markov model Details 43:50
Mod-01 Lec-21 Simulations-I Details 49:58
Mod-01 Lec-22 Simulations-II Details 41:2
Mod-01 Lec-23 Simulations-III Details 54:45
Mod-01 Lec-24 Operational laws-I Details 1:7:7
Mod-01 Lec-25 Operational laws-II Details 32:33
Mod-01 Lec-26 Open and closed queuing networks Details 1:2:52
Mod-01 Lec-27 Approximate MVA Details 36:52
Mod-01 Lec-28 Convolution algorithm-I Details 34:38
Mod-01 Lec-29 Convolution algorithm-I Details 30:5
Mod-01 Lec-30 Load-dependent service centers Details 0:39
Mod-01 Lec-31 Hierarchical decomposition Details 1:3:38
Mod-01 Lec-32 Balanced Job Bounds Details 22:40
Mod-01 Lec-33 Confidence interval for propotions and introduction to experimental design Details 46:50
Mod-01 Lec-34 2k factorial design Details 32:24
Mod-01 Lec-35 2k r factorial design and 2k-p fractional factorial design Details 31:17
Mod-01 Lec-36 Programming aspects of discrete-event simulations-I Details 51:2
Mod-01 Lec-37 Programming aspects of discrete-event simulations-II Details 49:27
Mod-01 Lec-38 Discrete-event simulations-III Details 25:1
Mod-01 Lec-39 PetriNets-I Details 1:5:10
Mod-01 Lec-40 PetriNets-I Details
Mod-01 Lec-41 PetriNets-II Details 25:16

Course Reviews

N.A

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel