An efficent dynamic multicast routing protocol for distributing traffic in NOCs

  • Authors:
  • Masoumeh Ebrahimi;Masoud Daneshtalab;Mohammad Hossein Neishaburi;Siamak Mohammadi;Ali Afzali-Kusha;Juha Plosila;Hannu Tenhunen

  • Affiliations:
  • University of Tehran, Tehran, Iran and University of Turku, Turku, Finland;University of Tehran, Tehran, Iran and University of Turku, Turku, Finland;University of Tehran, Tehran, Iran;University of Tehran, Tehran, Iran;University of Tehran, Tehran, Iran;University of Turku, Turku, Finland;University of Turku, Turku, Finland

  • Venue:
  • Proceedings of the Conference on Design, Automation and Test in Europe
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nowadays, in MPSoCs and NoCs, multicast protocol is significantly used for many parallel applications such as cache coherency in distributed shared-memory architectures, clock synchronization, replication, or barrier synchronization. Among several multicast schemes proposed in on chip interconnection networks, path-based multicast scheme has been proven to be more efficient than the tree-based, and unicast-based. In this paper a low distance path-based multicast scheme is proposed. The proposed method takes advantage of the network partitioning, and utilizing of an efficient destination ordering algorithm. The results in performance, and power consumption show that the proposed method outstands the previous on chip path-based multicasting algorithms.