Lecture 14 of 27Week 4
Distributed Minimum Spanning Tree
Prof. Rajiv Misra · IIT Patna
Credits and licence
- From
- Distributed Systems, IIT Patna (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Kanpur.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Introduction to Distributed Systems
- Basic Algorithms in Message Passing System
- Leader Election in Rings
- Distributed Models of Computation, Causality & Logical Time
- Size of Vector Clock, Matrix Clocks, Virtual Time and Physical Clock Synchronization
- Global State and Snapshot Recording Algorithms
- Distributed Mutual Exclusion and Non-Token based Approaches
- Quorum Based Distributed Mutual Exclusion Approaches
- Token Based Distributed Mutual Exclusion Approaches
- Consensus and Agreement Algorithms
- Checkpointing & Rollback Recovery
- Deadlock Detection in Distributed Systems
- Distributed Shared Memory
- Distributed Minimum Spanning Tree
- Termination Detection in Distributed System
- Message Ordering and Group Communication
- Self-Stabilization
- Case Study 01 - Distributed Randomized Algorithms
- Case Study 02 - Peer-to-Peer Computing and Structured Overlay Network
- Case Study 03 - The Google File System (GFS)
- Case Study 04 - MapReduce
- Case Study 05 - HDFS
- Case Study 06 - Spark
- Case Study 07 - Distributed Algorithms for Sensor Networks
- Case Study 08 - Authentication in Distributed Systems
- Case Study 09 - Bitcoin: A Peer-to-Peer Electronic Cash System
- Case Study 10 - BlockChain Technology