A degree priority routing algorithm for irregular mesh topology NoCs
In this paper, a degree priority routing algorithm is proposed to minimize the hardware cost for nonregular mesh network-on-chip. In the algorithm, the routing path is dynamically selected with respective to the communication status of the next hop node. The next hop node concluded by the degree priority routing different with them obtained by routing algorithm are inserted in the routing table. And, the items in the routing table that have the same contents are combined to further minimize the area and power. Experimental results show that the proposed algorithm has better performance than other three routing algorithms.
Computer networks; Computer science; Costs; Embedded computing; Embedded software; Network topology; Network-on-a-chip; Routing; Software algorithms; Switches
Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Electronic Devices and Semiconductor Manufacturing | Power and Energy | Systems and Communications
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
A degree priority routing algorithm for irregular mesh topology NoCs.
Proceedings of the International Conference on Embedded Software and Systems, ICESS 2008
Institute of Electrical and Electronics Engineers.