Distributed Systems - Super Short Notes
Unit 1: Introduction
• Definition: Collection of independent computers appearing as single system.
• Design Goals: Transparency, Openness, Reliability, Performance, Scalability.
• Types: Distributed Computing, Distributed Information, Distributed Pervasive.
• Trade-offs: Transparency ↑ => Performance ↓ sometimes.
• Clusters/Grids/Cloud: Cluster = tightly coupled; Grid = loosely; Cloud = on-demand service.
• Architecture: Layered, Object-based, Event-based, Hybrid.
• Models: Interaction, Failure, Security models.
• Middleware: Bridge between OS & applications, hides complexity.
• Threads: Lightweight processes for parallelism.
• Virtualization: Abstract hardware/software resources.
• Client-Server: Client requests, server responds.
• Code Migration: Moving code between machines.
Unit 1: PYQs
• Dist vs Parallel: Distributed = multiple computers, Parallel = tightly coupled processors.
• Example: ATM network, Google search, DNS.
• Middleware role: Transparency, communication, resource mgmt.
• Reliable System: Replication, Redundancy, Fault detection, Recovery.
• Adv vs Centralized: Adv: Reliability, Scalability; Disadv: Complexity, Security.
• Transparency types: Access, Location, Concurrency, Replication, Failure, Migration,
Performance, Scaling.
Unit 2: Communication
• Fundamentals: Message passing, socket, protocols.
• RPC: Call remote procedure like local one.
• Message-Oriented: Send/receive messages asynchronously.
• Stream-Oriented: Continuous flow (audio/video).
• Multicast: One-to-many communication.
• Sync vs Async RPC: Sync = wait, Async = don’t wait.
• Publish-Subscribe: Publisher broadcasts, subscribers get updates.
• Multicast Streams: Live sports streaming, stock updates.
Unit 3: Synchronization
• Clock Sync: Cristian’s, Berkeley algorithm.
• Logical vs Physical: Logical = ordering, Physical = real-time clock.
• Mutual Exclusion: Centralized, Distributed, Token-based.
• Decentralized: Voting-based, multiple coordinators.
• Election: Bully, Ring algorithm.
• Berkeley Algorithm: Average time from all nodes, master adjusts clocks.