Abstract
Hexagonal torus networks are special family of Eisenstein-Jacobi (EJ) networks which have gained popularity as goodcandidates 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. All-to-all broadcast is a collective communicationalgorithm used frequently in some parallel applications. Recently, an off-chip all-to-all broadcast algorithm has been proposed forhexagonal torus networks assuming half-duplex links and all-ports communication. The proposed all-to-all broadcast algorithm does not achieve the minimum transmission time and requires 24 k extra buffers, where k is the network diameter. We first extend this work by proposing an efficient all-to-all broadcast on hexagonal torus networks under full-duplex links and all-ports communications assumptions which achieves the minimum transmission delay but requires 36 k extra buffers per router. In a second stage, we develop a new all-to-all broadcast more suitable for hexagonal torus network on-chip that achieves optimal transmission delay time without requiring any extra buffers per router. By reducing the amount of buffer space, the new all-to-all broadcast reduces the routers cost which is an important issue in NoCs architectures.
Original language | English |
---|---|
Article number | 6881698 |
Pages (from-to) | 2410-2420 |
Number of pages | 11 |
Journal | IEEE Transactions on Parallel and Distributed Systems |
Volume | 26 |
Issue number | 9 |
DOIs | |
Publication status | Published - Sept 1 2015 |
Keywords
- Eisenstein-Jacobi networks
- Network-on-Chip (NoC)
- all-to-all broadcast
- hexagonal mesh
- spanning trees
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics