Dual partitioning multicasting for high-performance on-chip networks

Li, Jianhua; Shi, Liang; Xue, Chun Jason; Xu, Yinlong

doi:10.1016/j.jpdc.2013.07.002

Cited by 2 publications

(4 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…North-Last and West-Last turn models are no cycle dependency by forbidding two turns respectively to avoid deadlock. The simulation results in [1] show a significant performance improvement than RPM.…”

Section: Related Workmentioning

confidence: 88%

“…LADPM [1] is a newly proposed multicast routing based on RPM. Similar to RPM, LADPM uses two virtual networks to deal with the deadlock problem, thereby reducing the possibility of misrouting and the latency of RPM.…”

Section: Related Workmentioning

confidence: 99%

“…In this paper, we proposed a new adaptive partition-based multicast routing algorithm without routing table for mesh-based NoCs based on the LADPM scheme proposed in [1]. Although LADPM is a novel and efficient approach to route multicast traffic, it lacks adaptation to traffic load.…”

mentioning

confidence: 99%

“…These schemes generate the path without considering the network congestion information and the buffer state. These routing schemes such as RPM [17] and LADPM [1] lack flexibility.…”

mentioning

confidence: 99%

See 3 more Smart Citations

An adaptive partition-based multicast routing scheme for mesh-based Networks-on-Chip

Wang

Yang

et al. 2016

Computers & Electrical Engineering

View full text Add to dashboard Cite

Network-on-Chips (NoCs) have become the mainstream for Chip Multi-Processors (CMPs) design. Multicast, a one-to-many communication pattern, is widely used in barrier/clock synchronization, multithreading programs and cache coherence protocols for CMPs. Even though several multicast routing algorithms have been proposed for CMPs, few can adaptively deal with heavy traffic loads. With the increase of multicast traffic load, deterministic routing schemes suffer from long latency and low throughput, whereas adaptive routing algorithms can improve the routing performance by providing multiple redundant paths. In this paper, we proposed a novel multicast routing algorithm based on partition to reduce the latency of multicast packets, by finding multiple routing paths and adaptively choosing available output ports based on the size of buffer space in downstream routers. We evaluate our scheme through simulations, and results show that, under various configurations, both latency and energy consumption have been significantly reduced in comparison with recent multicast routing schemes.

show abstract

Section: Related Workmentioning

confidence: 88%

Section: Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

“…These schemes generate the path without considering the network congestion information and the buffer state. These routing schemes such as RPM [17] and LADPM [1] lack flexibility.…”

mentioning

confidence: 99%

See 2 more Smart Citations