Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/645533.656509guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Sufficient Conditions for Optimal Multicast Communication

Published: 11 August 1997 Publication History

Abstract

In this paper, we give a general technique for computing optimal multicast calling schedules in any multiprocessor system that utilizes a direct network interconnection structure as long as a few simple conditions are satisfied. Since almost any real system will satisfy these conditions, this result essentially means that multicast can always be performed in the ceiling of log (d+1) phases, where d is the number of multicast destinations. In particular, previous results on optimal multicast algorithms in specific direct network topologies \cite{far80,mck92,rob94} are simply corollaries of our result.

References

[1]
A. M. Farley, "Minimum-time line broadcast networks," Networks, vol. 10, pp. 59-70, 1980.
[2]
P. K. McKinley, H. Xu, A-H. Esfahanian, and L. M. Ni, "Unicast-based multicast communication in wormhole-routed networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, pp. 1252-1265, December 1994.
[3]
D. F. Robinson, P. K. McKinley, and B. H. Cheng, "Optimal multicast communication in wormhole-routed torus networks," in 1994 International Conference on Parallel Processing, pp. I-134-I- 141, 1994.
[4]
G. T. Byrd, N. P. Saraiya, and B. A. Delagi, "Multicast communication in multiprocessor systems," in 1989 International Conference on Parallel Processing, pp. I-196-I-200, 1989.
[5]
H. Xu, Y-D. Cui, and L. M. Ni, "Optimal software multicast in wormhole-routed multistage networks," in Proceedings of the 1994 Supercomputing Conference, pp. 703-712, November 1994.
[6]
B. D. Birchler, A-H. Esfahanian, and E. Torng, "Information dissemination in restricted routing networks," in The International Symposium on Combinatorics and Applications, (Tianjin, China), pp. 33-43, June 1996.
[7]
Y.-C. Tseng, D. K. Panda, and T.-H. Lai, "A trip-based multicasting model in wormhole-routed networks with virtual channels," IEEE Transactions on Parallel and Distributed Systems, vol. 7, pp. 138-150, February 1996.
[8]
J.-Y.L. Park, H.-A. Choi, N. Nupairoj, and L. M. Ni, "Construction of optimal multicast trees based on the parameterized communication model," in 1996 International Conference on Parallel Processing, 1996.
[9]
L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks," IEEE Computer, vol. 26, pp. 62-76, February 1993.

Cited By

View all
  • (1998)Broadcasting, multicasting and gossiping in trees under the all-port line modelProceedings of the tenth annual ACM symposium on Parallel algorithms and architectures10.1145/277651.277682(164-171)Online publication date: 1-Jun-1998

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
ICPP '97: Proceedings of the international Conference on Parallel Processing
August 1997
334 pages
ISBN:081868108X

Publisher

IEEE Computer Society

United States

Publication History

Published: 11 August 1997

Author Tags

  1. Direct Network
  2. Line switching
  3. Multicast Communication
  4. Oblivious Routing
  5. Shortest Path

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (1998)Broadcasting, multicasting and gossiping in trees under the all-port line modelProceedings of the tenth annual ACM symposium on Parallel algorithms and architectures10.1145/277651.277682(164-171)Online publication date: 1-Jun-1998

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media