### Table 1. Wireless Medium Model Large-scale path loss

2005

"... In PAGE 8: ... The external RF interference source is turned on at time 5sec and turned off at time 15sec. The wireless medium instance is generated according to the random model de- scribed in Table1 . The model is typical for indoor indus- trial environments [31][34].... ..."

Cited by 3

### Table 1. Wireless Medium Model Large-scale path loss

2005

"... In PAGE 8: ... The external RF interference source is turned on at time 5sec and turned off at time 15sec. The wireless medium instance is generated according to the random model de- scribed in Table1 . The model is typical for indoor indus- trial environments [31][34].... ..."

Cited by 3

### Table 2: Communication results for simple graphs in the one-port, full-duplex, store-and- forward and constant time model ([8, 9]).

"... In PAGE 7: ... For surveys presenting results for general graphs and for di erent models of communication, we refer the interested reader to [8, 9]. We recall in Table2 some results that will be useful in the following. Let Kn denote the complete graph.... In PAGE 8: ...e ned in Section 2.2. Lemma 2 On the star graph S(n), the broadcasting time veri es: BroadS(n) n + n?1 X k=3 dlog ke : Proof. As noticed in Table2 , in Section 2.2 , the property holds for n 3.... In PAGE 9: ...osS(n) be the gossiping time for the star graph S(n) under the model de ned in Section 2.2. Lemma 3 On the star graph S(n), the gossiping time veri es: GosS(n) 3n 2 ? 2 + n X k=4 dlog ke : Proof. Using Table2 , this lemma is straightforward for n = 3. Assume the proposition holds for n ? 1, n gt; 3.... In PAGE 9: ... Step 2 costs exactly one time unit. Step 3 can be implemented through an optimal gossiping protocol in the complete graph, which costs GosKn = dlog ne + odd(n), as recalled in Table2 . Thus, the recurrence equation of the gossiping algorithm is the following.... In PAGE 17: ... Perform again a gossiping within the columns. The rst and third steps are gossiping on a complete graph Kn?1, thus each such step costs dlog(n ? 1)e + odd(n ? 1) as shown in Table2 . The transposition step only costs one communication step.... ..."

### Table 7: Large Scale Multicast Applications Taxonomy

"... In PAGE 26: ... The classi cation of communications parameters, their type, and their \strictest requirement quot; values for large scale multicast application has been proposed in [8]. Table7 gives a list of... ..."

### Table 2: Packet Duration Times for Full-Duplex Ethernet

2002

"... In PAGE 2: ...annot be transmitted back-to-back. The IEEE specification calls this parameter the interFrameGap. While not defined in terms of bit times, interFrameGap happens to be 96 bit times in duration for 10Mb/s, 100Mb/s, and 1Gb/s Ethernet. Table2 lists the durations (in bit times) for the minimum and maximum packet sizes. From this table we see, for example, that the time from the start of a minimum sized packet to the start of the next packet is 672 bit times.... ..."

Cited by 7

### Table 1. Average number of communicating peers per process in several large-scale appli- cations (Courtesy of J. Vetter, et. al [17])

"... In PAGE 2: ...In fact, research on communication characteristics of parallel programs [17] indicates that not all pairs of MPI processes communicate among each other with equal frequency. Table1 shows the average number of communicating peers per process in some scien- tific applications. The majority of process pairs do not communicate between each other.... ..."

### Table 1: Comparison of interconnection networks, assuming full-duplex bidirectional data channels.

"... In PAGE 3: ... Figure 1 shows examples of 2-D HOW systems. Table1 compares the numbers of channels in the binary hypercube (i.e.... ..."

### Table 1 Description of a host processor. 2. in full-duplex mode,

### Table 1. Level of misrouting for the full-duplex and half-duplex chaos networks at full load.

"... In PAGE 6: ...Table1 shows the level of misrouting at saturation for each traffic pattern under the two network configurations. Note that each time a packet is derouted, its path increases by 2 hops.... ..."

### Table 1: Matrix multiplication parameters. Reuse Self-Interference Footprint References

1991

"... In PAGE 4: ... Since the variable X[i,j] is allocated to a register, the total number of references to elements of the array is 78 36166 and its miss rate is simply 0. Substituting the parameters in Table1 into Equation 2, the miss rates for Y and Z, 7740 89 41 and 7740 9041 , are 7740 89 41 61 1 0 0 1 0 83 105 40 89 41 1 16 1 0 266 67 1716 1 0 66 67 17 25 83 105 40 89 4143 3 0 1 0 83 105 40 89 41 1 66 67 7740 90 41 61 1 0 16 1 0 1 67 1716 1 0 66 67 17 25 66 67 The total number of cache misses are therefore 78 3 66 43 78 3 16 1 78 43 78 0 1 78 7740 89 41 17 43 78 3 16 1 66 43 66 0 1 66 7740 90 41 17 25 78 3 32 2 66 43 83 105 40 89 4143 3 0 1 0 83 105 40 89 41 1 66 67 43 66 67 33 40 341 According to this equation, there are 278 36166intrinsic misses, misses that are intrinsic to the algorithm given the blocking factor and cannot be avoided even if the address mapping is perfect. The factor 83 105 40 89 41 is due to self interference of variable Y on itself.... ..."

Cited by 514