### Abstract

A typical group mutual exclusion algorithm among m groups makes use of anm-group coterie, which determines the performance of the algorithm. There are two main performance measures: The availability is the probability that an algorithm tolerates process crash failures, and the concurrency is the number of processes that it allows simultaneous access to the resources. Since non-dominated (ND, for short) m-group coteries (locally) maximize the availability and their degrees roughly correspond to the concurrency, methods to construct ND m-group coteries with large degrees are looked for. Nevertheless, only a few naive methods have been proposed. This paper presents three methods to construct desirable m-group coteries. The first method constructs an ND m-group coterie from a dominated one using the transversal composition. The second one constructs an ND (m - 1)-group coterie from an ND m-group coterie. The last one uses the coterie join operation to produce an ND m-group coterie from an ND coterie and another ND mgroup coterie. These methods preserve the degrees of the original m-group coteries.

Original language | English |
---|---|

Title of host publication | Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010 |

Pages | 119-126 |

Number of pages | 8 |

Publication status | Published - Jul 20 2010 |

Event | 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010 - Innsbruck, Austria Duration: Feb 16 2010 → Feb 18 2010 |

### Publication series

Name | Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010 |
---|

### Other

Other | 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010 |
---|---|

Country | Austria |

City | Innsbruck |

Period | 2/16/10 → 2/18/10 |

### All Science Journal Classification (ASJC) codes

- Computational Theory and Mathematics
- Computer Networks and Communications
- Software

## Fingerprint Dive into the research topics of 'Constructing non-dominated m-group coteries for group mutual exclusion'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010*(pp. 119-126). (Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010).