CSE 3-1 DS

        All Materials regarding to B.tech R-20 in Computer Science Engineering with unit wise for Every Subjects are available.


👇👇Scroll Down for Important Questions and Topics Unit Wise 👇👇

CSE  3-1 DS
S.NoChapters / UnitsDownload Link
1Unit 1Download
2Unit 2Download
3Unit 3Download
4Unit 4Download
5Unit 5Download


 

CSE DS Important Topics Questions

UNIT I: 

Distributed Systems: 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: Check pointing and rollback recovery: Introduction, Background and definitions, 
Issues in failure recovery, Checkpoint-based recovery, Log-based rollback recovery, Coordinated check 
pointing algorithm, Algorithm for asynchronous check pointing 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: 

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.

Disclaimer :
We are not responsible for any loss of data /or any other information by visiting this website. We just providing previous papers to help the students who need previous papers to prepare themselves. This downloaded from internet source just to education purpose only. 
Thank you.



Feel free to contact us, if you want any other courses or Tutorials or any other information .
We'll always try to helps you better learn something

Post a Comment

Previous Post Next Post