Show simple item record

dc.contributor.authorNoroozi, Keivan
dc.date.accessioned2016-03-29T14:49:33Z
dc.date.available2016-03-29T14:49:33Z
dc.identifier.urihttp://hdl.handle.net/10464/8912
dc.description.abstractThe KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectParallel Computingen_US
dc.subjectInterconnection Networksen_US
dc.subjectGraph theoryen_US
dc.subjectParallel Processingen_US
dc.titleProperties and Algorithms of the KCube Interconnection Networksen_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


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record