Paper Info
Title
A method for router table compression for application specific routing in mesh topology noc architectures
Abstract
One way to specialize a general purpose multi-core chip built using NoC principles is to provide a mechanism to configure an application specific deadlock free routing algorithm in the underlying communication network. A table in every router, implemented using a writable memory, can provide a possibility of specializing the routing algorithm according to the application requirements. In such an implementation the cost (area) of the router will be proportional to the size of the routing table. In this paper, we propose a method to compress the routing table to reduce its size such that the resulting routing algorithm remains deadlock free as well as has high adaptivity. We demonstrate through simulation based evaluation that our application specific routing algorithm gives much higher performance, in terms of latency and throughput, as compared to general purpose algorithms for deadlock free routing. We also show that a table size of two entries for each output port gives performance within 3% of the uncompressed table.
Year
DOI
Venue
2006
10.1007/11796435_38
SAMOS
Keywords
Field
DocType
uncompressed table,router table compression,mesh topology noc architecture,general purpose algorithm,routing table,resulting routing algorithm,deadlock free routing,specific deadlock free routing,routing algorithm,application requirement,table size,application specific routing algorithm,information science,chip
Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Enhanced Interior Gateway Routing Protocol,Parallel computing,Computer network,Destination-Sequenced Distance Vector routing,Routing table,Metrics
Conference
Volume
ISSN
ISBN
4017
0302-9743
3-540-36410-2
Citations 
PageRank 
References 
33
1.75
7
Authors
3
Name
Order
Citations
PageRank
Maurizio Palesi1111978.82
Shashi Kumar228216.58
Rickard Holsmark324913.10