A Method for Router Table Compression for Application Specific Routing in Mesh Topology NoC Architectures

  • Maurizio Palesi
  • Shashi Kumar
  • Rickard Holsmark
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4017)


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.


Output Port Input Port Communication Graph Mesh Topology Rout Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bolotin, E., Morgenshtein, A., Cidon, I., Kolodny, A.: Automatic and hardware-efficient SoC integration by qos network on chip. In: IEEE International Conference on Electronics, Circuits and Systems, Tel Aviv (2004)Google Scholar
  2. 2.
    Dally, W.J., Towles, B.: Route packets, not wires: On-chip interconnection networks. In: Design Automation Conference, Las Vegas, Nevada, USA, pp. 684–689 (2001)Google Scholar
  3. 3.
    Guerrier, P., Greiner, A.: A generic architecture for on-chip packet-switched interconnections. In: Design Automation and Test in Europe, Paris, France, pp. 250–256 (2000)Google Scholar
  4. 4.
    Chiu, G.M.: The odd-even turn model for adaptive routing. IEEE Transactions on Parallel Distribuited Systems 11, 729–738 (2000)CrossRefGoogle Scholar
  5. 5.
    Glass, C.J., Ni, L.M.: The turn model for adaptive routing. Journal of the Association for Computing Machinery 41, 874–902 (1994)Google Scholar
  6. 6.
    Holsmark, R., Kumar, S.: Design issues and performance evaluation of mesh NoC with regions. In: IEEE Norchip, Oulu, Finland, pp. 40–43 (2005)Google Scholar
  7. 7.
    Duato, J.: A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distribuited Systems 4, 1320–1331 (1993)CrossRefGoogle Scholar
  8. 8.
    Palesi, M., Holsmark, R., Kumar, S., Catania, V.: APSRA: A methodology for design of application specific routing algorithms for NoC systems. Technical Report DIIT-TR-01-060406, Dip. di Ingegneria Informatica e delle Telecomunicazioni, Univ. di Catania (2006)Google Scholar
  9. 9.
    Wang, X., Siguenza-Tortosa, D., Ahonen, T., Nurmi, J.: Asynchronous network node design for network-on-chip. In: International Symposium on Signals, Circuits and Systems, vol. 1, pp. 55–58 (2005)Google Scholar
  10. 10.
    Vaidya, A.S., Sivasubramaniam, A., Das, C.R.: LAPSES: A recipe for high performance adaptive router design. In: Fifth International Symposium On High-Performance Computer Architecture, Orlando, Florida, USA, pp. 236–243 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Maurizio Palesi
    • 1
  • Shashi Kumar
    • 2
  • Rickard Holsmark
    • 2
  1. 1.DIITUniversity of CataniaItaly
  2. 2.Jönköping UniversitySweden

Personalised recommendations