期刊
INFORMATION PROCESSING LETTERS
卷 112, 期 14-15, 页码 599-603出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2012.04.013
关键词
Interconnection networks; Graph embedding; Crossed cube; Mesh of trees; Parallel computing
资金
- National Nature Science Foundation of China [61103109, 61003231, 60973120, 60903073]
- Fundamental Research Funds for the Central Universities [ZYGX2011J057]
Crossed cubes are an important class of variants of hypercubes as interconnection topologies in parallel computing. In this paper, we study the embedding of a mesh of trees in the crossed cube. Let n be a multiple of 4 and N = 2((n-2)/2). We prove that an N x N mesh of trees (containing 3N(2) - 2N nodes) can be embedded in an n-dimensional crossed cube (containing 4N(2) nodes) with dilation 1 and expansion about 4/3. This result shows that crossed cubes are promising interconnection networks since mesh of trees enables fast parallel computation. (C) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据