Show simple item record

dc.contributor.authorZhang, Fan.en_US
dc.date.accessioned2010-03-09T20:23:03Z
dc.date.available2010-03-09T20:23:03Z
dc.date.issued2010-03-09T20:23:03Z
dc.identifier.urihttp://hdl.handle.net/10464/2951
dc.description.abstractThe hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectComputer networks.en_US
dc.subjectMultiprocessors.en_US
dc.subjectComputer algorithms.en_US
dc.titleProperties and algorithms of the hyper-star graph and its related 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
refterms.dateFOA2021-08-07T02:23:51Z


Files in this item

Thumbnail
Name:
Brock_Zhang_Fan_2010.pdf
Size:
742.2Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record