Previous Issues

Department of Electrical and Computer Engineering, Kuwait University, P. O. Box 5969, Safat-13060, Kuwait

ABSTRACT

This paper deals with a resource sharing problem in a distributed system that is more general than the classical mutual exclusion problem. In order to address this problem, we first propose a deterministic strategy called LRM strategy and establish its correctness. Then we show that the tight bound on the state space complexity for a solution to the problem is nlogn bits. The paper also presents a typical distributed algorithm for implementing the proposed strategy in an arbitrary network.

Keywords: Distributed systems; Fairness; Resource sharing; Starvation; Strong fairness.