Hybrid graph-based networks for multiprocessing

This article summarizes various ways of constructing large interconnection networks by performing different graph operations on smaller networks. The resultant hybrid graphs are classified, their inherent static topological p roperties are outlined and their relative advantages for multiprocessing ap plications are illustrated with several well-known networks. One class of h ybrid graphs defined as compound networks, popularly known by an alternativ e name as hierarchical networks, is observed to be suitable for multicomput ers in the current VLSI/WSI environment, as their use reduces network compl exity, enhances scalability, reliability and fault-tolerance and supports l ocality of reference.