1 Saad Y, Schultz M H. Topological properties of hypercubes. IEEE Trans. Comput, 1988, 37(7);867 ~ 872
[2]
2陈国良.并行算法的设计与分析.北京:高等教育出版计,1994
[3]
3李腊元。计算机局域网络理论及技术.北京;国防工业出版社,1997
[4]
4 Esfahanian A H, Ni L M, Sagan B E. The twisted n-cube with application to multiprocessing. IEEETrans. Comput, 1991. 40(1); 88--93
[5]
5 Tzeng N F, Wei S. Enhanced hypercebcs. IEEE: Trans. Comput, 1991, 40(3): 284-294
[6]
6 Aggaawal A. Optimal bounds for finding maximum on array of processors with k global buses. IEEETrans. Comput 1986, 35(1). 62-64
[7]
7 Ishjkawa T. Hypercube multiprocessors with bus connections for improving commutiication Performance.IEEE Trans. Comput, 1988, 44(11). 1338-1344
[8]
8 Esfahanian A H. Genealized measures of fault-tolerance to m-cube network. IEEE Trans. Comput,1988, 38(11): 1586~ 1591
[9]
9 Raghavendra C S, Yang P J,Tien S B. Free dimensions-an effective approach to achieving faulttolerance in hypercubes. IEEE Trans. Comput 1988, 44(9). 1152- 1157
[10]
10 Gu Q P, Peng S. A efficient algorithm for node-to-node routing in hypercubes with faulty clusters.The Computer Journal, 1996, 39(1):14-20
[11]
11 Gu Q P, Peng S. Optimal algorithms node-to-node fault tolerant routing in hypercubes. TheComputer Journal, 1996, 39(7). 626-629
[12]
12 Tien S B, Raghavendra C S. Algorithms and bounds for shortest paths and diameter in faultyhypereubes. IEEE Trans. Parallel and lust. Syst. 1993, 4(6); 713-718
