On the Nondomination of Cohorts Coteries

Authors:
Jehn-Ruey Jiang
Affiliations:
Dept. of Inf. Manage., Hsuan Chuang Univ., Hsin-Chu, Taiwan
Venue:
IEEE Transactions on Computers
Year:
2004

Citing 7
Cited 2

A distributed k-mutual exclusion algorithm using k-coterie

Information Processing Letters
Nondominated k-coteries for multiple mutual exclusion

Information Processing Letters
Erratum to “Nondominated k-coteries for multiple mutual exclusion”

Information Processing Letters
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section

IEEE Transactions on Computers
Coterie Join Operation and Tree Structured k-Coteries

IEEE Transactions on Parallel and Distributed Systems
Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion

Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Distributed k-Mutual Exclusion Problem and k-Coteries

ISA '91 Proceedings of the 2nd International Symposium on Algorithms

Comments on "On the Nondomination of Cohorts Coteries"

IEEE Transactions on Computers
A fault-tolerant h-out of-k mutual exclusion algorithm using cohorts coteries for distributed systems

PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper, we show that subsets of Cohorts coteries proposed in [CHECK END OF SENTENCE] are nondominated (ND) k-coteries, which are candidates to achieve the highest availability when utilized to solve the distributed k-mutual exclusion problem and the distributed h-out of-k mutual exclusion problem.