Special Issue: Node-to-Node Distances in Regulard-Neighbours Topologies
Roman Trobec, Uroš Jovanovič · International Journal of Parallel Emergent and Distributed Systems · 2003
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.