CS 3733 Operating Systems Daily Topics
Listed here are the topics covered in each class.
1. Tuesday, August 27
Introductory Lecture, what is an OS?
2. Thursday, August 29
A short history of computing, Chapter 1 of PUP: makeargv
3. Tuesday, September 3
Linkage and storage classes, Processes
4. Thursday, September 5
fork and wait in Unix, Chpater 3 of PUP: Files
5. Tuesday, September 10
Directories, inodes, links
6. Thursday, September 12
File handles, file descriptor table, file pointers, dup2, pipe
7. Tuesday, September 17
Assignment 1: malloc and free, from PUP: Read and write, nonblocking I/O,
select
8. Thursday, September 19
select, named pipes, special files: the audio device, ioctl,
the proc file system
9. Tuesday, September 24
The proc file system, assignment 2, PUP Chapter 4
10. Thursday, September 26
Interprocess Communication and Synchronization (Tanenbaum, section 2.2)
Process synchronization, producer/consumer, critical secions,
Peterson's solution
11. Tuesday, October 1
Peterson's solution, Test-and-set, Swap
12. Thursday, October 3
Semaphores, Classical Problems in Synchronizaion
13. Tuesday, October 8
Monitors, bounded buffer problem, readers and writers, dining philosophers
14. Thursday, October 10
Exam review, dining philosophers
15. Tuesday, October 15
16. Thursday, October 17
17. Tuesday, October 22
Return and go over exam, continue signals starting with sigaction up to
pause.
18. Thursday, October 24
Signals, starting with sigsuspend through slow system calls
19. Tuesday, October 29
async-signal-safe, siglongjmp and sigsetjmp, realtime signals
20. Thursday, October 31
Example 5.20 from PuP, Process scheduling (from Tanenbaum, Section 2.4)
through FCFS.
21. Tuesday, November 5
Return and discuss Assignment 3, Part 1, Continue Process Scheduling
22. Thursday, Novmeber 7
VAX and UNIX process scheduling,
begin PUP chapter 12, network communication.
23. Tuesday, November 12
Network communication, start UICI implementation
24. Thursday, Novmeber 14
UICI implementation, about assignment 5,
start memory management from Tanenbaum, Chapter 3: partitions
25. Tuesday, November 19
Assignment 4 due, memory management: variable size partitions, swapping,
paging
26. Thursday, Novmeber 21
Student evaluations, virtual memory
27. Tuesday, November 26
Page replacement algorithms
28. Tuesday, December 3
Last class, Assignment 5 due