A fast token based algorithm for multiple resources sharing in distributed systems

This paper presents a new algorithm for simultaneous resources sharing by several processes in distributed system. This algorithm treats the problem of message complexity which is an important factor in such a problem, and the waiting time of the requesting sites which can be considered as a quality measure of the distributed algorithms. In this algorithm, k tokens are used to resolve the problem with a sensible method of tokens exchanging to minimize the number of exchanged messages for every entry to the CS. The algorithm uses also a fast protocol which minimizes the waiting time between the launch of the requests and the access to the CS.