BU CAS CS-350 Fall '02

Tentative Syllabus & Schedule
Last modified on 12/10/2002

The following schedule and reading list is tentative, and will be updated frequently to reflect what we actually do in class. See also the registrar's calendar for relevant deadlines and events.

#

Date Topic(s) Homework Readings
(See also Lecture Slides)
1 9/3 Course introduction, logistics & policies
2 9/5 Hurry up and wait: basic queueing with flow conservation and Little's Law Slides
3 9/10 Review of computer organization HW-01 1.1-7
4 9/12 The difference between saying and doing: From program to process 3.1-3
5 9/17 My system is better than yours: System quality attributes and metrics Slides
6 9/19 System modeling with probability Notes on Probability (by A. Bestavros)
7 9/24 System modeling with probability

"

8 9/26 Metrics of distributions and what they mean HW-02 Notes on Distributions (by A.B.)
9 10/1 The Normal distribution and statistics

Notes on Statistics (by A.B.)
10 10/3 Cancelled--To be rescheduled
11 10/8 Queuing models: Analyzing the M/M/1 Queue Notes on Queuing (by A.B.)
12 10/10 Using queueing results for capacity planning and for designing better schedulers (fairness vs. response time)

Notes on Multiple-Que Models (by A.B.)

-- 10/15 --No class (Monday schedule)--    
13 10/17 Resource scheduling: CPU, memory, disk HW-03 9.1-2
14 10/22 CPU scheduling to optimize different metrics 9.3, 9A, 9B
15 10/24 Mid-term exam
16 10/29 Disk scheduling to minimize access time 11.4, 5
17 10/31 Concurrency: basic definitions 5.1
18 11/5 Concurrency: solving the critical section problem using low-level software HW-04 5.2-3
19 11/7 Concurrency:
- High-level software solutions to the critical section problem
- The producer/consumer problem
5.4-7
20 11/12 Concurrency: deadlock detection and avoidance HW-05 6.1-6
21 11/14 Concurrency: the problem of ordering events in distributed systems Leslie Lamport, "Time, Clocks and the Ordering of Events", CACM, 1978
22 11/19 Concurrency: Logical (Lamport) clocks

"

23 11/21 Security: what does it mean? why is it difficult? Butler Lampson, "Computer Security in the Real World", ACSAC, New Orleans, 2000
24 11/26 Security: specifying trust via the "speaks-for" relation

"

-- 11/28 --Thanksgiving--  
25 12/3 HW-06
26 12/5
27 12/10 Course review and conclusion
-- 12/16 Final exam (9:00-11:00am, place TBA)