Unit 2. Distributed Mutual Exclusion
On this page, you will find all the most important and most asked previous year questions from unit 2 Distributed Mutual Exclusion of the Distributed System subject.
It will help you in the preparation of your semester exam to score good marks. It will also save you from the backlogs.
Topic : Distributed Mutual Exclusion (Key Note and Questions)
Key Note:
Questions
- Q1). What do you mean by mutual exclusion? Explain . Also write the requirements of mutual exclusion.
- Q2). Is mutual exclusion problem more complex in distributed system than single computer system? Justify your answer.
- Q3). Explain token and non-token based algorithm. Write its merit and demerits.
- Q4). Write the different between token and non-token based algorithm.
- Q5). Write and explain a token based algorithm for mutual exclusion . Describe its performance on important metrics.
- Q6). Explain the Ricart-Algorithm for mutual exclusion. How many messages per critical section execution are required ?
- Q7). Explain Mackawa's algorithm.
- Q8). Explain Singhal's heuristic algorithm.
- Q9). What are the performance metrics for mutual exclusion algorithm.
- Q10). Explain Raymond's tree-based algorithm.
Topic : Distributed Deadlock Detection (Key Note and Questions)
Key Note:
Questions
- Q1). What do you mean by Deadlock? Write the necessary conditions for the occurence of deadlock in distributed system?
- Q2). Differentiate resource deadlock and communication deadlock.
- Q3). Explain the assumption model for deadlock detection.
- Q4). What is deadlock? What are the necessary conditions for the occurrence of deadlock in distributed system? Describe the deadlock handling strategies in distributed system.
- Q5). Write the deadlock handling strategy in distributed system. What are the difference between centralized ,distributed and hierarchical control oraganizations for distributed deadlock detection.
- Q6). Classify the deadlock detection algorithms. Describe the Obermarck's path pushing deadlock detection algorithm.
- Q7). Explain the deadlock avoidance algorithm. Also describe edge chasing deadlock detection algorithm.
- Q8). Explain the Menasce-Muntz algorithm and The Ho-Ramamoorthy algorithm.
Topic : Message Passing Systems (Key Note and Questions)
Key Note:
- Q1). What is vector clock? How this maintains causal ordering ? Explain.
- Q2). Explain the implementation rule of vector clock. Give the advantage of vector clock over Lamport's logical clock.
- Q3). Discuss causal ordering of messages. Give any algorithm which can order the messages according to causal dependencies.
- Q4). SES protocol.
- Q5). BSS Protocol.
- Q6). Explain global state with the help of an example.
- Q7). What is termination detection in distributed system? Explain any algorithm for termination detection.
- Q8). Why is scalablity and important feature in the design of distributed system? Discuss some of the guiding principles for designing a scalable distributed system.
Recent Posts
Data Structure complete overview in one post
May 10, 2021
Page Contents1 What is Data Structure?2 Data Type3 Array and Linked List3.1 Linked List4 Searching and Sorting5 Graph and Tree6 Stack and Queue What is
B-tree, its properties and steps for insertion operation in B-tree
April 27, 2021
A B-tree is an extended version of m-way. There are some drawbacks with the m way tree is, in the worst case, it may behave
Compaction, Overflow and Underflow in Array
April 27, 2021
Page Contents1 Compaction2 Overflow3 Underflow Compaction Garbage collection is the process of collecting all unused nodes and returning them to available space. This process is