book

Operating System Concepts, Seventh Edition

by Peter Baer Galvin, Abraham Silberschatz, Greg Gagne

December 2004

Intermediate to advanced

921 pages

30h 34m

English

Wiley

Read now

Unlock full access

Organization of This BookContent of This BookOperating-System EnvironmentsThe Seventh EditionProgramming Exercises and ProjectsTeaching Supplements and Web PageMailing ListSuggestionsAcknowledgments
1.1. What Operating Systems Do1.1.1. User View1.1.2. System View1.1.3. Defining Operating Systems1.2. Computer-System Organization1.2.1. Computer-System Operation1.2.2. Storage Structure1.2.3. I/O Structure1.3. Computer-System Architecture1.3.1. Single-Processor Systems1.3.2. Multiprocessor Systems1.3.3. Clustered Systems1.4. Operating-System Structure1.5. Operating-System Operations1.5.1. Dual-Mode Operation1.5.2. Timer1.6. Process Management1.7. Memory Management1.8. Storage Management1.8.1. File-System Management1.8.2. Mass-Storage Management1.8.3. Caching1.8.4. I/O Systems1.9. Protection and Security1.10. Distributed Systems1.11. Special-Purpose Systems1.11.1. Real-Time Embedded Systems1.11.2. Multimedia Systems1.11.3. Handheld Systems1.12. Computing Environments1.12.1. Traditional Computing1.12.2. Client–Server Computing1.12.3. Peer-to-Peer Computing1.12.4. Web-Based Computing1.13. Summary1.14. Exercises1.15. Bibliographical Notes
2.1. Operating-System Services2.2. User Operating-System Interface2.2.1. Command Interpreter2.2.2. Graphical User Interfaces2.3. System Calls2.4. Types of System Calls2.4.1. Process Control2.4.2. File Management2.4.3. Device Management2.4.4. Information Maintenance2.4.5. Communication2.5. System Programs2.6. Operating-System Design and Implementation2.6.1. Design Goals2.6.2. Mechanisms and Policies2.6.3. Implementation2.7. Operating-System Structure2.7.1. Simple Structure2.7.2. Layered Approach2.7.3. Microkernels2.7.4. Modules2.8. Virtual Machines2.8.1. Implementation2.8.2. Benefits2.8.3. Examples2.8.3.1. VMware2.8.3.2. The Java Virtual Machine2.9. Operating-System Generation2.10. System Boot2.11. Summary2.12. Exercises2.13. Project—Adding a System Call to the Linux Kernel2.13.1.2.13.1.1. Getting Started2.13.1.2. Building a New Kernel2.13.1.3. Extending Kernel Source2.13.1.4. Adding a System Call to the Kernel2.13.1.5. Using the System Call From a User Program2.14. Bibliographical Notes
3.1. Process Concept3.1.1. The Process3.1.2. Process State3.1.3. Process Control Block3.1.4. Threads3.2. Process Scheduling3.2.1. Scheduling Queues3.2.2. Schedulers3.2.3. Context Switch3.3. Operations on Processes3.3.1. Process Creation3.3.2. Process Termination3.4. Interprocess Communication3.4.1. Shared-Memory Systems3.4.2. Message-Passing Systems3.4.2.1. Naming3.4.2.2. Synchronization3.4.2.3. Buffering3.5. Examples of IPC Systems3.5.1. An Example: POSIX Shared Memory3.5.2. An Example: Mach3.5.3. An Example: Windows XP3.6. Communication in Client-Server Systems3.6.1. Sockets3.6.2. Remote Procedure Calls3.6.3. Remote Method Invocation3.7. Summary3.8. Exercises3.9. Project—UNIX Shell and History Feature3.9.1.3.9.1.1. Simple Shell3.9.1.2. Creating a Child Process3.9.1.3. Creating a History Feature3.10. Bibliographical Notes
4.1. Overview4.1.1. Motivation4.1.2. Benefits4.2. Multithreading Models4.2.1. Many-to-One Model4.2.2. One-to-One Model4.2.3. Many-to-Many Model4.3. Thread Libraries4.3.1. Pthreads4.3.2. Win32 Threads4.3.3. Java Threads4.4. Threading Issues4.4.1. The fork() and exec() System Calls4.4.2. Cancellation4.4.3. Signal Handling4.4.4. Thread Pools4.4.5. Thread-Specific Data4.4.6. Scheduler Activations4.5. Operating-System Examples4.5.1. Windows XP Threads4.5.2. Linux Threads4.6. Summary4.7. Exercises4.8. Project—Matrix Multiplication4.8.1.4.8.1.1. Passing Parameters to Each Thread4.8.1.2. Waiting for Threads to Complete4.9. Bibliographical Notes
5.1. Basic Concepts5.1.1. CPU-I/O Burst Cycle5.1.2. CPU Scheduler5.1.3. Preemptive Scheduling5.1.4. Dispatcher5.2. Scheduling Criteria5.3. Scheduling Algorithms5.3.1. First-Come, First-Served Scheduling5.3.2. Shortest-Job-First Scheduling5.3.3. Priority Scheduling5.3.4. Round-Robin Scheduling5.3.5. Multilevel Queue Scheduling5.3.6. Multilevel Feedback-Queue Scheduling5.4. Multiple-Processor Scheduling5.4.1. Approaches to Multiple-Processor Scheduling5.4.2. Processor Affinity5.4.3. Load Balancing5.4.4. Symmetric Multithreading5.5. Thread Scheduling5.5.1. Contention Scope5.5.2. Pthread Scheduling5.6. Operating System Examples5.6.1. Example: Solaris Scheduling5.6.2. Example: Windows XP Scheduling5.6.3. Example: Linux Scheduling5.7. Algorithm Evaluation5.7.1. Deterministic Modeling5.7.2. Queueing Models5.7.3. Simulations5.7.4. Implementation5.8. Summary5.9. Exercises5.10. Bibliographical Notes
6.1. Background6.2. The Critical-Section Problem6.3. Peterson's Solution6.4. Synchronization Hardware6.5. Semaphores6.5.1. Usage6.5.2. Implementation6.5.3. Deadlocks and Starvation6.6. Classic Problems of Synchronization6.6.1. The Bounded-Buffer Problem6.6.2. The Readers-Writers Problem6.6.3. The Dining-Philosophers Problem6.7. Monitors6.7.1. Usage6.7.2. Dining-Philosophers Solution Using Monitors6.7.3. Implementing a Monitor Using Semaphores6.7.4. Resuming Processes Within a Monitor6.8. Synchronization Examples6.8.1. Synchronization in Solaris6.8.2. Synchronization in Windows XP6.8.3. Synchronization in Linux6.8.4. Synchronization in Pthreads6.9. Atomic Transactions6.9.1. System Model6.9.2. Log-Based Recovery6.9.3. Checkpoints6.9.4. Concurrent Atomic Transactions6.9.4.1. Serializability6.9.4.2. Locking Protocol6.9.4.3. Timestamp-Based Protocols6.10. Summary6.11. Exercises6.12. Project: Producer-Consumer Problem6.12.1.6.12.1.1. The Buffer6.12.1.2. Producer and Consumer Threads6.12.1.3. Pthreads Thread Creation6.12.1.4. Pthreads Mutex Locks6.12.1.5. Pthreads Semaphores6.12.1.6. Win326.12.1.7. Win32 Mutex Locks6.12.1.8. Win32 Semaphores6.13. Bibliographical Notes

7.1. System Model7.2. Deadlock Characterization7.2.1. Necessary Conditions7.2.2. Resource-Allocation Graph7.3. Methods for Handling Deadlocks7.4. Deadlock Prevention7.4.1. Mutual Exclusion7.4.2. Hold and Wait7.4.3. No Preemption7.4.4. Circular Wait7.5. Deadlock Avoidance7.5.1. Safe State7.5.2. Resource-Allocation-Graph Algorithm7.5.3. Banker's Algorithm7.5.3.1. Safety Algorithm7.5.3.2. Resource-Request Algorithm7.5.3.3. An Illustrative Example7.6. Deadlock Detection7.6.1. Single Instance of Each Resource Type7.6.2. Several Instances of a Resource Type7.6.3. Detection-Algorithm Usage7.7. Recovery From Deadlock7.7.1. Process Termination7.7.2. Resource Preemption7.8. Summary7.9. Exercises7.10. Bibliographical Notes
8.1. Background8.1.1. Basic Hardware8.1.2. Address Binding8.1.3. Logical Versus Physical Address Space8.1.4. Dynamic Loading8.1.5. Dynamic Linking and Shared Libraries8.2. Swapping8.3. Contiguous Memory Allocation8.3.1. Memory Mapping and Protection8.3.2. Memory Allocation8.3.3. Fragmentation8.4. Paging8.4.1. Basic Method8.4.2. Hardware Support8.4.3. Protection8.4.4. Shared Pages8.5. Structure of the Page Table8.5.1. Hierarchical Paging8.5.2. Hashed Page Tables8.5.3. Inverted Page Tables8.6. Segmentation8.6.1. Basic Method8.6.2. Hardware8.7. Example: The Intel Pentium8.7.1. Pentium Segmentation8.7.2. Pentium Paging8.7.3. Linux on Pentium Systems8.8. Summary8.9. Exercises8.10. Bibliographical Notes
9.1. Background9.2. Demand Paging9.2.1. Basic Concepts9.2.2. Performance of Demand Paging9.3. Copy-on-Write9.4. Page Replacement9.4.1. Basic Page Replacement9.4.2. FIFO Page Replacement9.4.3. Optimal Page Replacement9.4.4. LRU Page Replacement9.4.5. LRU-Approximation Page Replacement9.4.5.1. Additional-Reference-Bits Algorithm9.4.5.2. Second-Chance Algorithm9.4.5.3. Enhanced Second-Chance Algorithm9.4.6. Counting-Based Page Replacement9.4.7. Page-Buffering Algorithms9.4.8. Applications and Page Replacement9.5. Allocation of Frames9.5.1. Minimum Number of Frames9.5.2. Allocation Algorithms9.5.3. Global versus Local Allocation9.6. Thrashing9.6.1. Cause of Thrashing9.6.2. Working-Set Model9.6.3. Page-Fault Frequency9.7. Memory-Mapped Files9.7.1. Basic Mechanism9.7.2. Shared Memory in the Win32 API9.7.3. Memory-Mapped I/O9.8. Allocating Kernel Memory9.8.1. Buddy System9.8.2. Slab Allocation9.9. Other Considerations9.9.1. Prepaging9.9.2. Page Size9.9.3. TLB Reach9.9.4. Inverted Page Tables9.9.5. Program Structure9.9.6. I/O Interlock9.10. Operating-System Examples9.10.1. Windows XP9.10.2. Solaris9.11. Summary9.12. Exercises9.13. Bibliographical Notes
10.1. File Concept10.1.1. File Attributes10.1.2. File Operations10.1.3. File Types10.1.4. File Structure10.1.5. Internal File Structure10.2. Access Methods10.2.1. Sequential Access10.2.2. Direct Access10.2.3. Other Access Methods10.3. Directory Structure10.3.1. Storage Structure10.3.2. Directory Overview10.3.3. Single-Level Directory10.3.4. Two-Level Directory10.3.5. Tree-Structured Directories10.3.6. Acyclic-Graph Directories10.3.7. General Graph Directory10.4. File-System Mounting10.5. File Sharing10.5.1. Multiple Users10.5.2. Remote File Systems10.5.2.1. The Client–Server Model10.5.2.2. Distributed Information Systems10.5.2.3. Failure Modes10.5.3. Consistency Semantics10.5.3.1. UNIX Semantics10.5.3.2. Session Semantics10.5.3.3. Immutable-Shared-Files Semantics10.6. Protection10.6.1. Types of Access10.6.2. Access Control10.6.3. Other Protection Approaches10.7. Summary10.8. Exercises10.9. Bibliographical Notes
11.1. File-System Structure11.2. File-System Implementation11.2.1. Overview11.2.2. Partitions and Mounting11.2.3. Virtual File Systems11.3. Directory Implementation11.3.1. Linear List11.3.2. Hash Table11.4. Allocation Methods11.4.1. Contiguous Allocation11.4.2. Linked Allocation11.4.3. Indexed Allocation11.4.4. Performance11.5. Free-Space Management11.5.1. Bit Vector11.5.2. Linked List11.5.3. Grouping11.5.4. Counting11.6. Efficiency and Performance11.6.1. Efficiency11.6.2. Performance11.7. Recovery11.7.1. Consistency Checking11.7.2. Backup and Restore11.8. Log-Structured File Systems11.9. NFS11.9.1. Overview11.9.2. The Mount Protocol11.9.3. The NFS Protocol11.9.4. Path-Name Translation11.9.5. Remote Operations11.10. Example: The WAFL File System11.11. Summary11.12. Exercises11.13. Bibliographical Notes
12.1. Overview of Mass-Storage Structure12.1.1. Magnetic Disks12.1.2. Magnetic Tapes12.2. Disk Structure12.3. Disk Attachment12.3.1. Host-Attached Storage12.3.2. Network-Attached Storage12.3.3. Storage-Area Network12.4. Disk Scheduling12.4.1. FCFS Scheduling12.4.2. SSTF Scheduling12.4.3. SCAN Scheduling12.4.4. C-SCAN Scheduling12.4.5. LOOK Scheduling12.4.6. Selection of a Disk-Scheduling Algorithm12.5. Disk Management12.5.1. Disk Formatting12.5.2. Boot Block12.5.3. Bad Blocks12.6. Swap-Space Management12.6.1. Swap-Space Use12.6.2. Swap-Space Location12.6.3. Swap-Space Management: An Example12.7. RAID Structure12.7.1. Improvement of Reliability via Redundancy12.7.2. Improvement in Performance via Parallelism12.7.3. RAID Levels12.7.4. Selecting a RAID Level12.7.5. Extensions12.7.6. Problems with RAID12.8. Stable-Storage Implementation12.9. Tertiary-Storage Structure12.9.1. Tertiary-Storage Devices12.9.1.1. Removable Disks12.9.1.2. Tapes12.9.1.3. Future Technology12.9.2. Operating-System Support12.9.2.1. Application Interface12.9.2.2. File Naming12.9.2.3. Hierarchical Storage Management12.9.3. Performance Issues12.9.3.1. Speed12.9.3.2. Reliability12.9.3.3. Cost12.10. Summary12.11. Exercises12.12. Bibliographical Notes
13.1. Overview13.2. I/O Hardware13.2.1. Polling13.2.2. Interrupts13.2.3. Direct Memory Access13.2.4. I/O Hardware Summary13.3. Application I/O Interface13.3.1. Block and Character Devices13.3.2. Network Devices13.3.3. Clocks and Timers13.3.4. Blocking and Nonblocking IO13.4. Kernel I/O Subsystem13.4.1. I/O Scheduling13.4.2. Buffering13.4.3. Caching13.4.4. Spooling and Device Reservation13.4.5. Error Handling13.4.6. I/O Protection13.4.7. Kernel Data Structures13.4.8. Kernel I/O Subsystem Summary13.5. Transforming I/O Requests to Hardware Operations13.6. STREAMS13.7. Performance13.8. Summary13.9. Exercises13.10. Bibliographical Notes
14.1. Goals of Protection14.2. Principles of Protection14.3. Domain of Protection14.3.1. Domain Structure14.3.2. An Example: UNIX14.3.3. An Example: MULTICS14.4. Access Matrix14.5. Implementation of Access Matrix14.5.1. Global Table14.5.2. Access Lists for Objects14.5.3. Capability Lists for Domains14.5.4. A Lock–Key Mechanism14.5.5. Comparison14.6. Access Control14.7. Revocation of Access Rights14.8. Capability-Based Systems14.8.1. An Example: Hydra14.8.2. An Example: Cambridge CAP System14.9. Language-Based Protection14.9.1. Compiler-Based Enforcement14.9.2. Protection in Java14.10. Summary14.11. Exercises14.12. Bibliographical Notes
15.1. The Security Problem15.2. Program Threats15.2.1. Trojan Horse15.2.2. Trap Door15.2.3. Logic Bomb15.2.4. Stack and Buffer Overflow15.2.5. Viruses15.3. System and Network Threats15.3.1. Worms15.3.2. Port Scanning15.3.3. Denial of Service15.4. Cryptography as a Security Tool15.4.1. Encryption15.4.1.1. Symmetric Encryption15.4.1.2. Asymmetric Encryption15.4.1.3. Authentication15.4.1.4. Key Distribution15.4.2. Implementation of Cryptography15.4.3. An Example: SSL15.5. User Authentication15.5.1. Passwords15.5.2. Password Vulnerabilities15.5.3. Encrypted Passwords15.5.4. One-Time Passwords15.5.5. Biometrics15.6. Implementing Security Defenses15.6.1. Security Policy15.6.2. Vulnerability Assessment15.6.3. Intrusion Detection15.6.4. Virus Protection15.6.5. Auditing, Accounting, and Logging15.7. Firewalling to Protect Systems and Networks15.8. Computer-Security Classifications15.9. An Example: Windows XP15.10. Summary15.11. Exercises15.12. Bibliographical Notes
16.1. Motivation16.1.1. Resource Sharing16.1.2. Computation Speedup16.1.3. Reliability16.1.4. Communication16.2. Types of Distributed Operating Systems16.2.1. Network Operating Systems16.2.1.1. Remote Login16.2.1.2. Remote File Transfer16.2.2. Distributed Operating Systems16.2.2.1. Data Migration16.2.2.2. Computation Migration16.2.2.3. Process Migration16.3. Network Structure16.3.1. Local-Area Networks16.3.2. Wide-Area Networks16.4. Network Topology16.5. Communication Structure16.5.1. Naming and Name Resolution16.5.2. Routing Strategies16.5.3. Packet Strategies16.5.4. Connection Strategies16.5.5. Contention16.6. Communication Protocols16.7. Robustness16.7.1. Failure Detection16.7.2. Reconfiguration16.7.3. Recovery from Failure16.8. Design Issues16.9. An Example: Networking16.10. Summary16.11. Exercises16.12. Bibliographical Notes
17.1. Background17.2. Naming and Transparency17.2.1. Naming Structures17.2.2. Naming Schemes17.2.3. Implementation Techniques17.3. Remote File Access17.3.1. Basic Caching Scheme17.3.2. Cache Location17.3.3. Cache-Update Policy17.3.4. Consistency17.3.5. A Comparison of Caching and Remote Service17.4. Stateful Versus Stateless Service17.5. File Replication17.6. An Example: AFS17.6.1. Overview17.6.2. The Shared Name Space17.6.3. File Operations and Consistency Semantics17.6.4. Implementation17.7. Summary17.8. Exercises17.9. Bibliographical Notes
18.1. Event Ordering18.1.1. The Happened-Before Relation18.1.2. Implementation18.2. Mutual Exclusion18.2.1. Centralized Approach18.2.2. Fully Distributed Approach18.2.3. Token-Passing Approach18.3. Atomicity18.3.1. The Two-Phase Commit Protocol18.3.2. Failure Handling in 2PC18.3.2.1. Failure of a Participating Site18.3.2.2. Failure of the Coordinator18.3.2.3. Failure of the Network18.4. Concurrency Control18.4.1. Locking Protocols18.4.1.1. Nonreplicated Scheme18.4.1.2. Single-Coordinator Approach18.4.1.3. Majority Protocol18.4.1.4. Biased Protocol18.4.1.5. Primary Copy18.4.2. Timestamping18.4.2.1. Generation of Unique Timestamps18.4.2.2. Timestamp-Ordering Scheme18.5. Deadlock Handling18.5.1. Deadlock Prevention and Avoidance18.5.2. Deadlock Detection18.5.2.1. Centralized Approach18.5.2.2. Fully Distributed Approach18.6. Election Algorithms18.6.1. The Bully Algorithm18.6.2. The Ring Algorithm18.7. Reaching Agreement18.7.1. Unreliable Communications18.7.2. Faulty Processes18.8. Summary18.9. Exercises18.10. Bibliographical Notes
19.1. Overview19.2. System Characteristics19.3. Features of Real-Time Kernels19.4. Implementing Real-Time Operating Systems19.4.1. Priority-Based Scheduling19.4.2. Preemptive Kernels19.4.3. Minimizing Latency19.5. Real-Time CPU Scheduling19.5.1. Rate-Monotonic Scheduling19.5.2. Earliest-Deadline-First Scheduling19.5.3. Proportional Share Scheduling19.5.4. Pthread Scheduling19.6. VxWorks 5.x19.7. Summary19.8. Exercises19.9. Bibliographical Notes
20.1. What Is Multimedia?20.1.1. Media Delivery20.1.2. Characteristics of Multimedia Systems20.1.3. Operating-System Issues20.2. Compression20.3. Requirements of Multimedia Kernels20.4. CPU Scheduling20.5. Disk Scheduling20.5.1. Earliest-Deadline-First Scheduling20.5.2. SCAN-EDF Scheduling20.6. Network Management20.6.1. Unicasting and Multicasting20.6.2. Real-Time Streaming Protocol20.7. An Example: CineBlitz20.7.1. Disk Scheduling20.7.2. Admission Control20.8. Summary20.9. Exercises20.10. Bibliographical Notes
21.1. Linux History21.1.1. The Linux Kernel21.1.2. The Linux System21.1.3. Linux Distributions21.1.4. Linux Licensing21.2. Design Principles21.2.1. Components of a Linux System21.3. Kernel Modules21.3.1. Module Management21.3.2. Driver Registration21.3.3. Conflict Resolution21.4. Process Management21.4.1. The fork() and exec() Process Model21.4.1.1. Process Identity21.4.1.2. Process Environment21.4.1.3. Process Context21.4.2. Processes and Threads21.5. Scheduling21.5.1. Process Scheduling21.5.2. Kernel Synchronization21.5.3. Symmetric Multiprocessing21.6. Memory Management21.6.1. Management of Physical Memory21.6.2. Virtual Memory21.6.2.1. Virtual Memory Regions21.6.2.2. Lifetime of a Virtual Address Space21.6.2.3. Swapping and Paging21.6.2.4. Kernel Virtual Memory21.6.3. Execution and Loading of User Programs21.6.3.1. Mapping of Programs into Memory21.6.3.2. Static and Dynamic Linking21.7. File Systems21.7.1. The Virtual File System21.7.2. The Linux ext2fs File System21.7.3. Journaling21.7.4. The Linux proc File System21.8. Input and Output21.8.1. Block Devices21.8.2. Character Devices21.9. Interprocess Communication21.9.1. Synchronization and Signals21.9.2. Passing of Data Among Processes21.10. Network Structure21.11. Security21.11.1. Authentication21.11.2. Access Control21.12. Summary21.13. Exercises21.14. Bibliographical Notes
22.1. History22.2. Design Principles22.2.1. Security22.2.2. Reliability22.2.3. Windows and POSIX Application Compatibility22.2.4. High Performance22.2.5. Extensibility22.2.6. Portability22.2.7. International Support22.3. System Components22.3.1. Hardware-Abstraction Layer22.3.2. Kernel22.3.2.1. Kernel Dispatcher22.3.2.2. Threads and Scheduling22.3.2.3. Implementation of Synchronization Primitives22.3.2.4. Software Interrupts: Asynchronous and Deferred Procedure Calls22.3.2.5. Exceptions and Interrupts22.3.3. Executive22.3.3.1. Object Manager22.3.3.2. Virtual Memory Manager22.3.3.3. Process Manager22.3.3.4. Local Procedure Call Facility22.3.3.5. I/O Manager22.3.3.6. Cache Manager22.3.3.7. Security Reference Monitor22.3.3.8. Plug-and-Play and Power Managers22.3.3.9. Registry22.3.3.10. Booting22.4. Environmental Subsystems22.4.1. MS-DOS Environment22.4.2. 16-Bit Windows Environment22.4.3. 32-Bit Windows Environment on IA6422.4.4. Win32 Environment22.4.5. POSIX Subsystem22.4.6. Logon and Security Subsystems22.5. File System22.5.1. NTFS Internal Layout22.5.1.1. NTFS B+ Tree22.5.1.2. NTFS Metadata22.5.2. Recovery22.5.3. Security22.5.4. Volume Management and Fault Tolerance22.5.4.1. Volume Set22.5.4.2. Stripe Set22.5.4.3. Stripe Set with Parity22.5.4.4. Disk Mirroring22.5.4.5. Sector Sparing and Cluster Remapping22.5.5. Compression and Encryption22.5.6. Mount Points22.5.7. Change Journal22.5.8. Volume Shadow Copies22.6. Networking22.6.1. Network Interfaces22.6.2. Protocols22.6.2.1. Server-Message Block22.6.2.2. Network Basic Input/Output System22.6.2.3. NetBIOS Extended User Interface22.6.2.4. Transmission Control Protocol/Internet Protocol22.6.2.5. Point-to-Point Tunneling Protocol22.6.2.6. Novell NetWare Protocols22.6.2.7. Web Distributed Authoring and Versioning Protocol22.6.2.8. AppleTalk Protocol22.6.3. Distributed-Processing Mechanisms22.6.3.1. NetBIOS22.6.3.2. Named Pipes22.6.3.3. Mailslots22.6.3.4. Winsock22.6.3.5. Remote Procedure Calls22.6.3.6. Microsoft Interface Definition Language22.6.3.7. Component Object Model22.6.4. Redirectors and Servers22.6.4.1. Distributed File System22.6.4.2. Folder Redirection and Client-Side Caching22.6.5. Domains22.6.5.1. Domain Trees and Forests22.6.5.2. Trust Relationships22.6.6. Active Directory22.6.7. Name Resolution in TCP/IP Networks22.7. Programmer Interface22.7.1. Access to Kernel Objects22.7.2. Sharing Objects Between Processes22.7.3. Process Management22.7.3.1. Instance Handles22.7.3.2. Scheduling Rule22.7.3.3. Thread Priorities22.7.3.4. Thread Synchronization22.7.3.5. Fibers22.7.3.6. Thread Pool22.7.4. Interprocess Communication22.7.5. Memory Management22.7.5.1. Virtual Memory22.7.5.2. Memory-Mapping Files22.7.5.3. Heaps22.7.5.4. Thread-Local Storage22.8. Summary22.9. Exercises22.10. Bibliographical Notes
23.1. Early Systems23.1.1. Dedicated Computer Systems23.1.2. Shared Computer Systems23.1.3. Overlapped I/O23.2. Atlas23.3. XDS-94023.4. THE23.5. RC 400023.6. CTSS23.7. MULTICS23.8. IBM OS/36023.9. Mach23.10. Other Systems23.11. Exercises

Content preview from Operating System Concepts, Seventh Edition

Part VI. Distributed Systems

A distributed system is a collection of processors that do not share memory or a clock. Instead, each processor has its own local memory, and the processors communicate with one another through communication lines such as local-area or wide-area networks. The processors in a distributed system vary in size and function. Such systems may include small handheld or real-time devices, personal computers, workstations, and large mainframe computer systems.

A distributed file system is a file-service system whose users, servers, and storage devices are dispersed among the sites of a distributed system. Accordingly, service activity has to be carried out across the network; instead of a single centralized data repository, there are multiple independent storage devices.

The benefits of a distributed system include giving users access to the resources maintained by the system and thereby speeding up computation and improving data availability and reliability. Because a system is distributed, however, it must provide mechanisms for process synchronization and communication, for dealing with the deadlock problem, and for handling failures that are not encountered in a centralized system.