k-coteries for tolerating network 2-Partition

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

KETERSEDIAAN OPERASI JOIN DIPERLUAS KOTERI-k TAK-TERDOMINASI

Penelitian ini bertujuan menganalisis ketersediaan dari koteri-  mayoritas tak-terdominasi yang menggunakan operasi join diperluas yaitu penggabungkan koteri- ,  dan  masing-masing atas semesta  dan  dengan unsur tereliminasi , dimana  yang menghasilakan koteri-  tak-terdominasi  atas semesta . Metode penggabungan koteri-  mayoritas tak-terdominasi yang menggunakan operasi join diperluas menghasilkan koteri  atas . Hasil ketersediaan dari operasi join kemudian dibandingkan dengan ketersedian dengan menggunakan operasi join. Dari penelitian ini, menunjukkan bahwa ketersedian operasi join memberikan hasil yang lebih baik jika dibandingkan dengan ketersedian dari operasi join

The Availability of Complemental k-Coteries

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 comple-mentalness 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 capa-bility of the k-coterie