CORE

Distributed Computing

24CSE664 · S6 · 4 credits

Official KTU 2024 syllabus subject — study with practice, PYQs and AI tools.

§
Syllabus
Loading syllabus…
Manage →
⚡ DAY-BEFORE EXAM

Have an exam tomorrow?

Get a high-yield attack plan focused on maximum marks per minute. Zero fluff, strict PYQ priority, active recall, and trap avoidance.

Strategy: High-yield concepts + PYQs + weak areas

Tap a module to mark as weak
PRIORITY A
Module 1

Why:Foundation module

+ Mark Weak
PRIORITY A
Module 2

Why:High exam relevance

+ Mark Weak
PRIORITY B
Module 3

Why:Core module

+ Mark Weak
PRIORITY B
Module 4

Why:Applied concepts

+ Mark Weak
PRIORITY C
Module 5

Why:Standard exam coverage

+ Mark Weak
Modules
Module 01Distributed systems basics and Computation model (7 hours)expand

Distributed System – Definition, Relation to computer system components, Motivation, Primitives for distributed communication, Design issues, Challenges and applications. A model of distributed computations – Distributed program, Model of distributed executions, Models of communication networks, Global state of a distributed system, Cuts of a distributed computation, Past and future cones of an event, Models of process communications.

Module 02Logical Clock, Global state and Termination detection (8 hours)expand

Logical time – A framework for a system of logical clocks, Scalar time, Vector time. Leader election algorithm – Bully algorithm, Ring algorithm. Global state and snapshot recording algorithms – System model and definitions, Snapshot algorithm for FIFO channels – Chandy Lamport algorithm. Termination detection – System model of a distributed computation, Termination detection using distributed snapshots, Termination detection by weight throwing,Spanning-tree-based algorithm.

Module 03Mutual exclusion and Deadlock detection (6 hours)expand

Distributed mutual exclusion algorithms – System model, Requirements of mutual exclusion algorithm. Lamport’s algorithm, Ricart–Agrawala algorithm, Quorum-based mutual exclusion algorithms – Maekawa’s algorithm. Token-based algorithm – Suzuki–Kasami’s broadcast algorithm. Deadlock detection in distributed systems – System model, Deadlock handling strategies, Issues in deadlock detection, Models of deadlocks.

Module 04Distributed shared memory and Failure recovery (7 hours)expand

Distributed shared memory – Abstraction and advantages. Shared memory mutual exclusion – Lamport’s bakery algorithm. Check pointing and rollback recovery – System model, consistent and inconsistent states, different types of messages, Issues in failure recovery, checkpoint based recovery, log based roll back recovery.

Module 05Consensus and authentication (7 hours)expand

Consensus and agreement algorithms – Assumptions, The Byzantine agreement and other problems, Agreement in (message-passing) synchronous systems with failures – Consensus algorithm for crash Basis of authentication-Design principles for cryptographic protocols. Protocol based on symmetric cryptosystems-A protocol based on an authentication server, One-time password scheme, Kerberos authentication service (Note: Proof of correctness and performance analysis are not expected for any of the algorithms in the syllabus).

Notes / Resources

Exam-focused notes are optional context — Continue Learning above works even without them.

Notes for this subject aren't written yet

Continue Learning above adapts to this subject anyway — it teaches from your active syllabus.