### Table 2. The multicast communication models of sequential tree, binomial tree, and chain tree where k is number of nodes in the group.

1996

"... In PAGE 7: ... Given a multicast algorithm, tmhold and tmcast of the algorithm can be estimated from thold and tend. Table2 contains the multicast communication models of the three multicast trees. Note that these parameters can be measured by using ping and ping-pong benchmarks as mentioned in [12].... ..."

Cited by 28

### Table 1: Empirical results for centralised (multicast) and de- centralised (newscast) communication

"... In PAGE 4: ...xperimental settings, i.e., for multicast and newscast communica- tion, respectively. The obtained results have been included in Fig- ure 2, Table1 and on the last page. The graphs show the outcomes of 10 independent runs overlaid.... ..."

### Table I. Communication Cost Protocols Rounds Messages Unicast Multicast

### Table 4. The optimal multicast tree of a 3-port communication architecture with k = 12, tint = 10, thold = 22, and tend = 55.

1996

"... In PAGE 18: ...Theorem 2 The optimal multicast latency of a k-node tree can be computed in O( k) time when each node has communication ports. Table4 shows an example for k = 12, tint = 10, thold = 22, tend = 55, and = 3. 6 Conclusion Designing a portable algorithm to achieve good performance on di erent parallel platforms is highly demanded.... ..."

Cited by 28

### Table 1: Unicast and multicast signaling and conferences

1998

"... In PAGE 4: ... While separate protocols could be used for each of these, SIP tries to address all three modes. Table1 shows the possible combinations of unicast and multicast signaling and communications. For example, inviting somebody to a multicast conference (e.... ..."

Cited by 19

### Table 1: Unicast and multicast signaling and conferences

1998

"... In PAGE 4: ... While separate protocols could be used for each of these, SIP tries to address all three modes. Table1 shows the possible combinations of unicast and multicast signaling and communications. For example, inviting somebody to a multicast conference (e.... ..."

Cited by 19

### Table 1: Unicast and multicast signaling and conferences

in Abstract

1998

"... In PAGE 4: ... While separate protocols could be used for each of these, SIP tries to address all three modes. Table1 shows the possible combinations of unicast and multicast signaling and communications. For example, inviting somebody to a multicast conference (e.... ..."

### Table 3: Fortran90D/HPF Intrinsic Functions 1. Structured 2. Reduction 3. Multicasting 4. Unstructured 5. Special communication communication routines

1993

Cited by 21

### Table 2: Fortran90D/HPF Intrinsic Functions 1. Structured 2. Reduction 3. Multicasting 4. Unstructured 5. Special communication communication routines

### Table 1: De nitions of symbols used in the paper In this analysis, we make the following assumptions: All the participants of a super conference, together with their respective mixers, share bandwidth on a local area network (e.g., Ethernet). Due to the broadcast nature of such networks, we assume the availability of multicast communication. Transmission latencies of media packets on the network are bounded. All the participants generate media packets at the same rate (namely, Rpkt). The clocks of the participants and mixers are not globally synchronized. We will rst derive limits on the number of participants in a group Ngrp, and then on the number of groups within a super conference (which, given Ngrp, will be determined by limits on the height of the mixing hierarchy).

1991

"... In PAGE 4: ... 4 Analysis of Hierarchical Communication Architectures In order to derive the limits on the performance of hierarchical mixing, we develop a model that relates delay and bandwidth requirements to group size, height of a mixing tree, and network and system parameters. Table1 shows... ..."

Cited by 9