Token based solutions to M resources allocation problem
Aomar Maddi · 1997
Distributed mutual exclusion algorithms can be classified into two categories: permission based and token based.This paper presents two distributed algorithms that extend known token based mutual exclusion algorithms to handle AND-Synchronization problems where each process can obtain an exclusive access to a set of resources rather than to a single resource.The message complexity of the obtained algorithms is independent from the number of the requested resources.This complexity vary from 0 to 2(n-1) for the explicit request algorithm and A.(n -1) for the implicit re-'quest algorithm whatever is the set of requested resources.1