Computer Systems Performance

Spring Semester 2006

Course handouts:

• Operational Analysis
• Bounds on performance
• Simple Queues
• Markov Processes
• Semi-Markov processes
  
• Markov chain state classification
• The Ergodicity Theorem
• Choosing states for Markov chain models
• Solving discrete-time Markov chains
• Examples of shared memory multiprocessor analysis
• Analysis of performance of virtual memory system
• Continuous time Markov chains
• The M/G/1 queue
• Laplace transforms
• The M/G/1 queue with priority
• Jackson's Theorem for queueing networks
• The BCMP Theorem
• Coxian distributions
• Mean Value Analysis (MVA)
• Convolution with load-independent servers
  
• Convolution with load-dependent servers
  
• Solutions of the machine repair model
• Embedded discrete time Markov chains
• M/M/1 queue arrival and departure times occupancy distributions
  
• M/G/1 queue arrival times occupancy distribution
  
• Excel workbook: MVA for two-class systems (max. 4 in each class)
  
• Tips on writing reports

Return to Elec 428 home page