With the emergence of the network technologies, heterogeneous computing has become a wide accept paradigm for distributed and network computing. In this paper, we present different algorithms and evaluate their performance on performing atomic one-to-all broadcast in heterogeneous network with one port model. Based on general graph model, two scheduling algorithms, the Nearest Neighbor First and the Maximum Degree Neighbor First are firstly illustrated. The pre-scheduling strategy with constructing message forwarding table for avoiding redundant transmissions is applied as runtime support. By extending graph-based approaches, five tree-based heuris-tic algorithms, the Nearest Neighbor First, the Maximum Degree Neighbor First, the Maximum Height Sub-tree First, the Maximum Sub-Tree First and the Maximum Weighted Sub-tree First, are developed based on different network characteristics. The performance analysis shows that the Maximum Weighted Sub-tree First performs best in high degree heterogeneous environments. Overall speaking, contribution of this study relies on informing significant suggestions for adapting proper broadcasting mechanism in different hetero-geneous platforms.
展开▼
