|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