Transcription of Chapter 9: Distributed Mutual Exclusion Algorithms
{{id}} {{{paragraph}}}
Example: confidence
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.
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 Next site enters the CS Figure 1: Synchronization Delay. A. Kshemkalyani and M. Singhal (Distributed Computing) Distributed Mutual Exclusion Algorithms 7 / 93
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: