Shared resource allocation using token passing strategy in interconnected networks

This paper presents solutions based on request based token control strategy for controlling the allocation of a single shared resource in logically interconnected networks such as single side wrap around mesh and regular mesh. In this strategy, a processor which is in need of the shared resource, sends a request to inform the token of the access request. Token, on receipt of a request, continues searching the processor that has a pending request and stops after serving all requests. The proposed token passing strategies assume no source and destination identities and require only a finite number of message exchanges per request. It is observed that these protocols permit a bounded service time and tolerate node or link faults that are traced before the execution of the algorithms.