An efficient routing technique for mesh-of-tree-based NoC and its performance comparison
by K. Manna; S. Chattopadhaya; I. Sengupta
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 4, No. 1, 2012

Abstract: This paper presents a new dimension ordered routing (DOR) algorithm for mesh-of-tree (MoT)-based network-on-chip (NoC) designs. A simple addressing scheme has been used in this new algorithm. The addressing scheme enables us to reduce the minimum flit-size for a 4 × 4 MoT to 16 bits, compared to 32 bits in the previously reported works. The algorithm has been proved to be deadlock, live-lock and starvation free. It also ensures shortest-path routing for the packets. It results in significant saving in the energy consumed by the network. It allows us to vary router complexity flexibly while planning the MoT-based NoC for application specific system-on-chip (SoC) synthesis. Performance and cost metric comparison with other topologies shows the proposed MoT to be better than many of them.

Online publication date: Tue, 02-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com