1

Performance Evaluation of Computer Systems. Instructor: Prof. Krishna Moorthy Sivalingam, Department of Computer Science and Engineering, IIT Madras.

FREE
This course includes
Hours of videos

1166 years, 6 months

Units & Quizzes

42

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

The objective of this course is to understand the fundamental concepts of computer system performance evaluation. Topics covered in this course will include introduction to mathematical modeling techniques (Markov Chains, Queuing Theory and Networks of Queues), discrete event simulation modeling, experimental design, workload characterization, measurement of performance metrics, analysis and presentation of results. (from nptel.ac.in)

Course Currilcum

  • Lecture 01 – Introduction Unlimited
  • Lecture 02 – How to Avoid Common Mistakes Unlimited
  • Lecture 03 – Selection of Techniques and Metrics Unlimited
  • Lecture 04 – Case Study: Selection of Techniques and Metrics Unlimited
  • Lecture 05 – Random Variables and Probability Distributions Unlimited
  • Lecture 06 – Probability Distributions I Unlimited
  • Lecture 07 – Probability Distributions II Unlimited
  • Lecture 08 – Probability Distributions III Unlimited
  • Lecture 09 – Stochastic Process Unlimited
  • Lecture 10 – Markov Chain Unlimited
  • Lecture 11 – Slotted Aloha Protocol Model and Discrete Time Birth Death Process Unlimited
  • Lecture 12 – Continuous Time Markov Chain and Queuing Theory Unlimited
  • Lecture 13 – Queuing Theory I Unlimited
  • Lecture 14 – Queuing Theory II Unlimited
  • Lecture 15 – Queuing Theory III Unlimited
  • Lecture 16 – Queuing Theory IV Unlimited
  • Lecture 17 – Queuing Theory V Unlimited
  • Lecture 18 – Queuing Theory VI Unlimited
  • Lecture 19 – Queuing Networks I Unlimited
  • Lecture 20 – Queuing Networks II Unlimited
  • Lecture 21 – Slotted Aloha Markov Model Unlimited
  • Lecture 22 – Simulations I Unlimited
  • Lecture 23 – Simulations II Unlimited
  • Lecture 24 – Simulations III Unlimited
  • Lecture 25 – Operational Laws I Unlimited
  • Lecture 26 – Operational Laws II Unlimited
  • Lecture 27 – Open and Closed Queuing Networks Unlimited
  • Lecture 28 – Approximate MVA Unlimited
  • Lecture 29 – Convolution Algorithm I Unlimited
  • Lecture 30 – Convolution Algorithm II Unlimited
  • Lecture 31 – Load Dependent Service Centers Unlimited
  • Lecture 32 – Hierarchical Decomposition Unlimited
  • Lecture 33 – Balanced Job Bounds Unlimited
  • Lecture 34 – Confidence Interval for Proportions and Introduction to Experimental Design Unlimited
  • Lecture 35 – 2k Factorial Design Unlimited
  • Lecture 36 – 2k r Factorial Design and 2k-p Fractional Factorial Design Unlimited
  • Lecture 37 – Programming Aspects of Discrete-Event Simulations I Unlimited
  • Lecture 38 – Programming Aspects of Discrete-Event Simulations II Unlimited
  • Lecture 39 – Discrete-Event Simulations III Unlimited
  • Lecture 40 – PetriNets I Unlimited
  • Lecture 41 – PetriNets II Unlimited
  • Lecture 42 – PetriNets III Unlimited