课程门户-章节详情

邹青青

Introduction
- ● What Is an Operating System?
- ● History of Operating Systems
- ● Operating System Concepts
Process Description and Control
- ● Introduction to Processes
  - ● Pocess Image
  - ● Classical IPC Problems
- ● Concurrency
  - ● Mutal Exclusion
  - ● Synchronization
  - ● Classical Co-operation Problems
Scheduling
- ● Job Scheduling
- ● Process Scheduling
- ● Realtime Schdeduling
- ● Deadlock
- ● Deadlock avoidance
- ● Deadlock detection
Memory Management
- ● Swapping
- ● Basic Memory Management
  - ● Partitionning
  - ● Paging
  - ● Segmation
- ● Multi-level Page Table
- ● Virtual Memory
  - ● concepts
  - ● Page Replacement Algorithm
Input / Output
- ● Principles of IO Hardware
- ● Principles of IO software
- ● RAM Disks
File System
- ● Files
- ● Directories
- ● File System Implementation
- ● Physical Structure of File
Operating system experiment projects
- ● Linux System Calls
- ● Message Mechanism And Process Scheduling
- ● Memory Management
- ● Process Concurrence
习题课（Practices）
- ● Practice One
  - ● Practice Two
    - ● Practice Three

Swapping

教学目的及要求

Aim: master the relevant algorithms and methods of basic memory management, swapping, and virtual memory.

Requirement: some basic knowledge of data structure and memory management unit.

教学重点及难点

Emphasizing: multi programming with swapping, segmentation.

Difficulties: paging.

教学内容

Term	Description
Frame	Fixed-length block of main memory.
Page	Fixed-length block of data in secondary memory (e.g. on disk).
Segment	Variable-length block of data that resides in secondary memory.