The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
How to assign votes in a distributed system
Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
Solution of a problem in concurrent programming control
Communications of the ACM
A Distributed Solution to the k-out of-M Resources Allocation Problem
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
A New Method for Constructing Efficient Local Coteries
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Resource allocation with immunity to limited process failure
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Optimal Resource Allocation in Clouds
CLOUD '10 Proceedings of the 2010 IEEE 3rd International Conference on Cloud Computing
| Hi-index | 0.89 |
The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the problem in a distributed way. Distributed algorithms using coteries usually incur low communication overheads and have high degrees of fault-tolerance, and ND coteries are candidates for the algorithms to achieve the highest degree of fault-tolerance. A new type of coteries, called p-coteries, is defined to aid the construction of local coteries. Theorems about the nondomination of p-coteries are then developed, and an operation, called pairwise-union (p-union), is proposed to help generate ND p-coteries, which in turn can be used to generate ND local coteries for solving the resource allocation problem.