• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete optimization >Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
【24h】

Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees

机译：将超立方体和折叠超立方体嵌入到某些树的笛卡尔积上

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

摘要

The hypercube network is one of the most popular interconnection networks since it has simple structure and is easy to implement. The folded hypercube is an important variation of the hypercube. Interconnection networks play a major role in the performance of distributed memory multiprocessors and the one primary concern for choosing an appropriate interconnection network is the graph embedding ability. A graph embedding of a guest graph G into a host graph H is an injective map on the vertices such that each edge of G is mapped into a path of H. The wirelength of this embedding is defined to be the sum of the lengths of the paths corresponding to the edges of G. In this paper we embed hypercube and folded hypercube onto Cartesian product of trees such as 1-rooted complete binary tree and path, sibling tree and path to minimize the wirelength. (C) 2015 Elsevier B.V. All rights reserved.
机译：超立方体网络是最流行的互连网络之一，因为它具有简单的结构并且易于实现。折叠的超立方体是超立方体的重要变体。互连网络在分布式内存多处理器的性能中起主要作用，而选择合适的互连网络的主要考虑因素是图形嵌入能力。将来宾图G嵌入到主图H中的图是顶点上的内射图，因此G的每个边都映射到H的路径中。此嵌入的线长定义为图G的长度之和。在本文中，我们将超立方体嵌入超立方体，并将超立方体折叠到树的笛卡尔积上，例如1根完整二叉树和路径，同级树和路径，以最小化线长。 （C）2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号