Making-a-stop: A new bufferless routing algorithm for on-chip network

  • Authors:
  • Jing Lin;Xiaola Lin;Liang Tang

  • Affiliations:
  • Department of Computer Science, School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China;Department of Computer Science, School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China and Key laboratory of Ministry of Education for Digit Home, Guangzhou, China;Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, China

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the deep submicron regime, the power and area consumed by router buffers in network-on-chip (NoC) have become a primary concern. With buffers elimination, bufferless routing is emerging as a promising solution to provide power-and-area efficiency for NoC. In this paper, we present a new bufferless routing algorithm that can be coupled with any topology. The proposed routing algorithm is based on the concept of making-a-stop (MaS), aiming to deadlock and livelock freedom in wormhole-switched NoC. Performance evaluation is carried out by using a flit-level, cycle-accurate network simulator under synthetic traffic scenarios. Simulation results indicate that the proposed routing algorithm yields an improvement over the recent bufferless routing algorithm in average latency, power consumption, and area overhead by up to 10%, 9%, and 80%, respectively.