GUG · Third Year B.Tech. Computer Science and Engineering · NEP 2020
Distributed Systems
STPECCSE506B · Programme Elective I · Semester V · 3 credits · IE 10 + mid-semester 10 + ESE 80
One of the Programme Elective I options.
Unit 1: Architecture of Distributed Systems
9 hoursCharacteristics, motivation and design challenges of distributed systems; architectural models: client-server, search engines, proxy servers and caches, mobile code and mobile agents; the interaction, failure and security models.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Distributed systems: goals and types
- Distributed computing system models and DCE
- System architectures: centralised, decentralised and hybrid
Unit 2: Distributed Objects, File Systems and Theoretical Foundations
9 hoursInter-process communication, sockets, middleware, group communication and RPC; stateless and stateful servers and cache update policies. Inherent limitations; clock synchronisation and NTP; Lamport's logical clocks and vector clocks; causal ordering of messages; global state, cuts and termination detection.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Communication: RPC, message, stream and multicast
- Group communication
- Distributed file systems
- Clock synchronisation
- Logical and vector clocks
- Global states
Unit 3: Distributed Mutual Exclusion
9 hoursLeader election by the Chang-Roberts ring algorithm and the bully algorithm; requirements and measures of mutual exclusion algorithms; Lamport's, Ricart-Agrawala and Maekawa's algorithms; Suzuki-Kasami's and Raymond's token-based algorithms.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Election algorithms
- Distributed mutual exclusion
- Token-based mutual exclusion: Suzuki-Kasami and Raymond
Unit 4: Distributed Deadlock Detection and Agreement Protocols
9 hoursResource and communication deadlocks and the graph-theoretic model; prevention, avoidance and detection; centralised and distributed detection algorithms. Agreement protocols: synchronous and asynchronous computation, process failures, authenticated messages, the Byzantine agreement problem and its applications.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Distributed deadlock detection
- Byzantine generals and blockchains
Unit 5: Failure Recovery and Fault Tolerance
9 hoursClassification of failures; backward and forward error recovery; recovery in concurrent systems, consistent checkpoints, synchronous and asynchronous checkpointing; atomic actions and commit protocols, non-blocking commit; voting and dynamic voting protocols.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Fault tolerance and recovery
- Checkpointing and recovery
- Commit and voting protocols
Unit contents are summarised from the official GUG syllabus . AiCanCode.org is not affiliated with Gondwana University, Gadchiroli.