On some combinatorial properties of meshes

On some combinatorial properties of meshes
复制标题

关于网格的一些组合性质

DOI:
10.1109/ispan.2004.1300468
复制
发表时间:
2004
期刊:
7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.
影响因子:
--
通讯作者:
H. Sarbazi
H. Sarbazi
中科院分区:
--
文献类型:
--
作者:
H. Sarbazi

文献摘要

被引文献

相似文献

网状结构已被用作许多实用多计算机的底层拓扑,并且在过去得到了广泛的研究。在本文中,我们研究了网格的一些拓扑特性。特别是,我们研究了查找距给定节点给定距离(表面积)的节点数和距给定节点给定距离(体积)的节点数的问题,并导出了一些计算这些数字的表达式。
The mesh structure has been used as the underlying topology for many practical multicomputers, and has been extensively studied in the past. In this paper, we investigate some topological properties of meshes. In particular, we study the problem of finding the number of nodes located at a given distance from a given node (surface area) and the number of nodes located within a given distance from a given node (volume), and have derived some expressions calculating these numbers.