Distributed Computing

Introduction to Distributed Systems – Primitives for Distributed Communication – Design Challenges – Distributed Systems like Models for Distributed Computations – Overview of Distributed Databases -Structure of Distributed Databases. Virtual Time in Distributed System: Logical Time - Scalar Time – Vector Time Lamport's Algorithm – Case Study -Logical Clocks in Riak - Global and Snapshot Recording Algorithms – Model - Snapshot Algorithms for FIFO Channels - Chandy–Lamport Algorithm – Snapshot Algorithms for Non FIFO Channels. Message Ordering And Group Communication - Message Ordering Paradigms – Asynchronous anSynchronous Execution - Causal Order – Total Order – Group Communication – Case Study (Horus , Totem) –Distributed Multicast Algorithms. Distributed Mutual Exclusion: Lamports Algorithm -Ricart– Agrawala Algorithm - Quorum-based Mutual Exclusion Algorithms. Deadlock Detection : Models of Deadlock – Classification of Deadlock Detection Algorithms -Mitchell and Merritt’s algorithm for the Single Resource Model - Chandy–Misra–Haas Algorithm For The AND/OR Model. Consensus and Agreement Algorithms and Failure Detection - Agreement in Failure Free Systems and Systems with Failures –The Consensus Problem – Byzantine Fault Tolerance. Case Study : Condor. Distributed

Database Design: Design Strategies - Design issues - Fragmentation and Allocation. Semantic Data Control: View Management Distributed Query Processing: Overview of Query Processing – Transforming Global Queries to Fragment Queries - Query Decomposition - Localization of Distributed data. Distributed Transaction Processing and Concurrency Control – 2PC -3PC.