DocumentCode
3348472
Title
A new class of interconnection networks based on alternating group
Author
Jwo, Jung-Sing ; Lakshmivarahan, S. ; Dhall, S.K.
Author_Institution
Dept. of Inf. Sci., Providence Univ., Shalu, Taiwan
fYear
1992
fDate
1-4 Dec 1992
Firstpage
483
Lastpage
486
Abstract
The authors present an analysis of a new class of interconnection scheme based on the Cayley graph of the alternating group. The definition and an analysis of the symmetry of this class of graphs are presented, and a shortest-path routing algorithm is given. An algorithm for embedding of the Hamiltonian cycle is presented, and an algorithm for embedding grids is given. A greedy spanning tree algorithm for one source broadcasting and an analysis of the contention problem are also given
Keywords
multiprocessor interconnection networks; tree data structures; Cayley graph; Hamiltonian cycle; alternating group; contention problem; embedding; greedy spanning tree algorithm; interconnection networks; one source broadcasting; shortest-path routing algorithm; Algorithm design and analysis; Broadcasting; Computer networks; Concurrent computing; Hypercubes; Information analysis; Information science; Multiprocessor interconnection networks; Routing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location
Arlington, TX
Print_ISBN
0-8186-3200-3
Type
conf
DOI
10.1109/SPDP.1992.242706
Filename
242706
Link To Document