Packetization and routing analysis of on-chip multiprocessor networks

  • Authors:
  • Terry Tao Ye;Luca Benini;Giovanni De Micheli

  • Affiliations:
  • Computer Systems Lab, Stanford University, Gates 334, Stanford, CA;DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy;Computer Systems Lab, Stanford University, Gates 333, Stanford, CA

  • Venue:
  • Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Networks on chip
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some current and most future systems-on-chips use and will use network architectures/protocols to implement on-chip communication. On-chip networks borrow features and design methods from those used in parallel computing clusters and computer system area networks. They differ from traditional networks because of larger on-chip wiring resources and flexibility, as well as constraints on area and energy consumption (in addition to performance requirements). In this paper, we analyze different routing schemes for packetized on-chip communication on a mesh network architecture, with particular emphasis on specific benefits and limitations of silicon VLSI implementations. A contention-look-ahead on-chip routing scheme is proposed. It reduces the network delay with significantly smaller buffer requirement. We further show that in the on-chip multiprocessor systems, both the instruction execution inside node processors, as well as data transaction between different processing elements, are greatly affected by the packetized dataflows that are transported on the on-chip networks. Different packetization schemes affect the performance and power consumption of multiprocessor systems. Our analysis is also quantified by the network/multiprocessor co-simulation benchmark results.