Queueing Theory For Computer Scientists

Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

Queueing Theory For Computer Scientists

In computer systems, queues occur in front of almost all systems and components, such as CPUs, disks, switches, links, and servers. This first course designed for computer science students will help you to understand the impact of your design decisions on the response times and buffering required at various resources. Most of the techniques presented here are simple (back of the envelope) techniques that can be used for quick analysis.

As a prerequisite, a basic understanding of probability and statistics is helpful. Some of it will be reviewed as needed.

To download slides or to listen to audio recordings of the lectures, please click on the lecture title.

 

    1. Course Introduction
      • Goals of This Course
      • Queueing Models: What will learn?
      • Prerequisite
      • Tentative Schedule
      • Homeworks
      • Text Book
      • Other Related Topics
      • Quiz 0: Prerequisites

 

    1. Introduction to Queueing Theory
      • Basic Components of a Queue
      • Kendall Notation A/S/m/B/K/SD
      • Exponential/Erlang/Hyper-Exponential Distribution
      • Group Arrivals/Service
      • Rules for All Queues
      • Little’s Law
      • Stochastic Processes
      • Discrete/Continuous State Processes
      • Markov Processes
      • Birth-Death Processes
      • Poisson Distribution
      • Poisson Processes
      • PASTA Property
      • Relationship Among Stochastic Processes

 

    1. Analysis of A Single Queue
      • Birth-Death Processes
      • M/M/1 Queue
      • M/M/m Queue
      • M/M/m/B Queue
      • Other Queues

       

    2. Queueing Networks
      • Open Queueing Networks
      • Closed Queueing Networks
      • Mixed Queueing Networks
      • Product-Form Network
      • General Open Network of Queues
      • Closed Product-Form Networks
      • Machine Repairman Model
      • Central Server Model
      • Types of Service Centers

 

    1. Operational Laws
      • Utilization Law
      • Forced Flow Law
      • Bottleneck Device
      • Transition Probabilities
      • Little’s Law
      • General Response Time Law
      • Interactive Response Time Law
      • Bottleneck Analysis
      • Asymptotic Bounds

 

  1. Mean Value Analysis and Related Techniques
    • MVA Steps
    • MVA Assumptions
    • Review of key queueing theory concepts

 

Join now 

Show More

What Will You Learn?

  • Introduction to Queueing Theory
  • Analysis of A Single Queue
  • Queueing Networks
  • Operational Laws for Computer Systems Performance Evaluation
  • Mean Value Analysis and Related Techniques

Course Content

Queueing Theory For Computer Scientists

  • Introduction to Queueing Theory: Part 1
    00:00
  • Introduction to Queueing Theory: Part 2
    00:00
  • Analysis of A Single Queue
    00:00
  • Queueing Networks
    00:00
  • Operational Laws for Computer Systems Performance Evaluation: Part 1
    00:00
  • Operational Laws for Computer Systems Performance Evaluation: Part 2
    00:00
  • Mean Value Analysis and Related Techniques: Part 1
    00:00
  • Mean Value Analysis and Related Techniques: Part 2
    00:00

Student Ratings & Reviews

No Review Yet
No Review Yet
ResearcherStore

Want to receive push notifications for all major on-site activities?