Skip Navigation

The Computer Journal 1999 42(7):613-622; doi:10.1093/comjnl/42.7.613
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
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 arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tsuchiya, T.
Right arrow Articles by Kikuno, T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Availability Evaluation of Quorum-Based Mutual Exclusion Schemes in General Topology Networks

Tatsuhiro TsuchiyaA1 and Tohru KikunoA1

A1 Department of Informatics and Mathematical Science, Osaka University, 1–3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan Email: t-tutiya@ics.es.osaka-u.ac.jp

The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. In this paper, we propose a new availability evaluation method for quorum-based mutual exclusion schemes in the presence of failures. Most of the previously proposed methods take neither the topology of systems nor link failures into consideration, and exhaustive state enumeration has been the only approach that can deal with them so far. By incorporating a notion called Minimal Quorum Spanning Trees, this method can efficiently evaluate the availability of quorum-based mutual exclusion schemes in general topology networks with unreliable nodes and links. Through experimental results, we show the superiority of the proposed method over exhaustive state enumeration.

Received 1 December, 1998. Revised 9 September, 1999.


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.