ON THE GENERALIZED TWISTED CUBE

被引：31

作者：

CHEDID, FB

机构：

[1] Faculty of Computer Science, Temple University Japan, Hachioji-shi, Tokyo, 192-03

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 55卷 / 01期

关键词：

PARALLEL PROCESSING; HYPERCUBES; MESHES OF TREES;

D O I：

10.1016/0020-0190(95)00054-G

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The generalized twisted cube GQ(n), a variation on hypercubes (Q(n)) with smaller diameter, was introduced in [1]. In [1], we claimed that the complete binary tree on 2(n) - 1 nodes (T-n), which is not a subgraph of the Q(n), is a subgraph of the GQ(n). The proof which appeared in [1] is incorrect. This note is intended to (1) support that claim and (2) present an efficient dilation 1 embedding of the N X N mesh of trees, a very powerful network for parallel computation, in the 4N(2) - node GQ.

引用

页码：49 / 52

页数：4