Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Networking and Internet Architecture

arXiv:2108.00566 (cs)
[Submitted on 1 Aug 2021]

Title:Efficient On-Chip Multicast Routing based on Dynamic Partition Merging

Authors:Binayak Tiwari, Mei Yang, Yingtao Jiang, Xiaohang Wang
View PDF
Abstract:Networks-on-chips (NoCs) have become the mainstream communication infrastructure for chip multiprocessors (CMPs) and many-core systems. The commonly used parallel applications and emerging machine learning-based applications involve a significant amount of collective communication patterns. In CMP applications, multicast is widely used in multithreaded programs and protocols for barrier/clock synchronization and cache coherence. Multicast routing plays an important role on the system performance of a CMP. Existing partition-based multicast routing algorithms all use static destination set partition strategy which lacks the global view of path optimization. In this paper, we propose an efficient Dynamic Partition Merging (DPM)-based multicast routing algorithm. The proposed algorithm divides the multicast destination set into partitions dynamically by comparing the routing cost of different partition merging options and selecting the merged partitions with lower cost. The simulation results of synthetic traffic and PARSEC benchmark applications confirm that the proposed algorithm outperforms the existing path-based routing algorithms. The proposed algorithm is able to improve up to 23\% in average packet latency and 14\% in power consumption against the existing multipath routing algorithm when tested in PARSEC benchmark workloads.
Comments: Presented at 28th Euromicro International Conference on Parallel, Distributed and Network-based Preocessing
Subjects: Networking and Internet Architecture (cs.NI); Hardware Architecture (cs.AR); Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:2108.00566 [cs.NI]
  (or arXiv:2108.00566v1 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2108.00566

Submission history

From: Binayak Tiwari [view email]
[v1] Sun, 1 Aug 2021 23:40:57 UTC (628 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2021-08
Change to browse by:
cs
cs.AR
cs.DC

References & Citations

DBLP - CS Bibliography

listing | bibtex
Mei Yang
Yingtao Jiang
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)