Properties and algorithms of the (n, k)-star graphs
dc.contributor.author | He, Liang. | en_US |
dc.date.accessioned | 2010-01-28T15:55:27Z | |
dc.date.available | 2010-01-28T15:55:27Z | |
dc.date.issued | 2009-01-28T15:55:27Z | |
dc.identifier.uri | http://hdl.handle.net/10464/2870 | |
dc.description.abstract | The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Brock University | en_US |
dc.subject | Computer networks. | en_US |
dc.subject | Multiprocessors. | en_US |
dc.subject | Computer algorithms. | en_US |
dc.title | Properties and algorithms of the (n, k)-star graphs | en_US |
dc.type | Electronic Thesis or Dissertation | en |
dc.degree.name | M.Sc. Computer Science | en_US |
dc.degree.level | Masters | en_US |
dc.contributor.department | Department of Computer Science | en_US |
dc.degree.discipline | Faculty of Mathematics and Science | en_US |
refterms.dateFOA | 2021-07-30T01:50:20Z |