Presentation 1996/9/17
Quorum Reassignment Algorithms to Improve the Availability of Distributed Mutual Exclusion Systems
Takashi HARADA, Masafumi YAMASHITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Availability / coteries / distributed mutual exclusion / not fully connected networks / quorums
Paper # COMP96-30
Date of Issue

Conference Information
Committee COMP
Conference Date 1996/9/17(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Quorum Reassignment Algorithms to Improve the Availability of Distributed Mutual Exclusion Systems
Sub Title (in English)
Keyword(1) Availability
Keyword(2) coteries
Keyword(3) distributed mutual exclusion
Keyword(4) not fully connected networks
Keyword(5) quorums
1st Author's Name Takashi HARADA
1st Author's Affiliation Information Processing Center Hiroshima University()
2nd Author's Name Masafumi YAMASHITA
2nd Author's Affiliation Department of Electrical Engineering Hiroshima University
Date 1996/9/17
Paper # COMP96-30
Volume (vol) vol.96
Number (no) 250
Page pp.pp.-
#Pages 8
Date of Issue