DocumentCode
3276564
Title
Embedding of cycles and grids in star graphs
Author
Jwo, Jung-Sing ; Lakshmivarahan, S. ; Dhall, S.K.
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Oklahoma Univ., Norman, OK, USA
fYear
1990
fDate
9-13 Dec 1990
Firstpage
540
Lastpage
547
Abstract
The use of star graphs as a viable interconnection scheme for parallel computers has been examined by a number of authors. An attractive feature of this class of graphs is that it has sublogarithmic diameter and has a great deal of symmetry akin to the binary hypercube. The authors describe a new class of algorithms for embedding Hamiltonian cycle, the set of all even cycles and a variety of two and multi-dimensional grids in a star graph. They derive an algorithm for the ranking and the unranking problem with respect to the Hamiltonian cycle
Keywords
graph theory; graphs; multiprocessor interconnection networks; parallel architectures; Hamiltonian cycle; binary hypercube; embedding; multi-dimensional grids; parallel interconnection; ranking; star graphs; sublogarithmic diameter; unranking; Computer science; Concurrent computing; DH-HEMTs; Data structures; Embedded computing; Hypercubes; Integrated circuit interconnections; Parallel architectures; Parallel processing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2087-0
Type
conf
DOI
10.1109/SPDP.1990.143600
Filename
143600
Link To Document