A Novel Interconnection Network with Improved Network Cost Through Shuffle-Exchange Permutation Graph

Abstract

The interconnection network represents an interconnected structure of processors that strongly determines the performance quality of a parallel processing system. The shuffle-exchange permutation (SEP) network with three degrees has high fault tolerance and can be efficiently simulated through star, bubble-sort, and pancake graphs. This study proposes a new interconnection network: the new SEP (NSEP), which improves the diameter and reduces network cost by adding one edge to the SEP network, and presents its graph properties and routing algorithms. The NSEP network, with a degree of connectivity of four, demonstrated maximum fault tolerance and Hamiltonian cycle. Furthermore, the diameter was seen to be improved by 40% or more and the network cost by 20% or more.