Application Specific Routing Algorithms for Networks on Chip
2009 (English)In: IEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219, E-ISSN 1558-2183, Vol. 20, no 3, p. 316-330Article in journal (Refereed) Published
Abstract [en]
In this paper we present a methodology to develop efficient and deadlock free routing algorithms for Network-on-Chip (NoC) platforms which are specialized for an application or a set of concurrent applications. The proposed methodology, called application specific routing algorithm (APSRA), exploits the application specific information regarding pairs of cores which communicate and other pairs which never communicate in the NoC platform to maximize communication adaptivity and performance. The methodology also exploits the known information regarding concurrency/non-concurrency of communication transactions among cores for the same purpose. We demonstrate, through analysis of adaptivity as well as simulation based evaluation of latency and throughput, that algorithms produced by the proposed methodology give significantly higher performance as compared to other deadlock free algorithms for both homogeneous as well as heterogeneous 2D mesh topology NoC systems. For example, for homogeneous mesh NoC, APSRA results in approximately 30% less average delay as compared to odd-even algorithm just below saturation load. Similarly the saturation load point for APSRA is significantly higher as compared to other adaptive routing algorithms for both homogeneous and non-homogeneous mesh networks.
Place, publisher, year, edition, pages
New York: IEEE Computer Society , 2009. Vol. 20, no 3, p. 316-330
Keywords [en]
2D mesh topology, adaptive routing algorithms, application specific routing algorithms, deadlock free routing algorithms, network-on-chip platforms
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering Computer Sciences
Identifiers
URN: urn:nbn:se:hj:diva-10927DOI: 10.1109/TPDS.2008.106OAI: oai:DiVA.org:hj-10927DiVA, id: diva2:278434
2009-11-262009-11-262018-01-12Bibliographically approved