In this paper, we propose two new N-way arbiter circuits. One circuit is based on the token-ring arbiters and another circuit is based on the mesh arbiters. The idea of the ring arbiter is to generate a lock signal by a token which is based on the non-return-to-zero signaling. It can achieve low latency and high throughput arbitration for a heavy work load environment. The idea of the mesh arbiter is to perform arbitrations between N/2 pairs at the same level and repeat them N-1 times. They can issue grant signals fairly. In this paper, we compare the performance of these N-way arbiters using 65nm process technologies qualitatively and quantitatively. We conclude that the proposed mesh arbiters are suitable when the number of inputs is 5 or less. We also conclude that we must select the appropriate arbiters considering tradeoff between latency, throughput, area, and energy when the number of inputs is larger than 5.
[1]
Mark B. Josephs,et al.
CMOS design of the tree arbiter element
,
1996,
IEEE Trans. Very Large Scale Integr. Syst..
[2]
David L. Black.
On the existence of delay-insensitive fair arbiters: Trace theory and its limitations
,
2005,
Distributed Computing.
[3]
D. J. Kinniment.
Synchronization and Arbitration in Digital Systems
,
2008
.
[4]
Alexandre Yakovlev,et al.
Priority arbiters
,
2000,
Proceedings Sixth International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2000) (Cat. No. PR00586).
[5]
William W. Plummer.
Asynchronous Arbiters
,
1972,
IEEE Transactions on Computers.
[6]
Kay Soon Low,et al.
Token Ring Arbiters: An Exercise in Asynchronous Logic Design with Petri Nets
,
1995
.