An Algorithm to construct nondominated k-coteries
One of the solution in solving k mutual exclusion problem is the concept of k-coterie. A k-coterie under a set S is a set of subsets of S or quorums such that any k + 1 quorums, there are at least two quorums intersect each other. The k mutual exclusion problern is the problem of managing processes...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2020-05-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02254 am a22003013u 4500 | ||
|---|---|---|---|
| 001 | ijeecs20994_13901 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Ginanjar, Rikip |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Hadisukmana, Nur |e author |
| 245 | 0 | 0 | |a An Algorithm to construct nondominated k-coteries |
| 260 | |b Institute of Advanced Engineering and Science, |c 2020-05-01. | ||
| 500 | |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/20994 | ||
| 520 | |a One of the solution in solving k mutual exclusion problem is the concept of k-coterie. A k-coterie under a set S is a set of subsets of S or quorums such that any k + 1 quorums, there are at least two quorums intersect each other. The k mutual exclusion problern is the problem of managing processes in such a way that at most k processes can enter their critical sections simultaneously. Nondominated k-coteries are more resilient to network and site failures than doninated k-coteries; that is the availability and reliability of a distributed system is better if nondominated k-coteries are used. Algorithms to construct k-coteries have been proposed, unfortunately they have some restrictions, especially in constructing nondominated k-coteries. The restrictions are due to the combination of N, the number of nodes in a distributed system, and k, the number of processes allowed to enter their critical sections simultaneously. To solve this problem, this paper proposes an algorithm to construct nondominated k-coteries for all combination of N and k. | ||
| 540 | |a Copyright (c) 2019 Institute of Advanced Engineering and Science | ||
| 540 | |a http://creativecommons.org/licenses/by-nc/4.0 | ||
| 546 | |a eng | ||
| 690 | |||
| 690 | |a Coterie; Mutual Exclusion; Nondominated; Quorum | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |2 local | |
| 786 | 0 | |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 18, No 2: May 2020; 953-960 | |
| 786 | 0 | |n 2502-4760 | |
| 786 | 0 | |n 2502-4752 | |
| 786 | 0 | |n 10.11591/ijeecs.v18.i2 | |
| 787 | 0 | |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/20994/13901 | |
| 856 | 4 | 1 | |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/20994/13901 |z Get fulltext |