Exploring partitioning methods for 3D Networks-on-Chip utilizing adaptive routing model

  • Authors:
  • Masoumeh Ebrahimi;Masoud Daneshtalab;Pasi Liljeberg;Juha Plosila;Hannu Tenhunen

  • Affiliations:
  • University of Turku, Joukahaisenkatu, Turku, Finland;University of Turku, Joukahaisenkatu, Turku, Finland;University of Turku, Joukahaisenkatu, Turku, Finland;University of Turku, Joukahaisenkatu, Turku, Finland;University of Turku, Joukahaisenkatu, Turku, Finland

  • Venue:
  • NOCS '11 Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Three-Dimensional (3D) integration is a solution to the interconnect bottleneck in Two-Dimensional (2D) MultiProcessor System on Chip (MPSoC). 3D IC design improves performance and decreases power consumption by replacing long horizontal interconnects with shorter vertical ones. As the multicast communication is utilized commonly in various parallel applications, the performance can be significantly improved by supporting of multicast operations at the hardware level. In this paper, we propose a set of partitioning approaches each with a different level of efficiency. In addition, we present an advantageous method named Recursive Partitioning (RP) in which the network is recursively partitioned until all partitions contain comparable number of nodes. By this approach, the multicast traffic is distributed among several subsets and the network latency is considerably decreased. We also present Minimal Adaptive Routing (MAR) algorithm for the unicast and multicast traffic in 3D-mesh Networks-on-Chip (NoCs). The idea behind the MAR algorithm is utilizing the Hamiltonian path to provide a set of alternative paths.