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!
|
Internet
Get fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |