CMOS design of the tree arbiter element

An asynchronous arbiter dynamically allocates a resource in response to requests from processes, Glitch-free operation when two requests arrive concurrently is possible in MOS technologies, Multiway arbitration using a request-grant-release-acknowledge protocol can be achieved by connecting together two-way arbiters (mutual exclusion and tree arbiter elements), We have devised a fast and compact design for the tree arbiter element which. offers eager forward-propagation of requests, It compares favorably with a well-known design in which request propagation must wait for arbitration to complete, Our analysis and simulations also suggest that no performance improvement will be obtained by incorporating eager acknowledgment of releases, All of the designs considered in this paper are speed-independent, a formal property of a network of elements which can be taken as a positive indication of their robustness.