Transcription of Chapter 9: Distributed Mutual Exclusion Algorithms
{{id}} {{{paragraph}}}
Example: bankruptcy
Chapter 9: Distributed Mutual Exclusion Algorithms
Chapter 9: Distributed Mutual Exclusion AlgorithmsAjay Kshemkalyani and Mukesh SinghalDistributed Computing: Principles, Algorithms , and SystemsCambridge University PressA. Kshemkalyani and M. Singhal ( Distributed Computing) Distributed Mutual Exclusion AlgorithmsCUP 20081 / 93 Distributed Computing: Principles, Algorithms , and SystemsIntroductionMutual Exclusion : Concurrent access of processes to a shared resource ordata is executed in mutually exclusive one process is allowed to execute the critical section (CS) at any a Distributed system, shared variables (semaphores) or alocal kernelcannot be used to implement Mutual passing is the sole means for implementing Distributed Kshemkalyani and M. Singhal ( Distributed Computing) Distributed Mutual Exclusion Algorithms2 / 93 Distributed Computing: Principles, Algorithms , and SystemsIntroductionDistributed Mutual Exclusion Algorithms must deal with unpredictablemessage delays and incomplete knowledge of the system basic approaches for Distributed Mutual Exclusion :1 Token based approach2 Non-token based approach3 Quorum based a
Performance Metrics The performance is generally measured by the following four metrics: Message complexity: The number of messages required per CS execution by a site. Synchronization delay: After a site leaves the CS, it is the time required and before the next site enters the CS (see Figure 1). Last site exits the CS Synchronization delay time
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: