Sufficient Conditions for Optimal Multicast Communication

I
ICPP
1997
1997 International Conference on Parallel Processing (ICPP '97)
Abstract - Sufficient Conditions for Optimal Multicast Communication

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Barbara D. Birchler Articles by Abdol-Hossein Esfahanian Articles by Eric Torng

1997 International Conference on Parallel Processing (ICPP '97)

Bloomington, IL

August 11-August 15

ISBN: 0-8186-8108-X

	ASCII Text	x
	Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng, "Sufficient Conditions for Optimal Multicast Communication," Parallel Processing, International Conference on, pp. 390, 1997 International Conference on Parallel Processing (ICPP '97), 1997.

	BibTex	x
	@article{ 10.1109/ICPP.1997.622671, author = {Barbara D. Birchler and Abdol-Hossein Esfahanian and Eric Torng}, title = {Sufficient Conditions for Optimal Multicast Communication}, journal ={Parallel Processing, International Conference on}, volume = {0}, year = {1997}, issn = {0190-3918}, pages = {390}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICPP.1997.622671}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Processing, International Conference on TI - Sufficient Conditions for Optimal Multicast Communication SN - 0190-3918 SP EP A1 - Barbara D. Birchler, A1 - Abdol-Hossein Esfahanian, A1 - Eric Torng, PY - 1997 KW - Multicast Communication KW - Direct Network KW - Oblivious Routing KW - Shortest Path KW - Line switching VL - 0 JA - Parallel Processing, International Conference on ER -

Barbara D. Birchler, Michigan State University

Abdol-Hossein Esfahanian, Michigan State University

Eric Torng, Michigan State University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.1997.622671

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.

Index Terms:

Multicast Communication, Direct Network, Oblivious Routing, Shortest Path, Line switching

Citation:

Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng, "Sufficient Conditions for Optimal Multicast Communication," icpp, pp.390, 1997 International Conference on Parallel Processing (ICPP '97), 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.