Abstract
Gaussian networks are gaining popularity as good candidates Network On-Chip (NoC) for interconnecting Multiprocessor System-on-Chips (MPSoCs). They showed better topological properties compared to the 2D torus networks with the same number of nodes N and the same degree 4. All-to-all broadcast is a collective communication algorithm used frequently in many parallel applications. Recently, Z. Zhang et al. [1] have proposed an all-to-all broadcast algorithm for Gaussian on-chip networks that achieves the minimum delay time but requires 4k extra buffers per router, where k is the network diameter. In this paper, we propose a new all-to-all broadcast algorithm for dense Gaussian on-chip networks that achieves the minimum delay time without requiring any extra buffers per router. In this paper, we propose a new all-to-all broadcast algorithm for dense Gaussian on-chip networks that achieves the minimum delay time without requiring any extra buffers per router. Along with low latency, reducing the amount of buffer space and power consumption are very important issues in NoCs architectures.
Original language | English |
---|---|
Article number | 6787056 |
Pages (from-to) | 1085-1095 |
Number of pages | 11 |
Journal | IEEE Transactions on Parallel and Distributed Systems |
Volume | 26 |
Issue number | 4 |
DOIs | |
Publication status | Published - Apr 1 2015 |
Keywords
- Gaussian networks
- Network-on-Chip (NoC)
- all-to-all broadcasting
- spanning trees
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics