IN OS:

Chapter 6 CPU Scheduling

Basic Concepts

Scheduling Criteria five criteria be able to discuss and apply with evidence.

Scheduling Algorithms FCFS, SJF (optimal), RR (be able to set and justify quantum size), SRTF, Priority - be able to apply each to a set of processes to find the sequence and calculate average wait time (we did a workshop on this). Be able to discuss related to Short Term Scheduler, medium term, long term. Be able to discuss and apply optimization criteria. Be able to determine the best algorithm for different queues in a multilevel queue system and justify selection.

Real-Time CPU Scheduling be able to discuss requirements of RT and how scheduling needs to address those needs. Be able to use examples or do problems. Be able to discuss how the requirements can be met for hard and soft RT.

Algorithm Evaluation using criteria or formulas

Chapter 7 Deadlock

System Model

Deadlock Characterization what is a deadlock, deadlock identification

Methods for Handling Deadlocks

Deadlock Prevention

Chapter 8 Main Memory

Basic concepts

Segmentation

Paging be able to do problems like the workshop and homework

Structure of the Page Table various enhancements (validity bits).

Modern OS implementations

Chapter 9 Virtual Memory:

Basic Concepts

Demand Paging

Copy-on-Write - dirty bit

Page Replacement

Thrashing

Memory-Mapped Files

Allocating Kernel Memory

Other Considerations

Operating-System implementations.