Professional Documents
Culture Documents
DS IAT 3
DS IAT 3
CO5: Understand peer to peer and distributed shared memory systems in distributed systems
BLOOM'S TAXONOMY
PART A (5 x 2 = 10 Marks)
CO4 U 1. Compare various issues in failure recovery. (2)
CO4 A 2. Construct an algorithm for asynchronous checkpointing (2)
CO4 A 3. Organize the results in agreement in a failure (2)
CO5 U 4. Outline the importance of data indexing. (2)
CO5 U 5. Classify the memory consistency models. (2)
PART B (2*13 = 26 Marks)
CO5 A 6. Identify the role of distributed shared memory in distributed systems. (13)
Illustrate how memory consistency models are implemented in Distributed
CO5 U 7. (13)
systems.
PART C (1*14 = 14 Marks)
CO4 E 8. Explain in detail about consensus and agreement algorithms. (14)