14th International Conference on Distributed Computing Systems (1994)
June 21, 1994 to June 24, 1994
R. Baldoni , Dipartimento di Inf. e Sistemistica, Rome Univ., Italy
This paper presents a permission-based algorithm to solve the problem of M identical resources shared among N processes in a distributed system. We prove that the number of messages exchanged necessary for a process to acquire k resources is O(N/sup M/(M+1)/). This result has been obtained (i) investigating the concept of arbiter of conflicting processes and (ii) extending conditions that permit conflict detection and resolution in a system of N competing processes to M shared resources. We show that for M=1 we get Maekawa's algorithm. However, we will also show that Maekawa's results, being based on finite projective plane geometry, do not apply for M>1.<
resource allocation, distributed algorithms
R. Baldoni, "An O(N/sup M/(M+1/)) distributed algorithm for the k-out of-M resources allocation problem," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 81-88.