Relationships among popular interconnection Networks
 |
|
Описание:
Star generated graphs were proposed as an attractive alternative to hypercubes for massive parallel computing in early 1980s, due to sublogarithmic regularity and diameter. However, star graphs suffer from n! vertices. As the gaps between (n-1)! and n! grow too fast to be considered for practical implementation. (n,k)-Arrangement graphs and (n,k)-Star graphs were proposed as a remedy for n! problem. Star graphs are one extreme case in a general class of Cayley graphs generated by transposition trees. This work generalizes Cayley graphs generated by transposition trees to a class that contains both (n,k)-Arrangement graphs and (n,k)-Star graphs as special cases. Moreover connectivity properties, decomposition methods, relationships among different classes of interconnection networks and local orientation rules are derived. Finally, even more general and flexible class of interconnection networks is introduced.Похожие книги
 | Combinatorial Algorithms : An Update (CBMS-NSF Regional Conference Series in Applied Mathematics) Автор: Herbert S. Wilf Год: 1987 |
 | On Drawing Trees and Nature: A Classic Victorian Manual (Dover Books on Art Instruction) Автор: J. D. Harding Год: 2005 |
 | Effects of Human Disturbance on Tropical Montane Epiphyte Assemblages Автор: Florian A. Werner Год: 2010 |
 | Christmas Tree Production Год: 2011 |
 | Phylogenetic Trees Made Easy: A How-To Manual, Second Edition Автор: Barry G. Hall Год: 2004 |