Special Issue: Node-to-Node Distances in Regular d-Neighbours Topologies

The comparison of maximal and average node-to-node distances in recently introduced d-meshes, popular k-ary n-cubes, and more theoretical but in some cases near optimal permutation graphs is presented in this paper. The d-meshes are an extended family of two-dimensional regular meshes of an arbitrar...

Full description

Saved in:
Bibliographic Details
Published inParallel algorithms and applications Vol. 18; no. 1-2; pp. 91 - 98
Main Authors Trobec, Roman, Jovanovič, Uroš
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.05.2003
Subjects
Arrangement graph
mesh, -ary -cube
Node-to-node distance
Regular topology
Online AccessGet full text

Cover

More Information
Summary:The comparison of maximal and average node-to-node distances in recently introduced d-meshes, popular k-ary n-cubes, and more theoretical but in some cases near optimal permutation graphs is presented in this paper. The d-meshes are an extended family of two-dimensional regular meshes of an arbitrary degree d. They have the shortest maximal and average node-to-node distances, can be expanded in finer steps than both other topologies, and finally, d-meshes can be implemented on parallel planes carrying only parallel links.
ISSN:1063-7192
DOI:10.1080/1063719031000087987