1/16

Review of Computer System Organization

[S:1,2]

1/18

The Concept of a Process, Process State and Process State Transitions

[S:3.1-3.3]

1/23

Performance Metrics of Computing Systems

[W][S:App9A]

1/25

Elementary Queuing Analysis: Elementary probability

[W]

1/30

Elementary Queuing Analysis: Random variables and expectation

[W]

2/01

Elementary Queuing Analysis: The M/M/1 queuing model

[W][S:App9B]

2/06

Elementary Queuing Analysis: Queuing Networks

[W]

2/08

Elementary Queuing Analysis: Case Study

[W]

2/13

Empirical Performance Analysis: Discrete Event Simulation

[W]

2/15

Empirical Performance Analysis: Measurements, Sampling and Estimation

[W]

2/22

Empirical Performance Analysis: Building Confidence in Metric Estimates

[W]

2/27

3/13

3/15

Resource Management: Basic Scheduling Algorithms

[S:9.2]

3/20

Resource Management: Real-Time and Priority-Based Scheduling Algorithms

[S:10.2] [W]

3/22

Resource Management: State-Sensitive (I/O) Scheduling Algorithms

[S:11.5]

3/27

Principles of Concurrency and Process Synchronization

[S:5.1]

3/29

Mutual Exclusion: Dekker's and Peterson's Algorithms

[S:5.2]

4/03

Mutual Exclusion: Semaphores and Producer/Consumer Problems

[S:5.4]

4/05

Mutual Exclusion: Semaphore Implementation

[S:5.3-5.4]

4/10

Classical Synchronization Problems: The Barbershop Problem

[S:5.4]

4/12

Classical Synchronization Problems: The Dining Philosophers Problem

[S:6.6]

4/17

Classical Synchronization Problems: Deadlock Management

[S:6.1-6.4]

4/19

Classical Synchronization Problems: Transactional Systems

[W]

4/24

Distributed Algorithms: The Distributed Global Snapshot Problem

[S:13,14.2]

4/26

Review of Resource Management and Synchronization

5/01

Course Conclusion

5/10

Final Exam (9:00am-11:00am)