Title :
Fully normal algorithms for incomplete hypercubes
Author :
Prabhala, Venkata K. ; Sherwani, Naveed A.
Author_Institution :
Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA
fDate :
30 Apr-2 May 1991
Abstract :
The paper shows that composite and incomplete hypercubes are algorithmically equivalent. It develops a class of algorithms called fully normal algorithms for incomplete hypercubes with applications in several important fields. Finally it shows that incomplete hypercubes achieve close to linear speedup for FNA over a wide range of the size of the architecture
Keywords :
hypercube networks; parallel algorithms; composite hypercubes; fully normal algorithms; incomplete hypercubes; Application software; Binary trees; Computer architecture; Computer science; Costs; Hypercubes; Parallel machines; Routing; Tree graphs; Very large scale integration;
Conference_Titel :
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location :
Anaheim, CA
Print_ISBN :
0-8186-9167-0
DOI :
10.1109/IPPS.1991.153770
