A generalized grid quorum strategy for k-mutual exclusion in distributed systems

✍ Scribed by Ye-In Chang; Bor-Hsu Chen

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 87 KB
• Volume: 80
• Category: Article
• ISSN: 0020-0190
• DOI: 10.1016/s0020-0190(01)00164-8

✦ Synopsis

In the problem of k-mutual exclusion, concurrent access to shared resource or the critical section (CS) must be synchronized such that at any time at most k processes can access the CS. In this paper, we propose a generalized grid quorum strategy for k-mutual exclusion, which imposes a logical grid structure on the network. The quorum size is always equal to (M + 1)/(k + 1) × (N + 1)/2 , where M is the number of rows and N is the number of columns in a grid. From our performance study, we show that the generalized grid quorum strategy can provide a good performance in terms of the quorum size and the availability.