### Table 1: Costs of communication primitives on the hypercube computer.

1995

"... In PAGE 10: ...themselves. Table1 shows the communication costs of these primitives on the hypercube computer. The parameter m denotes the message size in words, seq is a sequence of identi ers representing the processors in various dimensions over which the collective communication primitive is carried out.... In PAGE 29: ... It is clear that the pipelined version program runs faster than the program using broadcast operations. (a) matrix size 29 29 block size #PE = 2 #PE = 4 #PE = 8 #PE = 16 #PE = 32 21 21 226 (222) 117 (118) 63 (68) 35 (46) 22 (36) 22 22 134 (134) 69 (70) 36 (39) 20 (24) 12 (17) 23 23 104 (105) 54 (56) 28 (31) 15 (19) 10 (13) 24 24 92 (95) 48 (51) 27 (31) 15 (20) 9 (13) 25 25 88 (92) 48 (54) 28 (34) 17 (24) ** (b) matrix size 210 210 block size #PE = 2 #PE = 4 #PE = 8 #PE = 16 #PE = 32 21 21 1767 (1744) 900 (898) 466 (485) 250 (286) 141 (194) 22 22 1061 (1058) 537 (542) 276 (285) 144 (159) 79 (99) 23 23 824 (826) 418 (424) 214 (224) 113 (124) 63 (75) 24 24 726 (733) 372 (384) 195 (209) 105 (122) 59 (78) 25 25 686 (701) 359 (381) 195 (222) 111 (140) 65 (95) Table1 0: The simulation time (in units of seconds) of running a Gauss elimination algorithm for linear systems. The data that are not in parentheses are obtained from a pipelined version algorithm; the data that are in parentheses are obtained from an algorithm using broadcast operations.... ..."

Cited by 2

### Table 1: Comparison of Composite Hypercubes and Hypercubes.

"... In PAGE 5: ... Combining this with the observation that the CH(m) is a bipartite graph, all the other properties of CH(m) follow immediately. We tabulate these properties in Table1 . In order to compare these properties with the ones of the hypercube, we also list the properties of the hypercube Qdlogme in the same table.... ..."

### Table 1: Cost models of skeletons for the linear array topology.

1999

"... In PAGE 15: ... However, for the growing version the size of the emerging result grows by an amount equal to the size of each list element. Linear Array: Table1 summarises the cost models of the skeletons for the linear array topol- ogy. Hypercube: Table 4 outlines the cost models of the skeletons for the hypercube topology.... ..."

Cited by 1

### Table II. Hypercube instances

2001

Cited by 5

### Table 1: Hypercube instances

2001

Cited by 5

### Table 2.3 summarizes the complexity of different word-level decision diagrams to represent the integer functions and operations such as X, X + Y , X #03 Y , X 2 and 2X . Note that *BMDs and K*BMDs have more compact representations than others.

1998

Cited by 6

### Table 2.3 summarizes the complexity of different word-level decision diagrams to represent the integer functions and operations such as X, X + Y , X Y , X2 and 2X. Note that *BMDs and K*BMDs have more compact representations than others.

### Table 3. Mesg. requirements in hypercubes

in Fault-Tolerant Clock Synchronization of Large Multicomputers via Multistep Interactive Convergence

1996

"... In PAGE 9: ... In this case, clock values can be conveyed along node-disjoint paths whose length is at most d(log2 N)=2e+2. Table3 compares 2-ICV with TCID ICV from the viewpoint of number of messages and maximum path length, for hypercubes of various sizes.... ..."

Cited by 1

### Table 8: E ective bandwidth per PN of di erent hypercube embeddings for CMMD V 1.3.1 (unit = MB/s)

1992

"... In PAGE 19: ... Table8 ). A semi-linear scheme (see Figure 9) involves swapping one processing node in each group of 4 nodes with another processing node in a neighboring group of 4 (PN3 $ Vertex4, PN4 $ Vertex3).... ..."

Cited by 25