Stewart, I.A. (2014) 'Interconnection networks of degree three obtained by pruning two-dimensional tori.', IEEE transactions on computers., 63 (10). pp. 2473-9340.
We study an interconnection network that we call 3Torus(m,n) obtained by pruning the 4m x 4n torus (of links) so that the resulting network is regular of degree 3. We show that 3Torus(m,n) retains many of the useful properties of tori (although, of course, there is a price to be paid due to the reduction in links). In particular: we show that 3Torus(m,n) is node-symmetric; we establish closed-form expressions on the the length of a shortest path joining any two nodes of the network; we calculate the diameter precisely; we obtain an upper bound on the average inter-node distance; we develop an optimal distributed routing algorithm; we prove that 3Torus(m,n) has connectivity 3 and is Hamiltonian; we obtain a precise expression for (an upper bound on) the wide-diameter; and we derive optimal one-to-all broadcast and personalized one-to-all broadcast algorithms under both a one-port and all-port communication model. We also undertake a preliminary performance evaluation of our routing algorithm. In summary, we find that 3Torus(m,n) compares very favourably with tori.
|Keywords:||Interconnection network, Torus, Degree 3, Shortest paths, Routing, Broadcasting.|
|Full text:||(AM) Accepted Manuscript|
Download PDF (398Kb)
|Publisher Web site:||http://dx.doi.org/10.1109/TC.2013.139|
|Publisher statement:||© 2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Date accepted:||22 June 2013|
|Date deposited:||28 January 2014|
|Date of first online publication:||01 July 2013|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|