By Topic

A fast distributed modular algorithm for resource allocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Injong Rhee ; Dept. of Comput. Sci., Warwick Univ., Coventry, UK

This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to system resources shared among many concurrent processes. Three different kinds of resource allocation problems with varying degrees of generality are considered: the dining philosophers problem, the drinking philosophers problem and the dynamic resource allocation problem. We present an efficient modular resource allocation algorithm 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 the fastest known resource allocation algorithms in terms of the worst case response time. Simulation studies were conducted which also indicate that our algorithms perform faster and require a smaller number of messages than other previously known algorithms on average, especially when resource contention among processes is high and the average time that a process remains in the critical region is large

Published in:

Distributed Computing Systems, 1995., Proceedings of the 15th International Conference on

Date of Conference:

30 May-2 Jun 1995