Strictly nonblocking conference networks using high-dimensional meshes

Strictly nonblocking conference networks using high-dimensional meshes
复制标题

使用高维网格的严格无阻塞会议网络

DOI:
10.1002/(sici)1097-0037(199907)33:4
复制
发表时间:
1999
期刊:
影响因子:
2.1
通讯作者:
G. Masson
G. Masson
中科院分区:
计算机科学4区
文献类型:
--
作者:
Yi Du;G. Masson

文献摘要

被引文献

相似文献

介绍了一种基于创新的可配置计算体系结构的会议服务器设计,以支持在N组与会者之间创建和维护同时不相交的会议所涉及的信息传输和分布式处理,其中r维网格可以用作会议组件。如果不考虑所实现的现有会议,可以使用空闲处理单元的连接集合来实现空闲会议的任何子集中的新会议,而不会对现有会议造成任何干扰,则R维会议网状网是严格非阻塞的。利用图中边和结点集大小的等周比引理,我们给出了一个由M个结点组成的r维会议网为N个与会者提供严格无阻塞会议的充要条件。证明了当维度r固定时,r维网格严格非分块的充要条件是MAO(N(r/1)/r)。对于一般的r维网格,M A O(r(R01)/rN(r/1)/r)节点足以支持严格的非阻塞能力。建立了使用某些图结构的N个与会者之间对严格无阻塞会议的M的要求与这些结构的等周比之间的基本关系。问:1999 John Wiley&Sons,Inc.网络33:293-308,1999
This paper introduces a conferencing server design based on an innovative configurable computing architecture to support the information transmission and distributed processing associated with creating and maintaining simultaneous disjoint conferences among sets of N conferees, where r- dimensional meshes can be used as the conferencing components. An r-dimensional conferencing mesh network is strictly nonblocking if, regardless of the existing conferences implemented, a new conference among any subset of the idle conferees can be implemented using a connected set of idle processing elements without any disturbance to the existing conferences. Using arguments employing the isoperimet- ric ratios of the sizes of edge and node sets in a graph, we give necessary and sufficient conditions such that an r-dimensional conferencing mesh of M nodes provides strictly nonblocking conferencing to N conferees. We show that a necessary and sufficient condition for r-dimensional meshes to be strictly nonblocking, when dimension r is fixed, is that M A O(N (r/1)/r ). For general r-dimensional meshes, M A O(r (r01)/r N (r/1)/r ) nodes are sufficient to support strictly nonblocking capabilities. A fundamental relationship is established between the requirements on M for strictly nonblocking conferencing among N conferees using certain graph structures and the isoperimetric ratios for those structures. q 1999 John Wiley & Sons, Inc. Networks 33: 293-308, 1999