SISTEM HIMPUNAN KORUM DAN MASALAH RESOLUSI KONFLIK TERDISTRIBUSI

Febryanti Febryanti

doi:10.35329/fkip.v7i1.16

SISTEM HIMPUNAN KORUM DAN MASALAH RESOLUSI KONFLIK TERDISTRIBUSI

Febryanti Febryanti

Abstract

The aims of this study are (1) to analyze relaxation of the characteristics of distributed mutual exclusion problem of various problems of widening conflict resolution in distributed system, (2) to develop coterie set system in solving any types of conflict resolution in distributed system, (3) to analyze coterie set to solve the distributed conflict problem. The method used was literary study by collecting research materials through library journals that relevant with the subject matter i.e. quorum set system and various problems of distributed conflict resolution. The results of the research indicated that mutual exclusion (mutex) can be solved with coterie, k-mutex problem can be solved by using k-coterie, read-writer problem can be solved by using bicoteri, restricted resources problem can be solved by using (m,h,ki)-coterie. For restricted and various resources matter can be constructed with disjoint and simple uniform (m,h,k)-coterie.

Keywords

bicoterie; conflict resolution; coterie; distributed system; mutual exclusion

Full Text:

PDF

References

Jiang, Jehn-Ruey. (2005). A Fault-Tolerant h-out of k-mutual exclusion Algorithm Using Cohorts Coterie for Distributed Systems, Lecture Notes in Computer Science (LNCS), Vol.3320,267-273, DOI: 10.1007/978-3-540-30501-9_57.

Joung, Yuh-Jzer. (2000). Asynchronous Group Mutual Exclusion, Distributed Computing, Vol.13,Number 4. 189-206,DOI: 10.1007/PL00008918.

Joung, Yuh-Jzer. (2004). On Quorum Systems for Group Resources with Bounded Capacity, Lecture Notes in Computer Science (LNCS), Vol. 3274, 86-101, DOI: 10.1007/978-3-540-30186-8_7

Joung, Yuh-Jzer. (2010). On quorum systems for group resources allocation, Distributed Computing, Vol.22, number 3, 197-214, DOI: 10.1007/s00446-010-0094-4.

Kakugawa, Hirotsugu and Kamei, Sayaka. (2010). A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem, Lecture Notes in Computer Science (LNCS), Vol. 6490,411-426, DOI: 10.1007/978-3-642-17653-1_30.

Lawi, A., Oda, K., dan Yoshida, T. (2005). A Simple Quorum Reconfiguration for Open Distributed Environment. Proceedings 11th international Conference on Parallel and Distributed Systems (ICPADS), Vol. 2, 664-668, IEEE Xplore Digital Library. DOI: 10.1109/ICPADS. 2005.48

Lawi, A., Oda, K., dan Yoshida, T. (2005). A Quorum Based Group k-Mutual Exclusion Algorithm for Open Distributed Environments, Lecture Notes in Computer Science (LNCS), Volume 3758, 119-25, Springer-Verlag, DOI: 10.1007/11576235_16

Lawi, A., Oda, K., dan Yoshida, T. (2006). Quorum Based Distributed Conflict Resolution Algorithm for Bounded Capacity Resources, Lecture Notes in Computer Science (LNCS), Vol. 4331, 135-44, Springer-Verlag. DOI: 10.1007/11942634_15

Lawi, A., Oda, K., dan Yoshida, T. (2006). A Quorum Based (m, h, k)-Resource Allocation Algorithm. Proceedings of the International Conference on Paralleland Distributed Processing Techniques and Applications (PDPTA), Vol. 1, 399-405, CSREA Poress.

Suhatril, R. J. (2004). Catatan Kuliah Sistem Terdistribusi. (serial online) diunduh 18 Nopember 2011.

http://openstorage.gunadarma.ac.id/sistem.terdistribusi/sister_main1. pdf