k-coteries for tolerating network 2-Partition

• Harada, Takashi

• Yamashita, Masafumi

抄録

Network partition, which makes it impossible for some pairs of precesses to communicate with each other, is one of the most serious network failures. Although the notion of k-coterie is introduced to design a k-mutual exclusion algorithm robust against network failures, the number of processes allowed to simultaneously access the critical section may fatally decrease once network partition occurs. This paper discusses how to construct a k-coterie such that the k-mutual exclusion algorithm adopting it is robust against network 2-partition. To this end, we introduce the notion of complemental k-coterie, and show that complemental k-coteries meet our purpose. We then give methods for constructing complemental k-coteries, and show a necessary and sufficient condition for a k-coteries to be complemental.

収録刊行物

• IEEE transactions on parallel and distributed systems

  IEEE transactions on parallel and distributed systems 15 (7), 666-672, 2004-07

  IEEE

キーワード

• Distributed systems
• complemental
• k-coteries
• k-semicoteries
• k-mutual exclusion problem
• network 2-partition
• nondominatedness
• quorums

詳細情報

• CRID: 1050859215941762688
• NII論文ID: 120000881785
• Web Site: http://ir.lib.hiroshima-u.ac.jp/00014150
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • CiNii Articles