Scheduling for atomic broadcast operation in heterogeneous networks with one port model

  • Authors:

  • Ching-Hsien Hsu;Bing-Ru Tsai

  • Affiliations:

  • Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, ROC 300;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, ROC 300

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 aiming to efficiently perform atomic one-to-all broadcast in a heterogeneous network with a one port model. The proposed algorithms are divided into graph-based and tree-based ones. In graph-based algorithms, we present Nearest Neighbor First and Maximum Degree Neighbor First schemes. A prescheduling strategy with constructing a message forwarding table for avoiding redundant transmissions is applied as runtime support. In the tree- based approaches, there are five heuristic algorithms: Nearest Neighbor First, Maximum Degree Neighbor First, Maximum Height Subtree First, Maximum Subtree First, and Maximum Weighted Subtree First, proposed based on different network characteristics. To evaluate the performance of the proposed techniques, we have developed a simulator that contains a parametric graph generator for generating network graphs with various characteristics. We have implemented all of the proposed scheduling algorithms on the simulator. The performance results show that the Maximum Weighted Subtree First performs best in high degree heterogeneous environments. On the contrary, with homogeneous-like environments, the graph-based Nearest Neighbor First will be the best choice. In summary, contribution of this study relies on informing significant suggestions for adapting proper broadcasting mechanism in different heterogeneous platforms.