Distributed operating systems

Title:	Distributed operating systems
Author:	Tanenbaum Andrew
Оценка:	4.0 of 5, readers votes - 504
Genre:	computers
Annotation:	As distributed computer systems become more pervasive, so does the need for understanding how their operating systems are designed and implemented. Andrew S. Tanenbaum`s Distributed Operating Systems fulfills this need. Representing a revised and greatly expanded Part II of the best-selling Modern Operating Systems, it covers the material from the original book, including communication, synchronization, processes, and file systems, and adds new material on distributed shared memory, real-time distributed systems, fault-tolerant distributed systems, and ATM networks. It also contains four detailed case studies: Amoeba, Mach, Chorus, and OSF\|DCE. Tanenbaum`s trademark writing provides readers with a thorough, concise treatment of distributed systems.
Year:	1994 г.
Table of Contents:	hide Table of Contents 1 Introduction to Distributed Systems 1.1. WHAT IS A DISTRIBUTED SYSTEM? 1.2. GOALS 1.2.1. Advantages of Distributed Systems over Centralized Systems 1.2.2. Advantages of Distributed Systems over Independent PCs 1.2.3. Disadvantages of Distributed Systems 1.3. HARDWARE CONCEPTS 1.3.1. Bus-Based Multiprocessors 1.3.2. Switched Multiprocessors 1.3.3. Bus-Based Multicomputers 1.3.4. Switched Multicomputers 1.4. SOFTWARE CONCEPTS 1.4.1. Network Operating Systems 1.4.2. True Distributed Systems 1.4.3. Multiprocessor Timesharing Systems 1.5. DESIGN ISSUES 1.5.1.Transparency 1.5.2. Flexibility 1.5.3. Reliability 1.5.4. Performance 1.5.5. Scalability 1.6. SUMMARY PROBLEMS 2 Communication in Distributed Systems 2.1. LAYERED PROTOCOLS 2.1.1.The Physical Layer 2.1.2. The Data Link Layer 2.1.3.The Network Layer 2.1.4.The Transport Layer 2.1.5. The Session Layer 2.1.6. The Presentation Layer 2.1.7. The Application Layer 2.2. ASYNCHRONOUS TRANSFER MODE NETWORKS 2.2.1. What Is Asynchronous Transfer Mode? 2.2.2. The ATM Physical Layer 2.2.3. The ATM Layer 2.2.4. The ATM Adaptation Layer 2.2.5. ATM Switching 2.2.6. Some Implications of ATM for Distributed Systems 2.3. THE CLIENT-SERVER MODEL 2.3.1. Clients and Servers 2.3.2. An Example Client and Server 2.3.3. Addressing 2.3.4. Blocking versus Nonblocking Primitives 2.3.5. Buffered versus Unbuffered Primitives 2.3.6. Reliable versus Unreliable Primitives 2.3.7. Implementing the Client-Server Model 2.4. REMOTE PROCEDURE CALL 2.4.1. Basic RPC Operation 2.4.2. Parameter Passing 2.4.3. Dynamic Binding 2.4.4. RPC Semantics in the Presence of Failures Client Cannot Locate the Server Lost Request Messages Lost Reply messages Server Crashes Client Crashes 2.4.5. Implementation Issues RPC Protocols Acknowledgements Critical Path Copying Timer Management 2.4.6. Problem Areas 2.5. GROUP COMMUNICATION 2.5.1. Introduction to Group Communication 2.5.2. Design Issues Closed Groups versus Open Groups Peer Groups versus Hierarchical Groups Group Membership Group Addressing Send and Receive Primitives Atomicity Message Ordering Overlapping Groups Scalability 2.5.3. Group Communication in ISIS Communication Primitives in ISIS 2.6. SUMMARY PROBLEMS 3 Synchronization in Distributed Systems 3.1. CLOCK SYNCHRONIZATION 3.1.1. Logical Clocks 3.1.2. Physical Clocks 3.1.3. Clock Synchronization Algorithms Cristians Algorithm The Berkeley Algorithm Averaging Algorithms Multiple External Time Sources 3.1.4. Use of Synchronized Clocks At-Most-Once Message Delivery Clock-Based Cache Consistency 3.2. MUTUAL EXCLUSION 3.2.1. A Centralized Algorithm 3.2.2. A Distributed Algorithm 3.2.3. A Token Ring Algorithm 3.2.4. A Comparison of the Three Algorithms 3.3. ELECTION ALGORITHMS 3.3.1. The Bully Algorithm 3.3.2. A Ring Algorithm 3.4. ATOMIC TRANSACTIONS 3.4.1. Introduction to Atomic Transactions 3.4.2. The Transaction Model Stable Storage Transaction Primitives Properties of Transactions Nested Transactions 3.4.3. Implementation Private Workspace Writeahead Log Two-Phase Commit Protocol 3.4.4. Concurrency Control Locking Optimistic Concurrency Control Timestamps 3.5. DEADLOCKS IN DISTRIBUTED SYSTEMS 3.5.1. Distributed Deadlock Detection Centralized Deadlock Detection Distributed Deadlock Detection 3.5.2. Distributed Deadlock Prevention 3.6. SUMMARY PROBLEMS 4 Processes and Processors in Distributed Systems 4.1. THREADS 4.1.1. Introduction to Threads 4.1.2. Thread Usage 4.1.3. Design Issues for Threads Packages 4.1.4. Implementing a Threads Package Implementing Threads in User Space Implementing Threads in the Kernel Scheduler Activations 4.1.5. Threads and RPC 4.2. SYSTEM MODELS 4.2.1. The Workstation Model 4.2.2. Using Idle Workstations 4.2.3. The Processor Pool Model 4.2.4. A Hybrid Model 4.3. PROCESSOR ALLOCATION 4.3.1. Allocation Models 4.3.2. Design Issues for Processor Allocation Algorithms 4.3.3. Implementation Issues for Processor Allocation Algorithms 4.3.4. Example Processor Allocation Algorithms A Graph-Theoretic Deterministic Algorithm A Centralized Algorithm A Hierarchical Algorithm A Sender-Initiated Distributed Heuristic Algorithm A Receiver-Initiated Distributed Heuristic Algorithm A Bidding Algorithm 4.4. SCHEDULING IN DISTRIBUTED SYSTEMS 4.5. FAULT TOLERANCE 4.5.1. Component Faults 4.5.2. System Failures 4.5.3. Synchronous versus Asynchronous Systems 4.5.4. Use of Redundancy 4.5.5. Fault Tolerance Using Active Replication 4.5.6. Fault Tolerance Using Primary Backup 4.5.7. Agreement in Faulty Systems 4.6. REAL-TIME DISTRIBUTED SYSTEMS 4.6.1. What Is a Real-Time System? 4.6.2. Design Issues Clock Synchronization Event-Triggered versus Time-Triggered Systems Predictability Fault Tolerance Language Support 4.6.3. Real-Time Communication The Time-Triggered Protocol 4.6.4. Real-Time Scheduling Dynamic Scheduling Static Scheduling A Comparison of Dynamic versus Static Scheduling 4.7. SUMMARY PROBLEMS 5 Distributed File Systems 5.1. DISTRIBUTED FILE SYSTEM DESIGN 5.1.1. The File Service Interface 5.1.2. The Directory Server Interface Naming Transparency Two-Level Naming 5.1.3. Semantics of File Sharing 5.2. DISTRIBUTED FILE SYSTEM IMPLEMENTATION 5.2.1. File Usage 5.2.2. System Structure 5.2.3. Caching Cache Consistency 5.2.4. Replication Update Protocols 5.2.5. An Example: Suns Network File System NFS Architecture NFS Protocols NFS Implementation 5.2.6. Lessons Learned 5.3. TRENDS IN DISTRIBUTED FILE SYSTEMS 5.3.1. New Hardware 5.3.2. Scalability 5.3.3. Wide Area Networking 5.3.4. Mobile Users 5.3.5. Fault Tolerance 5.3.6. Multimedia 5.4. SUMMARY PROBLEMS 6 Distributed Shared Memory 6.1. INTRODUCTION 6.2. WHAT IS SHARED MEMORY? 6.2.1. On-Chip Memory 6.2.2. Bus-Based Multiprocessors 6.2.3. Ring-Based Multiprocessors 6.2.4. Switched Multiprocessors Directories Caching Protocols 6.2.5. NUMA Multiprocessors Examples of NUMA Multiprocessors Properties of NUMA Multiprocessors NUMA Algorithms 6.2.6. Comparison of Shared Memory Systems 6.3. CONSISTENCY MODELS 6.3.1. Strict Consistency 6.3.2. Sequential Consistency 6.3.3. Causal Consistency 6.3.4. PRAM Consistency and Processor Consistency 6.3.5. Weak Consistency 6.3.6. Release Consistency 6.3.7. Entry Consistency 6.3.8. Summary of Consistency Models 6.4. PAGE-BASED DISTRIBUTED SHARED MEMORY 6.4.1. Basic Design 6.4.2. Replication 6.4.3. Granularity 6.4.4. Achieving Sequential Consistency 6.4.5. Finding the Owner 6.4.6. Finding the Copies 6.4.7. Page Replacement 6.4.8. Synchronization 6.5. SHARED-VARIABLE DISTRIBUTED SHARED MEMORY 6.5.1. Munin Release Consistency Multiple Protocols Directories Synchronization 6.5.2. Midway Entry Consistency Implementation 6.6. OBJECT-BASED DISTRIBUTED SHARED MEMORY 6.6.1. Objects 6.6.2. Linda Tuple Space Operations on Tuples Implementation of Linda 6.6.3. Orca The Orca Language Management of Shared Objects in Orca 6.7. COMPARISON 6.8. SUMMARY PROBLEMS 7 Case Study 1: Amoeba 7.1. INTRODUCTION TO AMOEBA 7.1.1. History of Amoeba 7.1.2. Research Goals 7.1.3. The Amoeba System Architecture 7.1.4. The Amoeba Microkernel 7.1.5. The Amoeba Servers 7.2. OBJECTS AND CAPABILITIES IN AMOEBA 7.2.1. Capabilities 7.2.2. Object Protection 7.2.3. Standard Operations 7.3. PROCESS MANAGEMENT IN AMOEBA 7.3.1. Processes 7.3.2. Threads 7.4. MEMORY MANAGEMENT IN AMOEBA 7.4.1. Segments 7.4.2. Mapped Segments 7.5. COMMUNICATION IN AMOEBA 7.5.1. Remote Procedure Call RPC Primitives 7.5.2. Group Communication in Amoeba The Amoeba Reliable Broadcast Protocol Fault-Tolerant Group Communication 7.5.3. The Fast Local Internet Protocol Protocol Requirements for Distributed Systems The FLIP Interface Operation of the FLIP Layer Locating Put-Ports FLIP over Wide-Area Networks 7.6. THE AMOEBA SERVERS 7.6.1. The Bullet Server The Bullet Server Interface Implementation of the Bullet Server 7.6.2. The Directory Server The Directory Server Interface Implementation of the Directory Server 7.6.3.The Replication Server 7.6.4.The Run Server 7.6.5. The Boot Server 7.6.6. The TCP/IP Server 7.6.7. Other Servers 7.7. SUMMARY PROBLEMS 8 Case Study 2: Mach 8.1. INTRODUCTION TO MACH 8.1.1. History of Mach 8.1.2. Goals of Mach 8.1.3. The Mach Microkernel 8.1.4. The Mach BSD UNIX Server 8.2. PROCESS MANAGEMENT IN MACH 8.2.1. Processes Process Management Primitives 8.2.2. Threads Implementation of C Threads in Mach 8.2.3. Scheduling 8.3. MEMORY MANAGEMENT IN MACH 8.3.1. Virtual Memory 8.3.2. Memory Sharing 8.3.3. External Memory Managers 8.3.4. Distributed Shared Memory in Mach 8.4. COMMUNICATION IN MACH 8.4.1. Ports Capabilities Primitives for Managing Ports 8.4.2. Sending and Receiving Messages Message Formats 8.4.3. The Network Message Server 8.5. UNIX EMULATION IN MACH 8.6. SUMMARY PROBLEMS 9 Case Study 3: Chorus 9.1. INTRODUCTION TO CHORUS 9.1.1. History of Chorus 9.1.2. Goals of Chorus 9.1.3. System Structure 9.1.4. Kernel Abstractions 9.1.5. Kernel Structure 9.1.6. The UNIX Subsystem 9.1.7. The Object-Oriented Subsystem 9.2. PROCESS MANAGEMENT IN CHORUS 9.2.1. Processes 9.2.2. Threads 9.2.3. Scheduling 9.2.4. Traps, Exceptions, and Interrupts 9.2.5. Kernel Calls for Process Management 9.3. MEMORY MANAGEMENT IN CHORUS 9.3.1. Regions and Segments 9.3.2. Mappers 9.3.3. Distributed Shared Memory 9.3.4. Kernel Calls for Memory Management 9.4. COMMUNICATON IN CHORUS 9.4.1.Messages 9.4.2.Ports 9.4.3. Communication Operations 9.4.4. Kernel Calls for Communication 9.5. UNIX EMULATION IN CHORUS 9.5.1. Structure of a UNIX Process 9.5.2. Extensions to UNIX 9.5.3. Implementation of UNIX on Chorus The Process Manager The Object Manager The Streams Manager The Interprocess Communication Manager Configurability Real-Time Applications 9.6. COOL: AN OBJECT-ORIENTED SUBSYSTEM 9.6.1. The COOL Architecture 9.6.2.The COOL Base Layer 9.6.3.The COOL Generic Runtime System 9.6.4.The Language Runtime System 9.6.5. Implementation of COOL 9.7. COMPARISON OF AMOEBA, MACH, AND CHORUS 9.7.1. Philosophy 9.7.2. Objects 9.7.3. Processes 9.7.4. Memory Model 9.7.5. Communication 9.7.6. Servers 9.8. SUMMARY PROBLEMS 10 Case Study 4: DCE 10.1. INTRODUCTION TO DCE 10.1.1. History of DCE 10.1.2. Goals of DCE 10.1.3. DCE Components 10.1.4. Cells 10.2. THREADS 10.2.1. Introduction to DCE Threads 10.2.2. Scheduling 10.2.3. Synchronization 10.2.4. Thread Calls 10.3. REMOTE PROCEDURE CALL 10.3.1. Goals of DCE RPC 10.3.2. Writing a Client and a Server 10.3.3. Binding a Client to a Server 10.3.4. Performing an RPC 10.4. TIME SERVICE 10.4.1. DTS Time Model 10.4.2. DTS Implementation 10.5. DIRECTORY SERVICE 10.5.1. Names 10.5.2. The Cell Directory Service 10.5.3. The Global Directory Service 10.6. SECURITY SERVICE 10.6.1. Security Model 10.6.2. Security Components 10.6.3. Tickets and Authenticators 10.6.4. Authenticated RPC 10.6.5. ACLs 10.7. DISTRIBUTED FILE SYSTEM 10.7.1. DFS Interface 10.7.2. DFS Components in the Server Kernel 10.7.3. DFS Components in the Client Kernel 10.7.4. DFS Components in User Space 10.8. SUMMARY PROBLEMS Примечания

Read this book now: Distributed operating systems

Download (3193k) in formats: fb2, lrf, epub, mobi, txt, html

close [X]

Reviews

Good book

Оценка 5 из 5 звёзд от Jeevan Kumar Papagari 29.01.2018 09:13

very well

Оценка 5 из 5 звёзд от nnnn 29.10.2017 05:36

best

Оценка 5 из 5 звёзд от kshitij 18.02.2017 08:53

many many thanks

Оценка 5 из 5 звёзд от sanjida 09.06.2016 18:31

Incredible Struggle. A Sea of Knowledge About Operating System Is Available Under one Place

SK Ahsan 23.05.2015 14:04

Thank you very much for your hard effort

many many thanks

Оценка 5 из 5 звёзд от Muhammad Adeel Aijaz 21.02.2015 11:32

it's great work

Оценка 5 из 5 звёзд от Himabindu 18.08.2014 10:23

i wanna solution problems of this book
how can download that
plz help me

Оценка 5 из 5 звёзд от elena 07.06.2014 12:30

Thanks alot !!

Оценка 5 из 5 звёзд от SHIBIN MAK 21.05.2014 00:50

Комментарий

Guest 15.04.2014 12:26

great work n its easy

Оценка 5 из 5 звёзд от shilki tomar 25.10.2013 07:11

nice

shilki 25.10.2013 07:10

Great

Оценка 1 из 5 звёзд от gh 14.09.2012 08:17

Good Work

Оценка 5 из 5 звёзд от homer benny 27.04.2012 13:02 India, Secunderabad

ABC

Оценка 5 из 5 звёзд от ABC 02.04.2012 12:35 India, Gandhidham

good work

Оценка 5 из 5 звёзд от vijay 18.03.2012 18:18 India, Dehra Dun

Всего обзоров: 16

Средний рейтинг 4.0 из 5

fantasy space fantasy fantasy is horrors heroic prose military child russian detective action child ironical historical political western adventure adventure (child) child's stories love religion antique	Scientific literature biography business home pets animals art history computers linguistics mathematics religion home_garden sport technique publicism philosophy chemistry
close