Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

A class of hierarchical graphs as topologies for interconnection networks.

Lai, P.-L. and Hsu, H.-C. and Tsai, C.-H. and Stewart, I. A. (2010) 'A class of hierarchical graphs as topologies for interconnection networks.', Theoretical computer science., 411 (31-33). pp. 2912-2924.

Abstract

We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the hierarchical crossed cube HCC(k,n), which draws upon constructions used within the well-known hypercube and also the crossed cube. In particular, we study: the construction of shortest paths between arbitrary vertices in HCC(k,n); the connectivity of HCC(k,n); and one-to-all broadcasts in parallel machines whose underlying topology is HCC(k,n) (with both one-port and multi-port store-and-forward models of communication). Moreover, (some of) our proofs are applicable not just to hierarchical crossed cubes but to hierarchical interconnection networks formed by replacing crossed cubes with other families of interconnection networks. As such, we provide a generic construction with accompanying generic results relating to some topological and algorithmic properties of a wide range of hierarchical interconnection networks.

Item Type:Article
Keywords:Interconnection networks, Hierarchical interconnection networks, Crossed cubes.
Full text:PDF - Accepted Version (221Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1016/j.tcs.2010.04.022
Record Created:12 Apr 2010 09:50
Last Modified:02 Jun 2010 11:50

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library