Describe how the Distributed Queue (the distributed mutual exclusion semaphore)

Question

Describe how the Distributed Queue (the distributed mutual exclusion semaphore) guarantees "deadlock free" in a distributed system (only for one distributed mutex. semaphore). Assumptions No message will be lost. . Messages from a distributed process will be delivered to another distributed process in that order (ie, a message (M) that was sent after another message (M) at a distributed process to a remote distributed process is always delivered to the remote distributed process in that order (after Mi is always delivered to the remote process before M) Messages will be delivered in finite amount of time. When there is a tie in the logical time stamp, the process ID can be used to break the tie. Note: Describing anything that is not related to the solution or anything that does not contribute to a solution at all

Explanation / Answer

Answer)

So as to provide the mutual exclusion in a distributed system the quorum based mutual exclusion approach is used which is of a low complexity of message and of high resiliency.

Even some schemes to construct the delay-optimal quorums so as to reduce the average message delays.

This in turn ensures the mutual exclusions with the high synchronization delays which is referred as 2T. Upon the quorum principle based is the free deadlock distributed mutual exclusion algorithm made. All the group are in structured manner so as to order the circular list. The message requests are being send by request process which helps to visit the processes as per the list’s order. 2 root over message is the requirement for every critical section execution (n being the number of processes in the network)

Hope this answer helps. :) Happy to help.

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---