Operating System Concepts 7th Edition(精簡版，淺顯易懂，廣受台灣交大學生好評)

djo6j86j86

Operating System Concepts 7th Edition(精簡版，淺顯易懂，廣受台灣交大學生好評)
共分八個章節，每一個章節大約十幾頁word檔：
Chapter 1簡介.... 2

1.1What is an operating system. 2

1.2Mainframe System. 3

1.2.1 批次系統：Batchsystem. 3

1.2.2 多元程式系統(Multiprogramming). 4

1.2.3分時（多工）(Time-sharing 或稱Multitasking). 5

1.3Desktop system. 6

1.4多處理器系統(multiprocessorsystem). 7

1.5 分散式系統(DistributedSystems). 8

1.6 叢集式系統(clusteredsystem). 8

1.7即時系統(Real-timesystem). 9

Exercise. 10

Chapter2 電腦系統架構.... 2

2.1Computer-system operation. 2

2.2I/O 結構.... 6

2.2.1I/O中斷.... 6

2.2.2DMA（Direct Memory Access）:. 10

2.4storage structure. 11

2.4.1caching. 11

2.4.2coherency and consistency. 12

2.5 hardwareprotection. 12

2.5.1dual-mode operation. 12

2.5.2I/O protection. 13

2.5.4CPU protection. 13

Exercises


. 14

CHAPTER 3 OPERATIING SYSTEM STRUCTURE
CHAPTER 4 PROCESS. 2

4.1 程序的概念... 2

4.1.1 process. 2

4.1.2 程序狀態 (state). 2

4.1.4 Threads. 3

4.2 程序排程... 3

4.2.1 排程佇列 (scheduling). 4

4.2.2 排程器(scheduler). 4

4.2.3 Context Switch. 5

4.3 Operations on process. 5

4.3.1 Process Creation. 5

4.3.2 程序結束... 7

4.4 Thread 執行緒... 7

4.4.1 動機... 7

4.4.2 使用threads可以獲得什麼好處... 8

4.4.3 user and kernelthreads. 8

4.4.4 多執行緒模型... 8

many-to-one model. 8

one-to-one model. 9

many-to-many model. 9

4.5 Interprocess Communication (IPC). 9

4.6 Communication in Client-Server Systems. 9

4.6.1 sockets. 9

Exercises


. 11

5.1 基本概念. 1

5.1.1CPU—I/O Burst Cycle. 1

5.1.2CPU Scheduler (排程程式). 1

5.1.3Preemptive Scheduling. 1

5.1.4 分派程式(Dispatcher). 2

5.2 Scheduling criteria
(判斷排程演算法好壞的評斷標準)
2

5.3 各種排程演算法. 2

5.3.1First-come, First Served (FCFS) 先到先服務.... 2

5.3.2Shortest-Job-First (SJF) 最短小者優先.... 3

5.3.3Priority Scheduling 優先等級排程.... 5

5.3.4Round-Robin排程 (RR). 5

5.3.5 多重等級佇列(MultilevelQueue)排程.... 6

5.3.6 多重等級回授(MultilevelFeedback)佇列.... 7

5.4 多處理器(Multiple-Processor)排程. 7

5.5 process Scheduling Models
8

5.5.1An example : Solaris 2. 8

5.5.2An example : Windows XP. 9

5.5.3An example : Linux. 9

Exercise. 10




Chapter 6 ProcessSynchronization. 1

6.1 Background. 1

6.2 Critical-SectionProblem. 3

6.2.1 Two-process solutions. 3

6.2.2 Algorithm forMultiple-Process (Bakery algorithm). 5

6.3 SynchronizationHardware. 6

6.4 semaphores. 7

6.4.1 Usage 用法... 7

6.4.2 Implementation. 7

6.4.3 Deadlock andStarvation. 7

6.4.4 Binary Semaphores. 7

6.5
Classical Problems of Synchronization. 7

6.5.1 Bounded-BufferProblem：... 7

6.5.2 Readers and WritersProblem：... 7

6.5.3 Dining-PhilosophersProblem. 7

6.6 Critical Regions. 7

6.7 monitor. 7

6.9 Atomic transaction. 7

6.9.1 System model. 7

6.9.2 Log-based recovery. 7

6.9.3 Checkpoints. 7

6.9.4 Concurrent atomictransactions. 7

6.10 Deadlocks. 7

6.10.1 system model. 7

6.10.2死結特性... 7

6.10.3 死結的處理方法... 7

6.10.4 死結的預防deadlock prevention. 7

6.10.5 死結的避免... 7

6.10.6 死結的偵測deadloack detection. 7

6.10.7 死結的恢復Recovery from deadlock. 7

exercise
7


. 10


Chapter 9 memory management.. 1

9.1 Background. 1

9.1.1 位址連結（Address Binding）.... 1

9.1.2 Logical- VersusPhysical-address Space. 2

9.1.3 動態載入（Dynamic Loading）.... 2

9.1.4 動態鏈結（Dynamic Linking andshared Libraries）.... 2

9.1.5 重疊（Overlays）.... 3

9.2 置換（Swapping）.... 3

9.3 連續配置（Continuous MemoryAllocation）.... 4

9.3.1 Memory Protection. 4

9.3.2 Memory Allocation. 4

9.3.3 Fragmentation. 5

9.4 Paging. 5

9.4.1 Basic method. 5

9.4.2 Hardware Support. 7

9.4.3 Protection. 9

9.4.4 Page table之結構.... 9

9.4.4.1 Hierarchical Paging. 9

9.4.4.2 Hashed Page Tables. 10

9.4.4.3 Inverted PageTables. 11

9.4.5 Shared Pages. 12

9.5 Segmentation. 12

9.5.1 Basic Method. 12

9.5.2 Hardware. 13

9.5.3 Protection andsharing. 14

9.5.4 Fragmentation. 14

9.6 Segmentation withPaging. 15

Exercise

Chapter 10 Virtual Memory. 1

10-1 Background. 1

10-2 Demand Paging. 2

10-2.1Basic Concepts. 2

10-2.2 performance ofdemand paging. 4

10-3 Process Creation. 4

10-3.1 Copy-on-write. 4

10-3.2 Memory-mapped files. 5

10-4 Page-ReplacementAlgorithms. 5

10-4.1 basic scheme. 6

10-4.2 FIFO演算法：... 7

10-4.3 Optimal Algorithm. 9

10-4.4 LRU 演算法 (Least Recently Used). 9

10-4.5 LRU approximationAlgorithms. 10

10-4.6 Counting-based Pagereplacement. 12

10-4.7 Page BufferingAlgorithm. 12

10-5 Allocation of Frames. 12

10-5.1 Minimum Number ofFrames. 12

10-5.2 AllocationAlgorithms. 12

10-5.3 Global V.S. LocalAllocation. 13

10-6 Thrashing. 13

10-6.1 引起Thrashing之原因... 13

10-6.2 Working-set Model. 14

10-6.3 Page-Fault Frequency. 15

10-8 Other Considerations. 15

10-8.1 Prepaging. 15

10-8.2 Page size. 15

10-8.3 TLB Reach. 15

10-8.4 Inverted Page Table. 15

10-8.5 Program Structure. 16

10-8.6 I/O Interlock. 16

10-8.7 Real-Time Processing. 17

Exercises. 17



.. 16

djo6j86j86

不好意思，我放錯圖片，是這張才對

qptom

thanks!

359705716

thanks

physicssdu_1

1# djo6j86j86 [/basdfasdfasdfasdf

athpo

thanks very much

lixqing

学习学习, 谢谢啦!

sjxu007

thanks

tt0917

谢谢了，很好的资料

iseesky

good!thanks!