The document discusses topics related to distributed computing including transparency requirements, load balancing, termination detection, properties of scalar time, issues in deadlock detection, mutual exclusion algorithms, advantages of distributed shared memory, consistency conditions, Byzantine agreement problem, and features of SUN Network File System. It also includes questions related to these topics with options to answer in detail about related algorithms, models, and issues.
The document discusses topics related to distributed computing including transparency requirements, load balancing, termination detection, properties of scalar time, issues in deadlock detection, mutual exclusion algorithms, advantages of distributed shared memory, consistency conditions, Byzantine agreement problem, and features of SUN Network File System. It also includes questions related to these topics with options to answer in detail about related algorithms, models, and issues.
The document discusses topics related to distributed computing including transparency requirements, load balancing, termination detection, properties of scalar time, issues in deadlock detection, mutual exclusion algorithms, advantages of distributed shared memory, consistency conditions, Byzantine agreement problem, and features of SUN Network File System. It also includes questions related to these topics with options to answer in detail about related algorithms, models, and issues.
The document discusses topics related to distributed computing including transparency requirements, load balancing, termination detection, properties of scalar time, issues in deadlock detection, mutual exclusion algorithms, advantages of distributed shared memory, consistency conditions, Byzantine agreement problem, and features of SUN Network File System. It also includes questions related to these topics with options to answer in detail about related algorithms, models, and issues.
Reg No.: 0400csT402t0230r s APJ ABDUL KALAM TECHNOLOGICAL UNIVE Eighth semester B.Tech Degree Supplementary Examination october 2023 w Course Code: CST402 Course Name: DISTRIBUTED COMPUTING Max. Marks: 100 Duration:3 Hours PART A Answer all questions, eoch carries 3 morks. Marks
t, Discuss about the transparency requirements of distributed system. (3)
2 What do you mean by load balancing in a distributed environment. (3) 3 Defi ne Term ination Detection. (3) 4 What are the basic properties of scalar time. (3) 5 Explain the issues in Deadlock Detection. (3) 6 List the requirements of Mutual Exclusion Algorithm. (3) 7 List any three advantages of using Distributed Shared Memory. (3) 8 Explain no orphans consistency condition. (3) 9 Defi ne Byzantine agreement problem. (3) t0 Write the features of SUN Network File System. (3) PART B Answer ony onefull question from eqch module, each carries 14 marks. Module I
l I a) Explain the design issues of a distributed system. (8)
b) Discuss about various primitives for distributed communication. (6) OR o 12 a) Explain the applications of distriburedcqmputing. (8) b) Explain the models of communication networks. (6) Module I t3 a) Illustrate bully algorithm for electing a new leader. Does the atgorithm meet (7) liveness and safety conditions? 'Discuss b) the method of termination detection by weight throwing in detail. Q.) oR' l4 a) lllustrate the working of spanning tfee-based termination detection algorithm. (8) b) Exptain in detail about Chandy Lamport algorithm. (6)
Page lof2 0400csT402102301
Module lll | 5 a) Explain how wait for graph can be used in Deadlock Detection. (7) b) Explain and lllustrate Ricart-Agrawala algorithm for achieving mdtual exclusion. (7)
l6 a) Compare various models of deadlock. (7)
b) Illustrate Suzuki- Kasami's Algorithm. (7',)
Module lV l7 a) Show that Lamport's Bakery algorithm for shared memory mutual exclusion, (8) satisfo the three requirements of critical section problem. b) What are the issues in faiture recovery? Illustrate with suitable examples. (6) OR
t8 a) Differentiate consistent and inconsistent state with example. (4)
b) Explain check point based rollback recovery. (t0) Module V t9 a) Explain consensus algorithm for crash failures under synchronous systems. (8) b) Discuss the requirements of a distributed file system. (6)
OR
20 a) Explain google file system architecture. (7',)
Application of Artificial Neural Network (ANN) For Estimating Reliable Service Life of Reinforced Concrete (RC) Structure Bookkeeping Factors Responsible For Deterioration Mechanism
