Mapping Interconnection Networks into VEDIC Networks

We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, kary 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.

• Type: Conference
• Year: 1993
• Where: IPPS
• Authors: Vipin Chaudhary, Bikash Sabata, Jake K. Aggarwal
• Keywords: Distributed And Parallel Computing, Interconnection Networks, IPPS 1993, Toroidal Meshes, Vedic Network