Recursive partitioning multicast: A bandwidth-efficient routing for Networks-on-Chip

  • Authors:
  • Lei Wang; Yuho Jin; Hyungjun Kim;Eun Jung Kim

  • Affiliations:
  • Department of Computer Science and Engineering, Texas A&MUniversity, College Station, 77843 USA;Department of Computer Science and Engineering, Texas A&MUniversity, College Station, 77843 USA;Department of Computer Science and Engineering, Texas A&MUniversity, College Station, 77843 USA;Department of Computer Science and Engineering, Texas A&MUniversity, College Station, 77843 USA

  • Venue:
  • NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Chip Multi-processor (CMP) architectures have become mainstream for designing processors. With a large number of cores, Networks-on-Chip (NOCs) provide a scalable communication method for CMP architectures. NOCs must be carefully designed to meet constraints of power consumption and area, and provide ultra low latencies. Existing NOCs mostly use Dimension Order Routing (DOR) to determine the route taken by a packet in unicast traffic. However, with the development of diverse applications in CMPs, one-to-many (multicast) and one-to-all (broadcast) traffic are becoming more common. Current unicast routing cannot support multicast and broadcast traffic efficiently. In this paper, we propose Recursive Partitioning Multicast (RPM) routing and a detailed multicast wormhole router design for NOCs. RPM allows routers to select intermediate replication nodes based on the global distribution of destination nodes. This provides more path diversities, thus achieves more bandwidth-efficiency and finally improves the performance of the whole network. Our simulation results using a detailed cycle-accurate simulator show that compared with the most recent multicast scheme, RPM saves 25% of crossbar and link power, and 33% of link utilization with 50% network performance improvement. Also RPM is more scalable to large networks than the recently proposed VCTM.