A Union Operation of Non-Dominated K-Coterie in Distributed System

Authors

  • NURHIDAYAH NURHIDAYAH Hasanuddin University
  • Armin Lawi Hasanuddin University
  • Amir Kamal Amir Hasanuddin University

DOI:

https://doi.org/10.20956/jmsk.v16i3.6940

Keywords:

Quorums, non-dominated k-coterie, expanded union operation

Abstract

Coterie is a set of quorums which has non-empty intersections and are not part of other quorum. The natural development of the coterie system is k-coterie. The k-coterie consists of 2 types, that are non-dominated k-coterie and dominated k-coterie. The non-dominated k-coterie is more resilient to failure than the dominated k-coterie. Combining two non-dominated k-coterie by applying union operation can result  the dominated k-coterie. This study aims to define a combination of the non-dominated k-coterie with non-dominated k-coterie  using the expanded union operation. The merger of non-dominated k-coterie with the non-dominated k-coterie produces a non-dominated k-coterie.

Downloads

Download data is not yet available.

References

Lawi, A., dkk. 2006. A Quorum based distributed conflict resolution algorithm for bounded capacity resources. Lecture Notes in Computer Science (LNCS), Vol. 4331, Springer Verlag-Berlin, Hal. 135–144.

Maekawa. 1985. A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Systems 3(2), Hal. 145-159.

Kakugawa, dkk. 1993. Availability of k-Coterie.IEEE Transactions on Computer.Vol. 42, No. 5.

Molina dan Barbara. 1985. How to assign votes in a distributed system.J . ACM 32(4), Hal.841–860.

Lawi, A dan Rustam 2008. Availability Comparison of Quorum Systems in Distributed Systems. Proceedings of The 1st Makassar International Conference on Electrical Engineering and Informatics, Hasanuddin University, Makassar, Indonesia. ISBN : 978-979-18765-0-6.

Jiang, Jhen-Ruey dan Shing-Tsaan Huang. 1994. Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion. Department of Computer Science National Tsing Hua University HsinChu, Taiwan, 30043 R. 0.C.

Lawi, A., dkk. 2005. A Simple Quorum Reconfiguration for Open Distributed Environments. International Conference on Parallel and Distributed System, IEEE Computer Society.

Neilsen, Mitchell L. dan Masaaki Mizuno. 1992. Coterie Join Algorithm. IEEE Transactions on Parallel and Distributed System, Vol. 3, No. 5, Hal.759-765.

Arsal, Armayani. 2016. Operasi Penggabungan Himpunan Korum yang Menghasilkan Koteri Tak-terdominasi Pada Sistem Terdistribusi.Hasanuddin University, Makassar, Indonesia.

Downloads

Published

2020-04-28

Issue

Section

Research Articles