CS8603 – NOTES & QP
|SEMESTER QP||CLICK HERE|
CS8603 – SYLLABUS
UNIT I INTRODUCTION
Introduction: Definition –Relation to computer system components –Motivation –Relation to parallel systems — Message-passing systems versus shared memory systems –Primitives for distributed communication –Synchronous versus asynchronous executions –Design issues and challenges. A model of distributed computations: A distributed program –A model of distributed executions –Models of communication networks –Global state — Cuts –Past and future cones of an event –Models of process communications. Logical Time: A framework for a system of logical clocks –Scalar time –Vector time — Physical clock synchronization: NTP.
UNIT II MESSAGE ORDERING & SNAPSHOTS
Message ordering and group communication: Message ordering paradigms –Asynchronous execution with synchronous communication –Synchronous program order on an asynchronous system –Group communication — Causal order (CO) — Total order. Global state and snapshot recording algorithms: Introduction –System model and definitions –Snapshot algorithms for FIFO channels
UNIT III DISTRIBUTED MUTEX & DEADLOCK
Distributed mutual exclusion algorithms: Introduction — Preliminaries — Lamport?s algorithm — Ricart-Agrawala algorithm — Maekawa?s algorithm — Suzuki–Kasami?s broadcast algorithm. Deadlock detection in distributed systems: Introduction — System model — Preliminaries — Models of deadlocks — Knapp?s classification — Algorithms for the single resource model, the AND model and the OR model.
UNIT IV RECOVERY & CONSENSUS
Checkpointing and rollback recovery: Introduction — Background and definitions — Issues in failure recovery — Checkpoint-based recovery — Log-based rollback recovery — Coordinated checkpointing algorithm — Algorithm for asynchronous checkpointing and recovery. Consensus and agreement algorithms: Problem definition — Overview of results — Agreement in a failure —
free system — Agreement in synchronous systems with failures.
UNIT V P2P & DISTRIBUTED SHARED MEMORY
Peer-to-peer computing and overlay graphs: Introduction — Data indexing and overlays — Chord — Content addressable networks — Tapestry. Distributed shared memory: Abstraction and advantages — Memory consistency models –Shared memory Mutual Exclusion.