| Unit |
Date |
Topic |
Slides, Handouts, Videos |
Reading Assignments |
| Introduction, History of OS |
Fri Sep 02 |
History of OS |
Slides CISC-3595-intro-history,
|
Read chapter 1 |
| Chapter 1, What is an OS? |
Tue Sep 06 |
User View, System View, Hardware, Components |
Lectures slides: CISC-3595-L1-ch1-2,
Slides From textbook: ch1.ppt
video: UC Berkeley Lecture 1
|
Finish chapter 1, Start chapter 2,
|
| Chapter 2, OS Structures |
Fri Sep 09 |
OS Structures - Kernel, System calls, Systems programs, Shell |
Slides From textbook: ch2.ppt
lectures: CISC-3595-L1-ch1-2,
video: UC Berkeley Lecture 2,
note: Linux-cmdline-tools.pdf
|
Finish chapter 2,
Dynamic Interrupt Handling"
|
Ch2, OS Structure;
Ch3 Process Mgmt |
Tue Sep 13 |
Operating System Structure, Processes, life cycle |
Slides CISC-3595-L2-ch3.ppt |
Start chapter 3 |
| Chapter 3, Process Management |
Fri Sep 16 |
Processes, process memory map, process control block |
Slides From textbook: ch3.ppt
lectures: CISC-3595-L2-ch3.ppt
video: UC Berkeley Lecture 3
|
Read chapter 3 |
| Process Mgmt Lab |
Tue Sep 20 |
Write a program to create and execute a process. |
Lab Writeup
Slides CISC-3595-L2-ch3.ppt |
Finish Chapter 3 |
| Interprocess Communication |
Fri Sep 23 |
Message passing, Shared memory, Asynchronous, Synchronous communication |
Slides From textbook: ch3.ppt
lectures: CISC-3595-L2-ch3.ppt
IPC C APIs
Pipes,
Message Queues,
Sockets,
|
Finish Chapter 3,
code: forklook.cpp
forkloopshared.cpp
oldsharedmem.c |
| Threads |
Tue Sep 26 |
Threads, relationship to processes, creation/termination |
Slides from textbook: ch4.ppt
lectures: CISC-3595-L3-ch4.ppt
video: thread intro
|
Read chapter 4, Homework:
|
| Threads |
Fri Sep 30 |
Preemptive, non-premptive, cpu bursts, scheduling latency, considerations |
Slides CISC-3595-L4-ch5.ppt
multithreading, hyperthreading |
Finish chapter 4, Homework:
|
| CPU scheduling |
Tue Oct 04 |
Round-robin, openMP |
Slides CISC-3595-L4-ch5.pptx |
Start chapter 5, OpenMP Tutorial
omp-hands-on-tutorial.pdf
|
| CPU Scheduling Lab |
Fri Oct 07 |
scheduling algorithm performance on a set of processes, starvation |
Slides CISC-3595-L4-ch5.pptx
Stanford slides |
Finish chapter 5, Homework
|
| Process Synchronization |
Tue Oct 11 |
Critical sections, Peterson's, Atomic hardware solutions |
CISC-3595-L6-ch6.ppt)
Critical Regions |
Read chapter 6 |
| Process Synchronization |
Fri Oct 14 |
Critical Sections, Semaphores, Classic problems |
CISC-3595-L6-ch6.ppt or an alternative to our book
Stallings pdf |
Start to Review |
| Process Synchronization |
Tue Oct 18 |
Mutexes, spinlocks, Semaphores, Classic problems |
CISC-3595-L6-ch6.ppt or an alternative to our book
Stallings pdf |
Start to Review |
| Midterm Review |
Fri Oct 21 |
Review for midterm exam |
Midterm Study (150) Slides:
Midterm-Review-ch1-3,
Midterm-Review-ch4-6
Tannenbaum: Processes and Threads
|
Review chapters 1-6, Process Synchronization including Semaphores |
| Midterm |
Tue Oct 25 |
Processes, Threads, IPC, CPU Scheduling, Process Synchronization Concepts |
midterm exam |
Start Chapter 7 |
| Process Synchronization |
Fri Oct 28 |
Producer-Consumer, Readers-Writers, Dining Philosophers, Monitors |
CISC-3595-L6-ch6.ppt
alternative to our book
Stallings pdf |
Start to Review |
| Midterm Answers |
Tue Nov 01 |
Processes, Threads, CPU Scheduling, Process Synchonization concepts |
Midterm answers
|
Read Chapter 6.1, 6.2, 6.3 |
| Process Synchronization |
Tue Nov 01 |
Processes, Threads, CPU Scheduling, Process Synchonization concepts |
CISC-3595-L7-ch7.ppt
10th Edition ch7.ppt
|
Finish 6, Read Chapter 7 |
| Bounded Buffer Lab |
Fri Nov 04 |
Bounded buffer, readers-writers, Monitors |
CISC-3595-L6-ch6.ppt or an alternative to our book
Stallings pdf |
Read chapter 7-8 |
| Deadlocks |
Tue Nov 08 |
Deadlocks, Deadlock detection, Algorithms |
CISC-3595-L6-ch6.ppt
10th Edition ch8.ppt
an alternative to our book
deadlocks.pdf
| Finish chapter 8 |
| Deadlocks |
Fri Nov 11 |
Deadlocks, Deadlock detection, Algorithms |
CISC-3595-L6-ch6.ppt
10th Edition ch8.ppt
an alternative to our book
deadlocks.pdf
| Finish chapter 8 |
| File System Interface |
Tue Nov 15 |
File System open, close, read, write, sequential, direct(random) access, partitions |
Slides CISC-3595-L5-ch13.ppt
More details in FileSystemInterface.pdf
UMass Video Lecture 15: File System Interface |
Read Chapter 13 |
| File System Implementation |
Fri Nov 18 |
File System open, close, read, write, sequential, direct(random) access, partitions |
Slides CISC-3595-L5-ch14.ppt
More details in FileSystemInterface.pdf
UMass Video Lecture 15: File System Interface |
Read Chapter 13 |
| File Systam, Implementation |
Tue Nov 22 |
File protection, metadata, soft links, hard links, cyclic graphs |
Slides CISC-3595-L5-ch14.ppt
UMass Video Lecture 16: File System Implementation |
Finish Chapter 11 |
| Main Memory |
Tue Nov 29 |
Memory Management - Contiguous memory allocation |
CISC-3595-L7-P1-ch7.ppt
UMASS OS Lecture 11 Main Memory |
Read Chapter 9 |
| Memory Managment Paging |
Fri Dec 02 |
Memory Management - Relocation and Paging |
CISC-3595-L7-P2-ch8.ppt
UMASS OS Lecture 12 Paging and Segmentation |
Read Chapter 9 |
| Virtual Memory |
Tue Dec 06 |
Virtual Memory - Demand Paging |
CISC-3595-L7-P2-ch8.ppt
UMASS OS Lecture 13 Demand Paging |
Read Chapter 10 |
| Finish Virtual Memory |
Fri Dec 09 |
Thrashing, Working set |
CISC-3595-L9-ch16.ppt
socket-programming
advanced socket
|
Finish Chapter 12 |
| Final Exam Review |
Tue Dec 13 |
Finish up Virual Memory |
In Class Assignment:
|
Finish chapter 12 |
