Skip Navigation


The Computer Journal Advance Access originally published online on December 21, 2007
The Computer Journal 2008 51(6):677-687; doi:10.1093/comjnl/bxm106
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
51/6/677    most recent
bxm106v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kuo, Y.-C.
Right arrow Articles by Wu, P.-Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

The Availability of Complemental k-Coteries

Yu-Chen Kuo* and Po-Yao Wu

Department of Computer and Information Science, Soochow University, Taipei 100, Taiwan, R.O.C.

* Corresponding author: yckuo{at}cis.scu.edu.tw

Received 6 June 2007; revised 9 October 2007

k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual exclusion algorithm adopting k-coteries could provide the fault-tolerant capability. The complementalness and the availability are two important metrics to measure the fault-tolerant capability of a k-coterie. Since those two metrics are defined under two different failure assumptions, for a given k-coterie, two independent works to measure those two metrics are necessary. In this paper, we derive the characteristics of the complemental k-coterie on its availability. With the characteristic, verifying the complementalness of a k-coterie and evaluating its availability could be combined together to reduce the redundant works on measuring the fault-tolerant capability of the k-coterie.

Key Words: availability • complementalness • distributed systems • fault-tolerance • k-coteries • k-mutual exclusion problem • network 2-partition • quorums


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.