• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Cyclic-cubes: a new family of interconnection networks of even fixed-degrees
【24h】

Cyclic-cubes: a new family of interconnection networks of even fixed-degrees

机译：循环立方体：甚至固定度数的互连网络新家族

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We introduce a new family of interconnection networks that are Cayley graphs with fixed degrees of any even number greater than or equal to four. We call the proposed graphs cyclic-cubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cyclic-cube can have a diameter smaller than previously known fixed-degree networks. The proposed graphs can adopt an optimum routing algorithm known for one of its subfamilies of Cayley graphs. We also show that a graph in the new family has a Hamiltonian cycle and, hence, there is an embedding of a ring. Embedding of meshes and hypercubes are also discussed.
机译：我们引入了一个新的互连网络系列，它们是Cayley图，具有固定偶数个大于或等于4的固定度。我们将提出的图称为循环立方体，因为收缩此类图中的某些循环会导致广义超立方体。这些Cayley图具有最佳的容错性和对数直径。对于相当数量的节点，循环立方体的直径可以小于以前已知的固定度网络。提出的图可以采用针对其Cayley图的子族之一已知的最佳路由算法。我们还表明，新族中的图具有哈密顿循环，因此存在环的嵌入。还讨论了网格和超立方体的嵌入。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号