1. Silberschatz and Galvin  1999 7.1 Chapter 3:Processes Processes –State of a process, process control block, –Scheduling of processes  Long term scheduler, short term scheduler, medium-term scheduler (swapping)  Degree of multiprogramming  Context switch –Operation on processes  Process creation, fork, execlp, execvp system calls in UNIX –Interprocess communication – message passing, shared memory, blocking and nonblocking send and receive. Threads –Difference between a process and a thread

2. Silberschatz and Galvin  1999 7.2 Chapter 4: Threads Benefits of threads: –responsiveness, resource sharing, economy, processor utilization User level and kernel level threads Mulithreading models –Many-to-one, one-to-one, many-to-many,

3. Silberschatz and Galvin  1999 7.3 Chapter 5: Process Synchronization The critical section problem Synchronization mechanisms –Hardware instruction support (e.g. test and set instruction, swap instruction). –Should know how to solve synchronization problems using “test and set” instruction, and “swap” instruction. –Semaphores  Binary semaphores, counting semaphores  Should know how to solve synchronization problems using semaphores  Problems with using semaphores –Deadlock, starvation, wrong use of semaphores –Monitors  Should know how to use monitors for solving synchronization problems Classical synchronization problems –The bounded buffer problem –Readers writers problem –Dining philosophers problem

4. Silberschatz and Galvin  1999 7.4 Chapter 6: CPU Scheduling What is CPU scheduling? –Short term scheduler –Preemptive scheduling, Non-preemptive scheduling –Scheduling criteria  CPU utilization, throughput, turnaround time, waiting time, response time Scheduling algorithms –FCFS, SJF, Priority scheduling, Round-robin scheduling –Multilevel queue scheduling, multilevel feed back queue scheduling –Know the working of the above scheduling algorithms and the advantages and disadvantages –Know to calculate average waiting time and average turnaround time. How are various scheduling algorithms evaluated –Deterministic modeling, queuing models, simulations, implementations Multiprocessor Scheduling –AMP, SMP scheduling; processor affinity, load balancing, Real-time scheduling (only what I talked about in class)

5. Silberschatz and Galvin  1999 7.5 Mid term exam : Point distribution Approximate Distribution of points: –Chapters 1 and 2: 10 points –Chapters 3 and 4 (processes, threads): 30 points –Chapter 5 (Synchronization): 40 points –Chapter 6 (CPU scheduling): 20 points

6. Silberschatz and Galvin  1999 7.6