Mapping interconnection networks into VEDIC networks

Abstract

The authors show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDIC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, k-ary n-cubes, and Cayley graphs-star graph and pancake graph, as VEDIC networks. Using these parameters the VEDIC network can be used as a tool for generating currently known and new interconnection networks.<>