Heuristic Contention-Free Broadcast in Heterogeneous Networks of Workstations with Multiple Send and Receive Speeds

  • Authors:
  • Chao Lin

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Central University, Chung-Li, 320 Taiwan. chaolin@axp1.csie.ncu.edu.tw

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents three efficient contention-free algorithms for broadcasting on heterogeneous networks of workstations (HNOW). In an HNOW, many different speed types of workstations can have distinct send and receive overhead. Previous research has shown that finding an optimal routing scheme in an HNOW is not easy [2,12], because properly arranging all workstations in the scheduling tree is difficult. Therefore, this investigation focuses mainly on enhancing the performance of an HNOW by properly arranging fastest nodes into the internal nodes of upper levels in the scheduling tree. Fastest node first is fundamental in designing an efficient algorithm. This paper presents three schemes called EBS, VBBS, and VBBSWF. All of these three schemes can be executed in O(n log(n)) time, where n is the number of workstations. They are all contention-free when broadcasting in an HNOW. Based on the simulation result, the proposed schemes outperform the broadcast with minimal steps [13] and the scheduling tree [22] generated by dynamic programing in an HNOW.