Constructing non-dominated m-group coteries for group mutual exclusion

Takashi Harada, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010
Pages119-126
Number of pages8
Publication statusPublished - 2010
Event9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010 - Innsbruck, Austria
Duration: Feb 16 2010Feb 18 2010

Other

Other9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010
CountryAustria
CityInnsbruck
Period2/16/102/18/10

Fingerprint

Availability
Chemical analysis

All Science Journal Classification (ASJC) codes

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

Cite this

Harada, T., & Yamashita, M. (2010). Constructing non-dominated m-group coteries for group mutual exclusion. In Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010 (pp. 119-126)

Constructing non-dominated m-group coteries for group mutual exclusion. / Harada, Takashi; Yamashita, Masafumi.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harada, T & Yamashita, M 2010, Constructing non-dominated m-group coteries for group mutual exclusion. in Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010. pp. 119-126, 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010, Innsbruck, Austria, 2/16/10.
Harada T, Yamashita M. Constructing non-dominated m-group coteries for group mutual exclusion. In Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010. 2010. p. 119-126
Harada, Takashi ; Yamashita, Masafumi. / Constructing non-dominated m-group coteries for group mutual exclusion. Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010. 2010. pp. 119-126
@inproceedings{7a8bdde7a76e496d873322ad17070565,
title = "Constructing non-dominated m-group coteries for group mutual exclusion",
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.",
author = "Takashi Harada and Masafumi Yamashita",
year = "2010",
language = "English",
isbn = "9780889868205",
pages = "119--126",
booktitle = "Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010",

}

TY - GEN

T1 - Constructing non-dominated m-group coteries for group mutual exclusion

AU - Harada, Takashi

AU - Yamashita, Masafumi

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77954611727&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954611727&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9780889868205

SP - 119

EP - 126

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

ER -