Show simple item record

dc.contributor.authorZhao, Li
dc.date.accessioned2014-03-24T13:56:34Z
dc.date.available2014-03-24T13:56:34Z
dc.date.issued2014-03-24
dc.identifier.urihttp://hdl.handle.net/10464/5273
dc.description.abstractThe KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectAlgorithms, Properties, the KCube Graphsen_US
dc.titleProperties and Algorithms of the KCube Graphsen_US
dc.typeElectronic Thesis or Dissertationen_US
dc.degree.nameM.Sc. Computer Scienceen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US
dc.embargo.termsNoneen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record