The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
Distributed algorithm for K-entries to critical section based on the directed graphs
ACM SIGOPS Operating Systems Review
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
A new algorithm for k mutual exclusions in distributed systems
Journal of Systems and Software
Multiple instance resource allocation in distributed computing systems
Journal of Parallel and Distributed Computing
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
| Hi-index | 0.00 |
This paper presents a distributed algorithm for the general dynamic resource allocation problem. A process may request any subset of the system resources (that may be available in several instances) during a request session. We focus on the message complexity which measures the number of messages a process incurs when it requests resources. The proposed algorithm is tokens-based and uses between 0 and n + 3k messages, where k is the total number of resources and n the total number of processes. On average, O (log n) messages are used if k is constant. Our solution allows several processes to enter their critical section simultaneously with respect to the exclusive access to resources requirement.