Scribd
Upload
3 views

Important Questions-distributed Computing

The document outlines important questions for the CS3551 Distributed Computing course, covering topics across five units. These include concepts such as parallel vs distributed computing, logical time, distributed mutex, consensus, recovery, and cloud computing. Each unit contains specific algorithms and models relevant to the field of distributed systems.

Uploaded by

Syed Thameem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Important Questions-distributed Computing

The document outlines important questions for the CS3551 Distributed Computing course, covering topics across five units. These include concepts such as parallel vs distributed computing, logical time, distributed mutex, consensus, recovery, and cloud computing. Each unit contains specific algorithms and models relevant to the field of distributed systems.

Uploaded by

Syed Thameem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS3551- Distributed Computing

Important questions
Unit I: Introduction
1. Parallel computing vs distributed computing
2. Blocking, non-blocking, Synchronous versus Asynchronous Executions
3. Message -Passing Systems versus Shared Memory Systems
4. Design Issues and Challenges
5. Applications of distributed computing
Unit II: Logical Time And Global State
1. lamport timestamp, vector timestamp
2. Christian algorithm, Berkeley algorithm
3.Message Ordering Paradigms
4.Group Communication
5.Causal Order –raynal schiper algorithm, Total Order
6.Snapshot Algorithms for FIFO Channels-chandy lamport algorithm
Unit III: Distributed Mutex And Deadlock
1.RicartAgrawala’s Algorithm(lamport algorithm is similar)
2.Token-Based Algorithms – Suzuki-Kasami’s Broadcast Algorithm.
3.Deadlock Detection,deadlock handling in Distributed Systems
4.Models of Deadlocks
5.Chandy-Misra-Haas Algorithm for the AND model and OR Model.
Unit IV: Consensus And Recovery
1.lamport-shostak-pease algorithm
2. Agreement in Synchronous Systems with Failures
3.Checkpointing and Rollback Recovery-consistent set of
checkpoints,synchronous checkpointing and recovery,rollback algorithm
4.Issues in Failure Recovery
5.Coordinated Checkpointing Algorithm-koo toueg algorithm
6.Algorithm for Asynchronous Checkpointing and Recovery-juang
venkatesan algorithm
Unit V: Cloud Computing
1.Cloud Deployment Models
2.Cloud Service Models
3.Cloud Services and Platforms
4.Virtualization
5.Load Balancing – Scalability and Elasticity

S.SYED THAMEEM
RRASE college of engineering

You might also like