Operating Systems, CSCE
4413
Schedule, Fall 2001
This is the working schedule for the course. It is subject
to change, so check it often! Check the page on assignments
for a complete list of all assignments. Last updated November 27, 2001.
- Tuesday, August 28
- introduce self, students,
syllabus
- Introduction to course
- text, Chapters 1 and 2
- Linux intro
- Thursday, August 30
- Chapter 2 and 3
- more Linux intro
- Homework 1
assigned, due on Thursday, September 13
- Tuesday, September 4
- text, Chapter 4
- Process concept, scheduling, cooperating processes
- Thursday, September 6
- Producer-consumer problem and first solution
- Interprocess communication
- simple sockets example
- Tuesday, September 11
- text, Chapter 5
- multithreading models
- pthreads examples
- Thursday, September 13
- threading issues
- more pthreads examples
- Homework 2
assigned, due on Thursday, September 27.
- Tuesday, September 18
- text, Chapter 6
- scheduling criteria
- scheduling algorithms
- Thursday, September 20
- scheduling algorithms, continued
- multiple processor scheduling
- Tuesday, September 25
- real-time scheduling
- models
- Thursday, September 27
- text, Chapter 7
- race conditions
- Tuesday, October 2
Test 1, on Chapters 1 through 6.
- Thursday, October 4
- the critical section problem
- software solutions for two processes and multiple processes
- hardware solutions
- Homework 3
assigned, due on Thursday, October 18.
- Tuesday, October 9
- semaphores
- classic problems
- Pthreads mutex locks
- Thursday, October 11
- monitors
- Pthreads condition variables
- Tuesday, October 16
- semaphore and condition variable programming examples
- Java monitors
- synchronization in Solaris
- Thursday, October 18
- text, Chapter 8
- Deadlocks
- deadlock prevention
- Homework 4
assigned, due on Tuesday, November 6.
-
-
- Tuesday, October 23
- deadlock avoidance
- deadlock recovery
- Thursday, October 25
- text, Chapter 9
- memory management
- Tuesday, October 30
- swapping, contiguous memory allocation
- Thursday, November 1
- paging
- segmentation
- segmentation and paging
- Tuesday, November 6
- text, Chapter 10, virtual memory
- cost of demand paging
- Thursday, November 8
-
Test 2, on Chapters 7 through 9.
- Tuesday, November 13
- Chapter 10, continued.
- process creation
- page replacement
- Thursday, November 15
- page replacement, continued
- allocation of frames, thrashing
- working set model
- program structure, section 10.8.5
- Homework 5
assigned. Part 1 due on Thursday, December 6. No late papers accepted on Part 1!
Part 2 due on Tuesday, December 11.
- Tuesday, November 20
- TLB reach, section 10.8.3
- I/O interlock, section 10.8.6
- file system interface, sections 11.1, 11.2
- review of disk structure, section 2.3.2
- file system structure, section 12.1
- file system mounting, section 11.4, the UNIX
mount utility and /etc/fstab
- Thursday, November 22
Happy Thanksgiving!! No class.
- Tuesday, November 27
- file system implementation, section 12.2
- directory implementation, section 12.3
- allocation methods, section 12.4
- If you are interested in additional reading, a description of the ext2 file system can be found
here
- Thursday, November 29
- allocation methods, continued, section 12.4
- NFS, section 12.9
- Tuesday, December 4
Test 3, comprehensive over Chapters 1-12
- Thursday, December 6
-
Tuesday, December 11
Last Day of class!!
-
Friday, December 14
- Last day to turn in any papers!