The ninth edition of Operating System Concepts continues to evolve to provide a solid theoretical foundation for understanding operating systems. This edition has been updated with more extensive coverage of the most current topics and applications, improved conceptual coverage and additional content to bridge the gap between concepts and actual implementations. A new design allows for easier navigation and enhances reader motivation. Additional end-of-chapter, exercises, review questions and programming exercises help to further reinforce important concepts. WileyPLUS, including a test bank, self-check exercises and a student solutions manual, is also part of the comprehensive support package.

Part One Overview

Chapter 1 Introduction
1.1 What Operating Systems Do
1.2 Computer-System Organization
1.3 Computer-System Architecture
1.4 Operating-System Structure
1.5 Operating-System Operations
1.6 Process Management
1.7 Memory Management
1.8 Storage Management
1.9 Protection and Security
1.10 Kernel Data Structures
1.11 Computing Environments
1.12 Open-Source Operating Systems
1.13 Summary

Chapter 2 System Structures
2.1 Operating-System Services
2.2 User and Operating-System Interface
2.3 System Calls
2.4 Types of System Calls
2.5 System Programs
2.6 Operating-System Design and Implementation
2.7 Operating-System Structure
2.8 Operating-System Debugging
2.9 Operating-System Generation
2.10 System Boot
2.11 Summary

Part Two Process Management

Chapter 3 Process Concept
3.1 Process Concept
3.2 Process Scheduling
3.3 Operations on Processes
3.4 Interprocess Communication
3.5 Examples of IPC Systems
3.6 Communication in Client--Server Systems
3.7 Summary

Chapter 4 Multithreaded Programming
4.1 Overview
4.2 Multicore Programming
4.3 Multithreading Models
4.4 Thread Libraries
4.5 Implicit Threading
4.6 Threading Issues
4.7 Operating-System Examples
4.8 Summary

Chapter 5 Process Scheduling
5.1 Basic Concepts
5.2 Scheduling Criteria
5.3 Scheduling Algorithms
5.4 Thread Scheduling
5.5 Multiple-Processor Scheduling
5.6 Real-Time CPU Scheduling
5.7 Operating-System Examples
5.8 Algorithm Evaluation
5.9 Summary

Chapter 6 Synchronization
6.1 Background
6.2 The Critical-Section Problem
6.3 Peterson's Solution
6.4 Synchronization Hardware
6.5 Mutex Locks
6.6 Semaphores
6.7 Classic Problems of Synchronization
6.8 Monitors
6.9 Synchronization Examples
6.10 Alternative Approaches
6.11 Summary

Chapter 7 Deadlocks
7.1 System Model
7.2 Deadlock Characterization
7.3 Methods for Handling Deadlocks
7.4 Deadlock Prevention
7.5 Deadlock Avoidance
7.6 Deadlock Detection
7.7 Recovery from Deadlock
7.8 Summary

Part Three Memory Management

Chapter 8 Memory-Management Strategies
8.1 Background
8.2 Swapping
8.3 Contiguous Memory Allocation
8.4 Segmentation
8.5 Paging
8.6 Structure of the Page Table
8.7 Example: Intel 32 and 64-bit Architectures
8.8 Example: ARM Architecture
8.9 Summary

Chapter 9 Virtual-Memory Management
9.1 Background
9.2 Demand Paging
9.3 Copy-on-Write
9.4 Page Replacement
9.5 Allocation of Frames
9.6 Thrashing
9.7 Memory-Mapped Files
9.8 Allocating Kernel Memory
9.9 Other Considerations
9.10 Operating-System Examples
9.11 Summary

Part Four Storage Management

Chapter 10 File System
10.1 File Concept
10.2 Access Methods
10.3 Directory and Disk Structure
10.4 File-System Mounting
10.5 File Sharing
10.6 Protection
10.7 Summary

Chapter 11 Implementing File-Systems
11.1 File-System Structure
11.2 File-System Implementation
11.3 Directory Implementation
11.4 Allocation Methods
11.5 Free-Space Management
11.6 Efficiency and Performance
11.7 Recovery
11.8 NFS 523
11.9 Example: The WAFL File System
11.10 Summary

Chapter 12 Mass-Storage Structure
12.1 Overview of Mass-Storage Structure
12.2 Disk Structure
12.3 Disk Attachment
12.4 Disk Scheduling
12.5 Disk Management
12.6 Swap-Space