Computer Science Department
College of Arts and Sciences
Date
|
Topic
|
Readings
|
1/11 |
Review of Computer System Organization |
[S:1,2] |
1/13 |
The Concept of a Process, Process State and Process State Transitions |
[S:3.1-3.3] |
1/20 |
Performance Metrics of Computing Systems |
[W] |
1/25 |
Elementary Queuing Analysis: Review of elementary probability |
[S:A], [W] |
1/27 |
Elementary Queuing Analysis: The M/M/1 queuing model |
[S:A], [W] |
2/01 |
Elementary Queuing Analysis: Queuing Networks |
[S:A], [W] |
2/03 |
Elementary Queuing Analysis: Case Study |
[W] |
2/08 |
Empirical Performance Analysis: Discrete Event Simulation |
[W] |
2/10 |
Empirical Performance Analysis: Measurements, Sampling and Estimation |
[W] |
2/15 |
Empirical Performance Analysis: Building Confidence in Metric Estimates |
[W] |
2/17 |
Resource Management: Scheduling Fundamentals |
[S:9.1] |
2/24 |
Resource Management: Basic Scheduling Algorithms |
[S:9.2] |
2/29 |
Resource Management: Real-Time and Priority-Based Scheduling Algorithms |
[S:10.2] [W] |
3/02 |
Resource Management: State-Sensitive (I/O) Scheduling Algorithms |
[S:11.5] |
3/14 |
Midterm Exam (3:30pm-5:00pm in SMG-105) |
|
3/16 |
Principles of Concurrency and Process Synchronization |
[S:5.1] |
3/21 |
Mutual Exclusion: Dekker's Algorithm |
[S:5.2] |
3/23 |
Mutual Exclusion: Peterson's Algorithm |
[S:5.2] |
3/28 |
Mutual Exclusion: Semaphores and Producer/Consumer Problems |
[S:5.4] |
3/30 |
Mutual Exclusion: Semaphore Implementation |
[S:5.4] |
4/04 |
Classical Synchronization Problems: The Barbershop Problem |
[S:5.4] |
4/06 |
Classical Synchronization Problems: Deadlock Management |
[S:6.1-6.4] |
4/11 |
Classical Synchronization Problems: The Dining Philosophers Problem |
[S:6.6] |
4/13 |
Classical Synchronization Problems: Transactions and Serializability |
[W] |
4/18 |
Classical Synchronization Problems: Logging and Recovery |
[W] |
4/20 |
Distributed Algorithms: The Distributed Global Snapshot Problem |
[S:13,14.2] |
4/25 |
Distributed Algorithms: The Clock Synchronization Problem |
[S:13,14.2] |
4/27 |
Course Conclusion: Review of Performance Evaluation and Scheduling |
|
5/02 |
Course Conclusion: Review of Concurrency Management |
|
5/11 |
Final Exam (9:00am-11:00am) |
|
Updates to this schedule will be announced and posted
if need be.
Created on: 1997.10.01 Updated on: 2000.01.10 Maintainer: Azer Bestavros