Introduction Motivation Basic Computer Organizations Definition of a Distributed System Our Model Interconnection Networks Applications and Standards Scope Source of References Distributed Programming Languages Requirement for Distributed Programming Support An Overview of Parallel/Distributed Programming Language Expressing Parallelism Process Communication and Synchronization Remote Procedure Calls Robustness Formal Approaches to Distributed Systems Design Introduction to Models Causally Related Events Global States Logical Clocks Applications Classification of Distributed Control Algorithms The Complexity of Distributed Algorithms Mutual Exclusion and Election Algorithms Mutual Exclusion Non-Token-Based Solutions Token-Based Solutions Election Bidding Self-Stabilization Prevention, Avoidance, and Detection of Deadlock The Deadlock Problem Deadlock Prevention A Deadlock Prevention Example: Distributed Database Systems Deadlock Avoidance A Deadlock Prevention Example: Multi-Robot Flexible Assembly Cells Deadlock Detection and Recovery Deadlock Detection and Recovery Examples Distributed Routing Algorithms Introduction General-Purpose Shortest Path Routing Unicasting in Special-Purpose Networks Broadcasting in Special-Purpose Networks Multicasting in Special-Purpose Networks Adaptive Deadlock-Free, and Fault-Tolerant Routing Virtual Channels and Virtual Networks Fully Adaptive and Deadlock-Free Routing Partially Adaptive and Deadlock-Free Routing Fault-Tolerant Unicasting: General Approaches Fault-Tolerant Unicasting in 2-D Meshes and Tori Fault-Tolerant Unicasting in Hypercubes Fault-Tolerant Broadcasting Fault-Tolerant Multicasting Reliability in Distributed Systems Basic Models Building Blocks of Fault-Tolerant Design Handling of Node Faults Issues in Backward Recovery Handling of Byzantine Faults Handling of Communication Faults Handling of Storage Faults Static Load Distribution Classification of Load Distribution Static Load Distribution An Overview of Different Scheduling Models Task Scheduling Based on Task Precedent Graphs Case Study: Two Optimal Scheduling Algorithms Task Scheduling Based on Task Interaction Graphs Case Study: Domain Partition Scheduling Using Other Models and Objectives Future Directions Dynamic Load Distribution Dynamic Load Distribution Load Balancing Design Decisions Migration Policies: Sender-Initiated and Receiver-Initiated Parameters Used for Load Balancing Other Relevant Issues Sample Load Balancing Algorithms Case Study: Load Balancing on Hypercube Multicomputers Future Directions Distributed Data Management Basic Concepts Serializability Theory Concurrency Control Replica and Consistency Management Distributed Reliability Protocols Distributed System Applications Distributed Operating Systems Distributed File Systems Distributed Shared Memory Distributed Database Systems Heterogeneous Processing Future Directions of Distributed Systems;BR>Election Bidding Self-Stabilization Prevention, Avoidance, and Detection of Deadlock The Deadlock Problem Deadlock Prevention A Deadlock Prevention Example: Distributed Database Systems Deadlock Avoidance A Deadlock Prevention Example: Multi-Robot Flexible Assembly Cells Deadlock Detection and Recovery Deadlock Detection and Recovery Examples Distributed Routing Algorithms Introduction General-Purpose Shortest Path Routing Unicasting in Special-Purpose Networks Broadcasting in Special-Purpose Networks Multicasting in Special-Purpose Networks Adaptive Deadlock-Free, and Fault-Tolerant Routing Virtual Channels and Virtual Networks Fully Adaptive and Deadlock-Free Routing Partially Adaptive and Deadlock-Free Routing Fault-Tolerant Unicasting: General Approaches Fault-Tolerant Unicasting in 2-D Meshes and Tori Fault-Tolerant Unicasting in Hypercubes Fault-Tolerant Broadcasting Fault-Tolerant Multicasting Reliability in Distributed Systems Basic Models Building Blocks of Fault-Tolerant Design Handling of Node Faults Issues in Backward Recovery Handling of Byzantine Faults Handling of Communication Faults Handling of Storage Faults Static Load Distribution Classification of Load Distribution Static Load Distribution An Overview of Different Scheduling Models Task Scheduling Based on Task Precedent Graphs Case Study: Two Optimal Scheduling Algorithms Task Scheduling Based on Task Interaction Graphs Case Study: Domain Partition Scheduling Using Other Models and Objectives Future Directions Dynamic Load Distribution Dynamic Load Distribution Load Balancing Design Decisions Migration Policies: Sender-Initiated and Receiver-Initiated Parameters Used for Load Balancing Other Relevant Issues Sample Load Balancing Algorithms Case Study: Load Balancing on Hypercube Multicomputers Future Directions Distributed Data Management Basic Concepts Serializability Theory Concurrency Control Replica and Consistency Management Distributed Reliability Protocols Distributed System Applications Distributed Operating Systems Distributed File Systems Distributed Shared Memory Distributed Database Systems Heterogeneous Processing Future Directions of Distributed SystemsD Meshes and Tori Fault-Tolerant Unicasting in Hypercubes Fault-Tolerant Broadcasting Fault-Tolerant Multicasting Reliability in Distributed Systems Basic Models Building Blocks of Fault-Tolerant Design Handling of Node Faults Issues in Backward Recovery Handling of Byzantine Faults Handling of Communication Faults Handling of Storage Faults Static Load Distribution Classification of Load Distribution Static Load Distribution An Overview of Different Scheduling Models Task Scheduling Based on Task Precedent Graphs Case Study: Two Optimal Scheduling Algorithms Task Scheduling Based on Task Interaction Graphs Case Study: Domain Partition Scheduling Using Other Models and Objectives Future Directions Dynamic Load Distribution Dynamic Load Distribution Load Balancing Design Decisions Migration Policies: Sender-Initiated and Receiver-Initiated Parameters Used for Load Balancing Other Relevant Issues Sample Load Balancing Algorithms Case Study: Load Balancing on Hypercube Multicomputers Future Directions Distributed Data Management Basic Concepts Serializability Theory Concurrency Control Replica and Consistency Management Distributed Reliability Protocols Distributed System Applications Distributed Operating Systems Distributed File Systems Distributed Shared Memory Distributed Database Systems Heterogeneous Processing Future Directions of Distributed Systemsisions Migration Policies: Sender-Initiated and Receiver-Initiated Parameters Used for Load Balancing Other Relevant Issues Sample Load Balancing Algorithms Case Study: Load Balancing on Hypercube Multicomputers Future Directions Distributed Data Management Basic Concepts Serializability Theory Concurrency Control Replica and Consistency Management Distributed Reliability Protocols Distributed System Applications Distributed Operating Systems Distributed File Systems Distributed Shared Memory Distributed Database Systems Heterogeneous Processing Future Directions of Distributed Systems.