Title :
Embedding meshes on the star graph
Author :
Ranka, Sanjay ; Wang, Jhychun ; Yeh, Nangkang
Author_Institution :
Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
Abstract :
Algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3 are developed. It is shown that an n-degree star graph can efficiently simulate an n-dimensional mesh. The analysis indicates that the algorithms developed for uniform meshes may not be efficiently simulated on the star graph
Keywords :
graph theory; parallel algorithms; embedding meshes; meshes; star graph; Computational modeling; Data structures; Fault tolerance; Head; Hypercubes; Information science; Multiprocessor interconnection networks; Numerical analysis; Parallel processing; Sorting;
Conference_Titel :
Supercomputing '90., Proceedings of
Conference_Location :
New York, NY
Print_ISBN :
0-8186-2056-0
DOI :
10.1109/SUPERC.1990.130058
