Hierarchical Hypernet for Pipelining

The paper proposes a new hierarchical hypernet which is an extension of hypernet suggested by Hwang and Ghosh. The hypernet is generalised for any value ofG = 2* for 0 < x <</— 2 where d is the dimension of the basic hyper cube. The mathematical formulas for the network parameters are developed as a function ofG. The hier (d,h,G) hypernet consists of(d,l,G), (d,2,G), (d,3,G), (d,h — l,G), (d,h,G) hypernets connected in top down fashion, in h physical levels. The general methodology to construct hierarchical hypernet is explained. The relationship between network parameters of hierarchical hypernets and hypernets suggested earlier is developed. Some algorithms are mapped onto hierarchical hypernets to illustrate their ability to support parallel processing in a hierarchical structured or data dependent environment. The hierarchical hypernets are suitable for pipelining and hence the speed up achieved in various algorithms is illustrated using space time diagrams. The advantage with these networks is that they do not require reservation of one subnetwork in each recursive level to emulate the next higher level for pipelining.