ON SOME PROPERTIES AND ALGORITHMS FOR THE STAR AND PANCAKE INTERCONNECTION NETWORKS

被引：42

作者：

KE, Q

AKL, SG

MEIJER, H

机构：

[1] Department of Computing and Information Science, Queen’s University, Kingston, ON

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1994年 / 22卷 / 01期

关键词：

D O I：

10.1006/jpdc.1994.1066

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The star and pancake networks were proposed recently as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present a number of results in connection with these two networks. In particular, we examine their graph theoretic properties and derive algorithms for solving several problems on them. (C) 1994 Academic Press, Inc.

引用

页码：16 / 25

页数：10

共 32 条

[1]

Akers S. B., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P393

[2] A GROUP-THEORETIC MODEL FOR SYMMETRIC INTERCONNECTION NETWORKS [J].

AKERS, SB ;

KRISHNAMURTHY, B .

IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (04) :555-566

[3]

AKERS SB, 1987, 2ND P INT C SUP, V3, P270

[4]

AKL SG, 1992, LECT NOTES COMPUT SC, V634, P565

[5]

AKL SG, 1991, 3RD P IEEE S PAR DIS, P415

[6]

AKL SG, 1990, 9022 EC NORM SUP LYO

[7]

AKL SG, 1992, 4TH P CAN C COMP GEO, P353

[8]

BAGHERZADEH N, 1992, ROUTING BROADCASTING

[9]

BERTHOME P, 1992, LIP9238 EC NORM SUP

[10]

FRAGOPOULOU P, 1991, P INT C PARALLEL PRO, V3, P100

← 1 2 3 4 →