Mapping of parallel algorithms on symmetric hypernets

Hypercube topology has very nice mapping properties, but hypercube based systems are not easily expandable. To overcome this, Hwang and Ghosh (1987) proposed another topology called hypernets. However, these hypernets do not expand symmetrically and their processing and I/O nodes are not fixed at the time of chip design and have some problems as far as VLSI design is concerned. The symmetric hypernets proposed by the authors in this paper grow symmetrically in small ratios and are better suited for VLSI design. They also establish the suitability of symmetric hypernets vis-a-vis hypercubes and hypernets for mapping parallel algorithms for searching and sorting.<
>