Modified multicast routing algorithm for network-on-chip

ISSN: 22498958
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

Abstract

In this paper, the Multicast Routing (MR) algorithm problem for Networks-on-Chip (NOC) is studied and an efficient routing algorithm is proposed. Here each and every MR step is designed as a Minimum Directed Spanning Tree (MDST) Problem. The MDST capably finds the best routing solutions for multicast flows. Power consumption is one of the major evaluation parameter for routing inside Network-on-Chip (NOC). The power consumption mentioned here includes both leakage power and dynamic switching power. Simulation is performed over several randomized network layouts and the results are compared with conventional PIM-DM. In particular, the proposed algorithm achieves a 24% reduction in power consumption over conventional PIM-DM when the number of computational cores inside a chip is nearly hundred.

Cite

CITATION STYLE

APA

Shoukath Ali, K., Samapth, P., Elango, S., & Philip, S. P. (2018). Modified multicast routing algorithm for network-on-chip. International Journal of Engineering and Advanced Technology, 8(C2C), 87–89.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free