Date

Topic

Readings

1/16

Hardware synchronization and Interrupt Handling

[S:1,2]

1/21

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/28

Elementary Probability: Basics of probability Distributions

[W]

1/30

Elementary Statistics: Sampling, Estimation, and Confidence Intervals

[W]

2/04

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

[W][S:App9B]

2/06

Empirical Performance Evaluation: Discrete Event Simulation

[W]

2/11

Elementary Queuing Analysis: Variations on M/M/1 queuing model

[W]

2/13

Elementary Queuing Analysis: Queuing Networks and Case Studies

[W]

2/20

Exam #1

2/25

Resource Management: Scheduling Fundamentals

[S:9.1]

2/27

Resource Management: Basic Scheduling Algorithms

[S:9.2]

3/04

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

[S:10.2] [W]

3/06

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

[S:11.5]

3/18

Principles of Concurrency and Process Synchronization

[S:5.1]

3/20

Mutual Exclusion: Dekker's and Peterson’s Algorithms

[S:5.2]

3/25

Mutual Exclusion: Semaphores  and their implementation

[S:5.3-5.4]

3/27

4/01

Exam #2

4/03

Mutual Exclusion: Producer/Consumer and Reader/Writer Problems

[S:5.4,5.7]

4/08

Classical Synchronization: The Barbershop and Dining Philosophers Problems

[S:5.4][S:6.6]

4/10

Deadlock Management: From Detection to Avoidance

[S:6.1-6.4]

4/15

Distributed Synchronization: The Distributed Global Snapshot Problem

[S:13,14.2]

4/17

Classical Synchronization Problems: Transactional Systems

[W]

4/22

Classical Synchronization Problems: Transactional Systems

[W]

4/24

4/29

Review and Conclusion

5/09

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