Computer Science Department
College of Arts and Sciences

CAS CS350
Fundamentals of Computing Systems


Course Schedule

Date Topic Readings

9/05

Review of Computer System Organization

[S:1,2]

9/07

Hardware synchronization and Interrupt Handling

[S:1,2]

9/10 The Concept of a Process, Process State and Process State Transitions [S:3.1-3.3]

9/12

Performance Metrics of Computing Systems

[W][S:App9A]

9/14 Elementary Probability: Basics [W]

9/17

Elementary Probability: Probability Distribution

[W]

9/19

Elementary Probability: Random variables and expectation

[W]

9/21 Elementary Probability: Random variables and expectation [W]

9/24

Elementary Statistics: Sampling and Estimation

[W]

9/26

Elementary Statistics: Building Confidence in Metric Estimates

[W]

9/28

Review of Elementary Probabilistic and Statistical Analysis

10/01

Exam #1 (1:00pm-2:00pm in SCI 115)

10/03

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

[W][S:App9B]

10/05

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

[W]

10/09

Elementary Queuing Analysis: Queuing Networks [W]

10/10

Elementary Queuing Analysis: Case Study

[W]

10/12

Empirical Performance Evaluation: Discrete Event Simulation

[W]

10/15

Empirical Performance Evaluation : Discrete Event Simulation

[W]

10/17 Review of Elementary Performance Analysis 
10/19 Exam #2 (1:00pm-2:00pm in SCI 115)

10/22

Resource Management: Scheduling Fundamentals [S:9.1-9.2]

10/24

Resource Management: Basic Scheduling Algorithms

[S:9.2]

10/26 Resource Management: Basic Scheduling Algorithms [S:9.2]

10/29

Resource Management: Real-Time and Priority-Based Scheduling

[S:10.2] [W]

10/31

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

[S:11.5]

11/02 Principles of Concurrency and Process Synchronization [S:5.1]

11/05

Mutual Exclusion: Dekker's Algorithms

[S:5.2]

11/07

Mutual Exclusion: Peterson's Algorithms

[S:5.2]

11/09 Mutual Exclusion: Semaphores  [S:5.4]

11/12

Mutual Exclusion: Semaphore Implementation [S:5.3-5.4]

11/14

Mutual Exclusion: Producer/Consumer Problem

[S:5.4]

11/16

Mutual Exclusion: Reader/Writer Problem

[S:5.4]

11/19

Exam #3 (1:00pm-2:00pm in SCI 115)

11/26

Classical Synchronization Problems: The Barbershop Problem

[S:5.4]

11/28

Classical Synchronization Problems: The Dining Philosophers Problem

[S:6.6]

11/30

Classical Synchronization Problems: Deadlock Management

[S:6.1-6.4]

12/03

Classical Synchronization Problems: Transactional Systems

[W]

12/05

Distributed Algorithms: The Distributed Global Snapshot Problem

[S:13,14.2]

12/07

Review of Resource Management and Synchronization

12/10

Course Conclusion

 

12/17

Final Exam (3:00pm-5:00pm)

 

 Updates to this schedule will be announced and posted if need be.


Created on: 1997-10-01
Updated on: 2005-07-22

Maintainer: Azer Bestavros