Communication algorithms in k-ary n-cube interconnection networks

被引：13
作者：
Ashir, Y
Stewart, IA
Ahmed, A
机构：
[1] UNIV LEICESTER,DEPT MATH & COMP SCI,LEICESTER LE1 7RH,LEICS,ENGLAND
[2] UNIV BAHRAIN,DEPT COMP SCI,MANAMA,BAHRAIN
来源：
INFORMATION PROCESSING LETTERS | 1997年 / 61卷 / 01期
关键词：
interconnection networks; parallel processing; k-ary n-cubes; communication algorithms;
D O I：
10.1016/S0020-0190(96)00188-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider several communication algorithms in the k-ary n-cube interconnection network; in particular, we develop and analyse routing, multi-node broadcasting, single-node scattering and total exchange algorithms, All of our algorithms are optimal if we assume one-port I/O communication.
引用
收藏
页码：43 / 48
页数：6
相关论文
共 17 条
[1]  
ASHIR Y, 1996, EMBEDDING CYCLES K A
[2]   OPTIMAL COMMUNICATION ALGORITHMS FOR HYPERCUBES [J].
BERTSEKAS, DP ;
OZVEREN, C ;
STAMOULIS, GD ;
TSENG, P ;
TSITSIKLIS, JN .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 11 (04) :263-275
[3]  
BHUYAN LN, 1984, IEEE T COMPUT, V33, P323, DOI 10.1109/TC.1984.1676437
[4]  
Borkar S., 1988, Proceedings. Supercomputing '88 (IEEE Cat. No.88CH2617-9), P330, DOI 10.1109/SUPERC.1988.44670
[5]   LEE DISTANCE AND TOPOLOGICAL PROPERTIES OF K-ARY N-CUBES [J].
BOSE, B ;
BROEG, B ;
KWON, Y ;
ASHIR, Y .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (08) :1021-1030
[6]  
BROEG RB, 1995, THESIS OREGON STATE
[7]  
DALLY WJ, 1987, IEEE T COMPUT, V36, P547, DOI 10.1109/TC.1987.1676939
[8]   PERFORMANCE ANALYSIS OF K-ARY N-CUBE INTERCONNECTION NETWORKS [J].
DALLY, WJ .
IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (06) :775-785
[9]   COMPLEXITY ANALYSIS OF BROADCASTING IN HYPERCUBES WITH RESTRICTED COMMUNICATION CAPABILITIES [J].
FRAIGNIAUD, P .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 16 (01) :15-26
[10]   OPTIMUM BROADCASTING AND PERSONALIZED COMMUNICATION IN HYPERCUBES [J].
JOHNSSON, SL ;
HO, CT .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (09) :1249-1268
12