All-to-all broadcast problem of some classes of graphs under the half duplex all-port model

Fei-Huang Chang,Young-Ming Chen,Ma-Lian Chia,David Kuo,Ming-Fen Yu

doi:10.1016/j.dam.2014.03.014

All-to-all broadcast problem of some classes of graphs under the half duplex all-port model

Fei-Huang Chang, Young-Ming Chen + Show 3 more

Open Access

https://doi.org/10.1016/j.dam.2014.03.014

Copy DOI

Journal: Discrete Applied Mathematics	Publication Date: Apr 16, 2014
Citations: 7	License type: publisher-specific-oa

Affiliation: National Taiwan Normal University, National Chengchi University, Aletheia University, National Dong Hwa University

#Double Loop Networks #Applications In Parallel Processing + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

All-to-all communication occurs in many important applications in parallel processing. In this paper, we study the all-to-all broadcast number (the shortest time needed to complete the all-to-all broadcast) of graphs under the assumption that: each vertex can use all of its links at the same time, and each communication link is half duplex and can carry only one message at a unit of time. We give upper and lower bounds for the all-to-all broadcast number of graphs and give formulas for the all-to-all broadcast number of trees, complete bipartite graphs and double loop networks under this model.

Full Text