Computer Systems Performance

Spring Semester 2006

Schedule

All topics and reading assignments are subject to change as the semester unfolds. (Did you ever wonder how a semester could be unfolded? Or unfold itself? Would there be crease marks?)

Date

Topic

Reading assignment

Jan. 11

Introduction
Operational analysis

Handout: Operational analysis: fundamental laws

Jan. 13

Operational analysis (cont).

Handout: Operational analysis: performance bounds
Handout: Little's Theorem

Jan. 18

Operational analysis (cont.) - Examples

-

Jan. 20

Operational analysis (cont.) - Performance bounds

-

Jan. 23

Operational analysis: Computer network example

-

Jan. 25

Simulation: introduction and discrete-event simulation

Text: Chapters 1 and 2

Jan. 27

Discrete-event vs. process-oriented simulation

-

Jan. 30

Yacsim

Text: Chapter 6
Yacsim manual (for reference)

Feb. 1

Yacsim (cont.)

-

Feb. 3

Random number generation: uniform random numbers

Text: Chapter 3

Feb. 6

Random number generation: non-uniform random numbers:
     Inversion

-

Feb. 8

Random number generation: non-uniform random numbers:
     Composition
     Acceptance/rejection

Text: Chapter 4: 4-4.1

Feb. 10

Chi-square test and applications
Testing for correlation
The Unix random() function

Text: Chapter 4: 4.2-4.3,4.5
Unix function random()

Feb. 13

Estimators
Transient phase elimination

Text: Chapter 5: 5-5.1

Feb. 15

Confidence intervals
Independent replications

Text: Chapter 5: 5.2-5.8

Feb. 17

Confidence intervals (cont.)

Text: Chapter 8

Feb. 20

Stochastic processes
Markov chains

Handout: Stochastic processes
Handout: Markov processes

Feb. 22

Markov process state classifications

Handout: Markov states

Feb. 24

Markov chain classification
The Ergodicity Theorem

Handout: Ergodicity Theorem

Feb. 27

Steady state solutions of discrete time Markov chains

Handout: Solving discrete time Markov chains

Mar. 1

Shared memory multiprocessor (SMMP) model

Handout: Examples of SMMP models and analysis

Mar. 3

SMMP model (cont.)

Handout: Choosing states for Markov chains
Handout: Virtual memory

Mar. 6

Yacsim - communicating among processes

Text: Chapter 7

Mar. 8

Continuous time Markov chains

Handout: Continuous time Markov chains

Mar. 10

Continuous time Markov chains (cont.)

-

Mar. 20

Continuous time Markov chains (cont.)

-

Mar. 22

Embedded discrete time Markov chains

Handout: Embedded discrete time Markov chains

Mar. 24

Introduction to queueing theory - the M/M/1 queue

Handout: Simple Queues

Mar. 27

M/M/2, M/M/s/n/m, M/M/inf queues

Handout: M/M/1 probabilities
Handout: Arrival-time occupancy distribution of M/G/1 queue

Mar. 29

M/M/* queues (cont.)

-

Mar. 31

M/G/1 queue - Pollaczek-Khinchin Mean Value Formula

Handout: M/G/1 queue
Handout: M/G/1 queue with priority

Apr. 3

M/G/1 queue - application to disk response time calculation

-

Apr. 5

Queueing networks: Jackson networks
Laplace transforms

Handout: Jackson networks
Handout: Laplace transforms

Apr. 10

BCMP (product-form) networks
Coxian distributions

Handout: BCMP networks
Handout: Coxian distributions

Apr. 12

Analyzing product-form (BCMP) networks

-

Apr. 14

Mean Value Analysis: Open, single class systems

Handout: Mean Value Analysis

Apr. 17

Mean Value Analysis: Closed, single class systems

-

Apr. 19

Mean Value Analysis: Closed, multiple class systems

-

Apr. 21

Flow-equivalent service centers

Handout: Flow-equivalent service centers

Apr. 24

Flow-equivalent service centers (cont.)

-

Apr. 26

Flow-equivalent service centers (cont.)
Course evaluations

-

Return to Elec 428 home page