CMOS design of the tree arbiter element
Authors:
- M.B. JosephsMJM.B. Josephs
- J.T. YantchevJYJ.T. Yantchev
- 1 December 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 4 (4) , 472-476
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- A low latency asynchronous arbitration circuitIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1994
- Asynchronous circuits for low power: a DCC error correctorIEEE Design & Test of Computers, 1994
- Automatic verification of asynchronous circuits using temporal logicIEE Proceedings E Computers and Digital Techniques, 1986
- Asynchronous Arbiter ModuleIEEE Transactions on Computers, 1975
- Anomalous Behavior of Synchronizer and Arbiter CircuitsIEEE Transactions on Computers, 1973
- Asynchronous ArbitersIEEE Transactions on Computers, 1972