Adaptive Look Ahead algorithm for 2-D mesh NoC

Abhilash Menon, Lian Zeng, Xin Jiang, Takahiro Watanabe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


The existing System on Chip (SoC) design will soon become a critical bottle neck in chip performance with its inability to scale its communication network effectively with decreasing feature sizes and increasing number of transistors. The Network on Chip (NoC) has been recognized as the next evolutionary step to tackle these issues by using an intelligent and common communication network between all the different components within chip. In this paper we propose a new routing algorithm that uses a combination of a fully adaptive and partial adaptive routing algorithm called Adaptive Look Ahead algorithm. The algorithm decides next two hops within one node to allow quick packet transfer in next node, hence the algorithm only periodically calculates the packets route along the minimal path. Experimental results show that our proposed algorithm has lower latency and higher throughput than existing benchmarks.

Original languageEnglish
Title of host publicationSouvenir of the 2015 IEEE International Advance Computing Conference, IACC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages4
ISBN (Print)9781479980475
Publication statusPublished - 2015 Jul 10
Event2015 5th IEEE International Advance Computing Conference, IACC 2015 - Bangalore, India
Duration: 2015 Jun 122015 Jun 13


Other2015 5th IEEE International Advance Computing Conference, IACC 2015


  • 2-D mesh NoC
  • adaptive routing algorithm
  • look ahead routing algorithm

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Hardware and Architecture
  • Signal Processing
  • Modelling and Simulation


Dive into the research topics of 'Adaptive Look Ahead algorithm for 2-D mesh NoC'. Together they form a unique fingerprint.

Cite this