- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Quorum Reassignment Algorithms to Improve the Availability of Distributed Mutual Exclusion Systems
-
- HARADA Takashi
- Information Processing Center Hiroshima University
-
- YAMASHITA Masafumi
- Department of Electrical Engineering Hiroshima University
Bibliographic Information
- Other Title
-
- 分散相互排除システムの可用度を改善するコーラム再割当アルゴリズム
Search this article
Description
Quorum-based mutual exclusion systems offer the high availability of system. The availability of system heavily depends on the quorum set (called a coterie) adopted. So, many algorithms have been proposed for construct good quorums. However, most studies assume that topologies of distributed. systems are fully connected. In not fully connected network, no quorum construct algorithm based on theoretical characterization is presented. In this paper, we propose algorithms for reassign quorums according to their connectivities on networks. The system using the resulting quorums is guaranteed to have the higher availability than the original one.
Journal
-
- IEICE technical report. Theoretical foundations of Computing
-
IEICE technical report. Theoretical foundations of Computing 96 (250), 21-28, 1996-09-17
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1570572702400044160
-
- NII Article ID
- 110003191399
-
- NII Book ID
- AN10013152
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles