### Table 5 All-to-all communication results

"... In PAGE 12: ...51 As computed from measurements using Eq. 2 and shown in Table5 , the performance achieved with the MPI- SHARC design is now comparable and, in some cases, transcends the class of high-performance architectures. The minimum latency of the SHARC measures 15.... ..."

### Table 1. The list of properties searched on the test applications running on the Infini- band Cluster

"... In PAGE 5: ... 5 Application Experiments We used Periscope to analyze applications on the Itanium SMP nodes of the Infiniband Cluster at LRR/TUM. Table1 shows the list of properties which we searched for during our experiments, the threshold set in the condition of the... ..."

### Table 6: Timings for all-to-all broadcasting on a Connection Machine system CM-2.

1991

Cited by 20

### Table 2: All-to-all broadcast algorithm All-to-All Broadcast Algorithm: for each node #28x;y#29 in the network do in parallel for each input and output buffer do in parallel case of an output buffer:

1999

"... In PAGE 7: ... In Table 2, we give a higher level description of the algorithm. In the broadcast algorithm in Table2 , each node is con- tinuously receiving (and sending) messages from (and to) its four neighbors. As mentioned in the previous section, for an easy analysis we logically group the messages into phases such that in phase d the message originated from every node reaches all its d-neighbors.... In PAGE 8: ... Furthermore, we can obtain the following corollaries for a mesh and a torus. Corollary 1 In all-to-all broadcast using the algorithm in Table2 in an n#02n torus, each channel between two adjacent nodes in the network relays n 2,1 4 messages. Proof.... In PAGE 8: ... Similar to the proof for Theorem 3, in phase d #15 1, each node #28x 0;y 0#29 receives C d messages from all its d- neighbors via the channels connected to its four 1-neighbors, with C d 4 messages on each channel. By Lemma 2, we have that the total number of messages through a single channel is 2b n 2 c X d=1 C d 4 = 1 4 0 @ 2b n 2 c X d=0 C d , 1 1 A = n 2 , 1 4 Corollary 2 In all-to-all broadcast using the algorithm in Table2 in an n#02n mesh, each channel between two adjacent nodes in the network relays at most n 2,1 2 messages. Proof.... ..."

Cited by 3

### Table 3. Situation awareness using all-to-all broadcasting for an urban model with 500,000J initial energy in each node.

2001

Cited by 9

### Table 1. InfiniBand Modification for IAS Category amp;

"... In PAGE 4: ... This will be the first verb call by an attack analyzer to trigger a series of trace-backs. Table1 summarizes all the expected modifications to IBA specification. Table 1.... ..."