Mapping interconnection networks into VEDIC networks

Author

Chaudhary, Vipin ; Sabata, Bikash ; Aggarwal, J.K.

Author_Institution

Wayne State Univ., Detroit, MI, USA

fYear

1993

fDate

13-16 Apr 1993

Firstpage

531

Lastpage

537

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

Keywords

multiprocessor interconnection networks; reconfigurable architectures; Cayley graphs; MIMD; VEDIC networks; binary hypercubes; chordal rings; interconnection networks; k-ary n-cubes; pancake graph; star graph; toroidal meshes; Computer networks; Fault tolerance; Hypercubes; Impedance; Multicast algorithms; Multiprocessor interconnection networks; Network topology; Routing; System recovery; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1993., Proceedings of Seventh International

Conference_Location

Newport, CA

Print_ISBN

0-8186-3442-1

Type

conf

DOI

10.1109/IPPS.1993.262821

Filename

262821

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3486098