Broadcasting Multiple Messages in Hypercubes (preliminary version)

I
ISPAN
2000
2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00)
Abstract - Broadcasting Multiple Messages in Hypercubes (preliminary version)

	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 A. Liestman Articles by T. Shermer Articles by M. Suderman

2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00)

Dallas/Richardson, Texas, USA

December 07-December 07

ISBN: 0-7695-0936-3

	ASCII Text	x
	A. Liestman, T. Shermer, M. Suderman, "Broadcasting Multiple Messages in Hypercubes (preliminary version)," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 274, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000.

	BibTex	x
	@article{ 10.1109/ISPAN.2000.900296, author = {A. Liestman and T. Shermer and M. Suderman}, title = {Broadcasting Multiple Messages in Hypercubes (preliminary version)}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2000}, issn = {1087-4089}, pages = {274}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900296}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Broadcasting Multiple Messages in Hypercubes (preliminary version) SN - 1087-4089 SP EP A1 - A. Liestman, A1 - T. Shermer, A1 - M. Suderman, PY - 2000 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

A. Liestman

T. Shermer

M. Suderman

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900296

We investigate T, (Q_d), the time required to broadcast m \geq 1 messages in a d-dimensional hypercube under the telephone model. We give exact values for T_m(Q_d) for m \leq 2_d-1 and for m \geq 2_d + 1. For 2_d-1- + 1\leq m \leq 2_d, we produce an upper bound which is 1 larger than the lower bound. One consequence of our results is to disprove a lower bound due to Farley [3].

Citation:

A. Liestman, T. Shermer, M. Suderman, "Broadcasting Multiple Messages in Hypercubes (preliminary version)," ispan, pp.274, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000

Peer Review Notice | Give Us Feedback

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