a priority-based distributed group mutual exclusion algorithm when group access is non-uniform：一种基于优先级的分组访问非均匀分布群互斥算法.pdfVIP

J. Parallel Distrib. Comput. 67 (2007) 797 –815 /locate/jpdc A priority-based distributed group mutual exclusion algorithm when group access is non-uniform Neeraj Mittal a ,∗, Prajwal K. Mohanb , 1 aDepartment of Computer Science, The University of Texas at Dallas, Richardson, TX 75083, USA bDigital Home Group, Intel Corporation, Hillsboro, OR 97124, USA Received 5 May 2006; received in revised form 2 January 2007; accepted 19 February 2007 Available online 14 March 2007 Abstract In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a mutually exclusive manner. Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally. This is quite acceptable if a process, at the time of making a request for critical section, selects a group for the critical section uniformly. However, if some groups are more likely to be selected than others, then better performance can be achieved by treating different groups in a different manner. In this paper, we propose an efficient algorithm for solving the group mutual exclusion problem when group selection probabilit