...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of supercomputing >Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes
【24h】

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

机译：扩张，WireLength和Edge拥塞的下限将图形嵌入图形到超速

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

摘要

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential for parallel computation of various algorithms, and the high degree of fault tolerance. Thus it becomes the first choice of topological structure of parallel processing and computing systems. In this paper, lower bounds for the dilation, wirelength, and edge congestion of an embedding of a graph into a hypercube are proved. Two of these bounds are expressed in terms of the bisection width. Applying these results, the dilation and wirelength of embedding of certain complete multipartite graphs, folded hypercubes, wheels, and specific Cartesian products are computed.
机译：互连网络提供了一种用于在并行计算系统中交换处理器之间的数据的有效机制。其中一个最有效的互连网络是由于其结构规律性，各种算法的并行计算的潜力以及高度的容错程度。因此，它成为并行处理和计算系统的拓扑结构的首选。在本文中，证明了扩张，线程和边缘拥塞的下界，将图形嵌入到超立方体中。这些界限中的两个以平坦宽度表示。应用这些结果，嵌入某些完整的多级图形，折叠的超机，车轮和特定笛卡尔产品的嵌入的扩张和Wirel长。

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号