All-To-All Broadcast in Hexagonal Torus Networks On-Chip

Abstract

Hexagonal torus networks are special family of Eisenstein-Jacobi (EJ) Networks which have gained 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. All-to-all broadcast is a collective communication algorithm used frequently in some parallel applications. Recently, an off-chip all-to-all broadcast algorithm has been proposed for hexagonal 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 24k 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 36k 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.

An Improved One-to-All Broadcasting in Higher Dimensional Eisenstein-Jacobi Networks

“…For instance, the problems related to image processing and computer vision [2,3,4,5,6,7,27] are solved based on the implementation of parallel algorithms. Furthermore, some studies on one-to-all and all-to-all broadcasting can be found in [15,21,26]. In one-to-all broadcasting, a source node sends its message to every other node in the network.…”