## A Dynamic Group Mutual Exclusion Algorithm using Surrogate-Quorums (2005)

### Cached

### Download Links

- [www.utdallas.edu]
- [www.utdallas.edu]
- [www.utdallas.edu]
- [www.cecs.uci.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS |

Citations: | 12 - 4 self |

### BibTeX

@INPROCEEDINGS{Atreya05adynamic,

author = {Ranganath Atreya},

title = {A Dynamic Group Mutual Exclusion Algorithm using Surrogate-Quorums},

booktitle = {in Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS},

year = {2005},

pages = {251--260}

}

### OpenURL

### Abstract

The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusive manner. In this paper, we provide a distributed algorithm for solving the group mutual exclusion problem based on the notion of surrogatequorum. Intuitively, our algorithm uses the quorum that has been successfully locked by a request as a surrogate to service other compatible requests for the same type of critical section. Unlike the existing quorum-based algorithms for group mutual exclusion, our algorithm achieves a low message complexity of O(q), where q is the maximum size of a quorum, while maintaining both synchronization delay and waiting time at two message hops. Moreover, like the existing quorum-based algorithms, our algorithm has high maximum concurrency of n, where n is the number of processes in the system. The existing quorum-based algorithms assume that the number of groups is static and does not change during runtime. However, our algorithm can adapt without performance penalties to dynamic changes in the number of groups. Simulation results indicate that our algorithm outperforms the existing quorum-based algorithms for group mutual exclusion by as much as 50 % in some cases. 1.

### Citations

861 |
the Ordering of Events in a Distributed System
- Time
(Show Context)
Citation Context ...jm@utdallas.edu execution of critical section) by different processes must be synchronized to ensure its integrity by allowing at most one process to access the resource at a time. Numerous solutions =-=[7, 15, 19, 20, 18]-=- and extensions [9, 8, 5, 6] have been proposed to the basic mutual exclusion problem. More recently, another extension to the basic mutual exclusion problem, called group mutual exclusion, has been p... |

771 |
Parallel Program Design: A Foundation
- Chandy, Misra
- 1988
(Show Context)
Citation Context ...al section) by different processes must be synchronized to ensure its integrity by allowing at most one process to access the resource at a time. Numerous solutions [7, 15, 19, 20, 18] and extensions =-=[9, 8, 5, 6]-=- have been proposed to the basic mutual exclusion problem. More recently, another extension to the basic mutual exclusion problem, called group mutual exclusion, has been proposed [11]. In the group m... |

301 |
Solution to a problem in concurrent programming control
- Dijkstra
- 1965
(Show Context)
Citation Context ...jm@utdallas.edu execution of critical section) by different processes must be synchronized to ensure its integrity by allowing at most one process to access the resource at a time. Numerous solutions =-=[7, 15, 19, 20, 18]-=- and extensions [9, 8, 5, 6] have been proposed to the basic mutual exclusion problem. More recently, another extension to the basic mutual exclusion problem, called group mutual exclusion, has been p... |

225 |
A p N Algorithm for Mutual Exclusion in Decentralized Systems
- Maekawa
- 1985
(Show Context)
Citation Context ...sion [19] have been proposed in [12]. These algorithms have high message complexity and high message overhead of O(n) and O(n 2 ), respectively. The quorum-based mutual exclusion algorithm by Maekawa =-=[16]-=- has also been modified to derive twosquorum-based algorithms for group mutual exclusion [13]. These algorithms use a special type of quorum system called the group quorum system. In a group quorum sy... |

203 |
Hierarchical ordering of sequential processes
- Dijkstra
- 1971
(Show Context)
Citation Context ...al section) by different processes must be synchronized to ensure its integrity by allowing at most one process to access the resource at a time. Numerous solutions [7, 15, 19, 20, 18] and extensions =-=[9, 8, 5, 6]-=- have been proposed to the basic mutual exclusion problem. More recently, another extension to the basic mutual exclusion problem, called group mutual exclusion, has been proposed [11]. In the group m... |

161 |
An optimal algorithm for mutual exclusion in computer networks
- Ricart, Agrawala
- 1981
(Show Context)
Citation Context ...jm@utdallas.edu execution of critical section) by different processes must be synchronized to ensure its integrity by allowing at most one process to access the resource at a time. Numerous solutions =-=[7, 15, 19, 20, 18]-=- and extensions [9, 8, 5, 6] have been proposed to the basic mutual exclusion problem. More recently, another extension to the basic mutual exclusion problem, called group mutual exclusion, has been p... |

148 | The drinking philosophers problem
- Chandy, Misra
- 1984
(Show Context)
Citation Context ...al section) by different processes must be synchronized to ensure its integrity by allowing at most one process to access the resource at a time. Numerous solutions [7, 15, 19, 20, 18] and extensions =-=[9, 8, 5, 6]-=- have been proposed to the basic mutual exclusion problem. More recently, another extension to the basic mutual exclusion problem, called group mutual exclusion, has been proposed [11]. In the group m... |

75 |
A distributed mutual exclusion algorithm
- Suzuki, Kasami
- 1985
(Show Context)
Citation Context |

46 | Global quiescence detection based on credit distribution and discovery
- Mattern
- 1989
(Show Context)
Citation Context ...cumulates all the weights it received over RELEASED messages and maintains its lock until its cumulative weight becomes one. An efficient solution for weight distribution and recovery was proposed in =-=[17]-=-. The proposed approach involved storing rational numbers as integers in factional form thus avoiding real numbers. Using this approach, we only incur an overhead of two integers per INVITE and RELEAS... |

35 | Resource allocation with immunity to limited process failure
- Fisher, Lynch, et al.
- 1979
(Show Context)
Citation Context |

29 | A simple local-spin group mutual exclusion algorithm
- Keane, Moir
- 1999
(Show Context)
Citation Context ...ded disk can access the disk concurrently. While users that need data on a different disk will have to wait. Solutions for the group mutual exclusion problem under shared-memory model can be found in =-=[10, 14, 1, 9]-=-. In this paper, we investigate the group mutual exclusion problem under message-passing model. For message-passing model, solutions to group mutual exclusion have been proposed for ring networks [4, ... |

27 | Asynchronous group mutual exclusion
- Joung
- 2000
(Show Context)
Citation Context ...ensions [9, 8, 5, 6] have been proposed to the basic mutual exclusion problem. More recently, another extension to the basic mutual exclusion problem, called group mutual exclusion, has been proposed =-=[11]-=-. In the group mutual exclusion problem, every critical section is associated with a type or a group. Critical sections belonging to the same group can be executed concurrently while critical sections... |

20 | The congenial talking philosophers problem in computer networks (extended abstract
- Joung
- 1999
(Show Context)
Citation Context ...d have high waiting time. For a fully connected network, group mutual exclusion algorithms based on modification of the Ricart and Agrawalaâ€™s algorithm for mutual exclusion [19] have been proposed in =-=[12]-=-. These algorithms have high message complexity and high message overhead of O(n) and O(n 2 ), respectively. The quorum-based mutual exclusion algorithm by Maekawa [16] has also been modified to deriv... |

20 |
A tree based algorithm for distributed mutual exclusion algorithms
- Raymond
- 1989
(Show Context)
Citation Context |

17 | Asynchronous group mutual exclusion in ring networks
- Wu, Joung
- 1999
(Show Context)
Citation Context ... 10]. In this paper, we investigate the group mutual exclusion problem under message-passing model. For message-passing model, solutions to group mutual exclusion have been proposed for ring networks =-=[4, 21]-=- and tree networks [3]. Typically, solutions for ring and tree networks incur high synchronization delay and have high waiting time. For a fully connected network, group mutual exclusion algorithms ba... |

15 |
A note on group mutual exclusion
- Hadzilacos
- 2001
(Show Context)
Citation Context ...ded disk can access the disk concurrently. While users that need data on a different disk will have to wait. Solutions for the group mutual exclusion problem under shared-memory model can be found in =-=[11, 14, 1, 10]-=-. In this paper, we investigate the group mutual exclusion problem under message-passing model. For message-passing model, solutions to group mutual exclusion have been proposed for ring networks [4, ... |

12 |
Quorum-based algorithms for group mutual exclusion
- Joung
(Show Context)
Citation Context ...message overhead of O(n) and O(n 2 ), respectively. The quorum-based mutual exclusion algorithm by Maekawa [16] has also been modified to derive twosquorum-based algorithms for group mutual exclusion =-=[13]-=-. These algorithms use a special type of quorum system called the group quorum system. In a group quorum system, any two quorums belonging to the same group need not intersect while quorums belonging ... |

10 | Token based group mutual exclusion for asynchronous rings
- Cantarell, Datta, et al.
- 2001
(Show Context)
Citation Context ... 10]. In this paper, we investigate the group mutual exclusion problem under message-passing model. For message-passing model, solutions to group mutual exclusion have been proposed for ring networks =-=[4, 21]-=- and tree networks [3]. Typically, solutions for ring and tree networks incur high synchronization delay and have high waiting time. For a fully connected network, group mutual exclusion algorithms ba... |

8 | Group Mutual Exclusion in Tree Networks
- Beauquier, Cantarell, et al.
- 2003
(Show Context)
Citation Context ...vestigate the group mutual exclusion problem under message-passing model. For message-passing model, solutions to group mutual exclusion have been proposed for ring networks [4, 21] and tree networks =-=[3]-=-. Typically, solutions for ring and tree networks incur high synchronization delay and have high waiting time. For a fully connected network, group mutual exclusion algorithms based on modification of... |

6 |
Elegant Solutions for Group Mutual Exclusion Problem
- Alagarsamy, Vidyasankar
- 1999
(Show Context)
Citation Context ...ded disk can access the disk concurrently. While users that need data on a different disk will have to wait. Solutions for the group mutual exclusion problem under shared-memory model can be found in =-=[11, 14, 1, 10]-=-. In this paper, we investigate the group mutual exclusion problem under message-passing model. For message-passing model, solutions to group mutual exclusion have been proposed for ring networks [4, ... |