期刊
INFORMATION PROCESSING LETTERS
卷 110, 期 14-15, 页码 559-564出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2010.04.007
关键词
Interconnection networks; Crossed cube; Graph embedding; Mesh; Torus; Fault-tolerance
资金
- National Nature Science Foundation of China [10771227]
- NNSFC [90818028]
- Program for New Century Excellent Talents of Educational Ministry of China [NCET-05-0759]
The crossed cube is an important variant of the hypercube which is the most popular interconnection network for parallel processing. This paper is concerned with the problem of embedding meshes/tori in faulty crossed cubes. We reduce this mesh/tori embedding problem to the problem of embedding paths/cycles in faulty crossed cubes. Then, by exploiting the fault-tolerant pancyclicity of crossed cubes of lower dimension, several schemes for embedding 2D or 3D meshes/tori in faulty crossed cubes are proposed. All of these embeddings have small dilations and small congestions. The obtained results show that the parallel algorithms with mesh/torus task graphs can be efficiently executed on faulty crossed cubes. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据