Prepared by
S.Santhosh (Admin)
Important questions
share it a link alone
Don't waste my hardwork and valuable time
Don't share as screenshot kind request
most viewed dept will get update at first So Dont screenshot and share
CS8603 DISTRIBUTED SYSTEM (DS)
UNIT -1
1. Scalar time,Vector time,sync vs async executions2. Fundamental model of communication3. Desiging issue ,challenges and example of dsUNIT-21. CO full topic2. Message ordering paradigms 3. Snapshot algorithms for FIFO channelsDon't share as screenshotUNIT-31.Ricart-Agrawala algorithm ,Maekawa‘s algorithm(2. Lamport‘s algorithm3. Knapp‘s classification ) may be part c Don't share as screenshotUNIT-41. Issues in failure recovery ,Checkpoint-based recovery2. Algorithm for asynchronous checkpointing and recovery3. Log-based rollback recovery UNIT-51.Distributed shared memory fully2.Shared memory Mutual Exclusion3.Rare Data indexing and overlaysDon't share as screenshot -Stuff sector
**Very important questions are bolded and may be asked based on this topic
PART-C
1.Compulsory Questions {a case study where the student will have to read and analyse the subject }mostly asked from unit 2, 5(OR) a situation given and you have to answer on your own
CS8603 DISTRIBUTED SYSTEM (DS)
Don't share as screenshot -Stuff sector
**Very important questions are bolded and may be asked based on this topic
don't waste my hardwork and valuable time
Contact uS for more updates
*These questions are expected for the exams This may or may not be asked for exams All the best.... from admin Santhosh
Thanks for your love and support guys keep supporting and share let the Engineers know about Us and leave a comment below for better improvements If there is any doubt feel free to ask me I will clear if I can or-else I will say some solutions ..get me through WhatsApp for instant updates ~$tuff$£ctor
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.
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.