Multi-node broadcasting in hypercubes and star graphs

Yu-Chee Tseng*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time.

Original languageEnglish
Title of host publication1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
EditorsWanlei Zhou, Andrzej Goscinski, Michael Hobbs
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages51-58
Number of pages8
ISBN (Electronic)0780342291, 9780780342293
DOIs
StatePublished - 1 Jan 1997
Event3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 - Melbourne, Australia
Duration: 10 Dec 199712 Dec 1997

Publication series

Name1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997

Conference

Conference3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
CountryAustralia
CityMelbourne
Period10/12/9712/12/97

Fingerprint Dive into the research topics of 'Multi-node broadcasting in hypercubes and star graphs'. Together they form a unique fingerprint.

  • Cite this

    Tseng, Y-C. (1997). Multi-node broadcasting in hypercubes and star graphs. In W. Zhou, A. Goscinski, & M. Hobbs (Eds.), 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 (pp. 51-58). [651479] (1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICAPP.1997.651479