Abstract.
This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: May 1997 / Accepted: May 1998
Rights and permissions
About this article
Cite this article
Rhee, I. A modular algorithm for resource allocation. Distrib Comput 11, 157–168 (1998). https://doi.org/10.1007/s004460050047
Issue Date:
DOI: https://doi.org/10.1007/s004460050047