Silberschatz's Operating System Concepts, Global Edition

Part One Overview Chapter 1 Introduction 1.1 What Operating Systems Do 4 1.2 Computer-System Organization 7 1.3 Computer-System Architecture 15 1.4 Operating-System Operations 21 1.5 Resource Management 27 1.6 Security and Protection 33 1.7 Virtualization 34 1.8 Distributed Systems 35 1.9 Kernel Data Structures 36 1.10 Computing Environments 40 1.11 Free and Open-Source Operating Systems 46 1.12 Summary 51 Exercises 53 Further Reading 57 Chapter 2 Operating-System Structures 2.1 Operating-System Services 59 2.2 User and Operating-System Interface 62 2.3 System Calls 66 2.4 System Services 78 2.5 Linkers and Loaders 79 2.6 Why Applications Are Operating-System Specific 81 2.7 Operating-System Design and Implementation 83 2.8 Operating-System Structure 85 2.9 Building and Booting an Operating System 95 2.10 Operating-System Debugging 99 2.11 Summary 104 Exercises 105 Further Reading 107 Part Two Process Management Chapter 3 Processes 3.1 Process Concept 112 3.2 Process Scheduling 116 3.3 Operations on Processes 122 3.4 Interprocess Communication 129 3.5 IPC in Shared-Memory Systems 131 3.6 IPC in Message-Passing Systems 133 3.7 Examples of IPC Systems 138 3.8 Communication in ClientServer Systems 151 3.9 Summary 159 Exercises 161 Further Reading 166 Chapter 4 Threads & Concurrency 4.1 Overview 168 4.2 Multicore Programming 170 4.3 Multithreading Models 174 4.4 Thread Libraries 176 4.5 Implicit Threading 184 4.6 Threading Issues 196 4.7 Operating-System Examples 202 4.8 Summary 204 Exercises 205 Further Reading 208 Chapter 5 CPU Scheduling 5.1 Basic Concepts 212 5.2 Scheduling Criteria 216 5.3 Scheduling Algorithms 217 5.4 Thread Scheduling 229 5.5 Multi-Processor Scheduling 232 5.6 Real-Time CPU Scheduling 239 5.7 Operating-System Examples 246 5.8 Algorithm Evaluation 256 5.9 Summary 262 Exercises 263 Further Reading 270 Part Three Process Synchronization Chapter 6 Synchronization Tools 6.1 Background 273 6.2 The Critical-Section Problem 276 6.3 Petersons Solution 278 6.4 Hardware Support for Synchronization 281 6.5 Mutex Locks 286 6.6 Semaphores 288 6.7 Monitors 292 6.8 Liveness 299 6.9 Evaluation 300 6.10 Summary 302 Exercises 303 Further Reading 309 Chapter 7 Synchronization Examples 7.1 Classic Problems of Synchronization 311 7.2 Synchronization within the Kernel 317 7.3 POSIX Synchronization 321 7.4 Synchronization in Java 325 7.5 Alternative Approaches 333 7.6 Summary 336 Exercises 336 Further Reading 338 Chapter 8 Deadlocks 8.1 System Model 342 8.2 Deadlock in Multithreaded Applications 343 8.3 Deadlock Characterization 345 8.4 Methods for Handling Deadlocks 350 8.5 Deadlock Prevention 351 8.6 Deadlock Avoidance 354 8.7 Deadlock Detection 361 8.8 Recovery from Deadlock 365 8.9 Summary 367 Exercises 368 Further Reading 374 Part Four Memory Management Chapter 9 Main Memory 9.1 Background 379 9.2 Contiguous Memory Allocation 386 9.3 Paging 390 9.4 Structure of the Page Table 401 9.5 Swapping 406 9.6 Example: Intel 32- and 64-bit Architectures 409 9.7 Example: ARMv8 Architecture 413 9.8 Summary 414 Exercises 415 Further Reading 420 Chapter 10 Virtual Memory 10.1 Background 421 10.2 Demand Paging 424 10.3 Copy-on-Write 431 10.4 Page Replacement 433 10.5 Allocation of Frames 445 10.6 Thrashing 451 10.7 Memory Compression 457 10.8 Allocating Kernel Memory 458 10.9 Other Considerations 462 10.10 Operating-System Examples 468 10.11 Summary 472 Exercises 473 Further Reading 482 Part Five Storage Management Chapter 11 Mass-Storage Structure 11.1 Overview of Mass-Storage Structure 485 11.2 HDD Scheduling 493 11.3 NVM Scheduling 497 11.4 Error Detection and Correction 498 11.5 Storage Device Management 499 11.6 Swap-Space Management 503 11.7 Storage Attachment