[go: up one dir, main page]
Scribd
Upload
140 views1 page

CS3551 Distributed Computing Important Questions

Uploaded by

sivasankarib89
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
140 views1 page

CS3551 Distributed Computing Important Questions

Uploaded by

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

CS3551 Distributed Computing Important Questions

UNIT I INTRODUCTION

1. PASSING S/M VS SHARED memory s/m**


2. Model of distributed computations, global state
3. Designing issue, challenges and example of ds**

UNIT II LOGICAL TIME AND GLOBAL STATE

1. CO (casual order) full topic**


2. Message ordering paradigms
3. Snapshot algorithms for FIFO channels**

UNIT III DISTRIBUTED MUTEX AND DEADLOCK

1. Ricart- Agrawala algorithm, Maekawa‘s algorithm


2. Lamport‘s algorithm
3. Knapp‘s classification

UNIT IV CONSENSUS AND RECOVERY

1. Issues in failure recovery, Checkpoint-based recovery


2. Algorithm for asynchronous checkpointing and recovery
3. Log-based rollback recovery

UNIT V CLOUD COMPUTING

1. Characteristics of CC deployment models**


2. Virtualization, motoring and cloud service platform
3. Rare storage, app services

You might also like