We designed a time-optimal algorithm for a variant of a k-mutual exclusion in a unidirectional ring. Our problem is that none of the processes specifies the resource that it requires and each resource is assigned to a process with a higher priority than that of unassigned processes without overlapping when there are k resources with the same ability in the network. There are two major conventional resource allocation problems with multiple resources in a distributed context, the k-mutual exclusion problem and the drinking philosophers problem. However, these problems do not include ours. In this paper, we report our design of a strictly time-optimal algorithm in a static situation, which we extended to cope with a dynamic situation.
展开▼