An asynchronous low latency ordered arbiter for network on chips

To improve two shortcomings of traditional arbiters, large arbitration latency and limited correctness, this paper proposes a low latency ordered arbiter. Through arranging input requests arbitrated at the same stage, correctness of the arbiter can be guaranteed, also the strict first come first service (FCFS) can be realized, so as to improve the quality of service (QoS) of the on chip router. The proposed ordered arbiter is implemented based on BPTM 65nm CMOS technology. Results demonstrate this ordered arbiter has significant improvement on arbitration delay, and the area overheads are nearly the same as traditional ones. The proposed ordered arbiter can apply to network on chips which have QoS demand and high speed applications.

[1]  Mark B. Josephs,et al.  CMOS design of the tree arbiter element , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Ran Ginosar,et al.  An asynchronous router for multiple service levels networks on chip , 2005, 11th IEEE International Symposium on Asynchronous Circuits and Systems.

[3]  D. J. Kinniment Synchronization and Arbitration in Digital Systems , 2008 .

[4]  Jens Sparsø,et al.  Principles of Asynchronous Circuit Design , 2001 .

[5]  C. van Berkel,et al.  Beware the three-way arbiter , 1999 .

[6]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[7]  Michael Mendler,et al.  Newtonian arbiters cannot be proven correct , 1993, Formal Methods Syst. Des..

[8]  Alexandre Yakovlev,et al.  Priority arbiters , 2000, Proceedings Sixth International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2000) (Cat. No. PR00586).