Reduction Optimization in Heterogeneous Cluster Environments

Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, it is now possible to build a cluster that provides high computing power within a limited budget. However, a cluster may consist of different types of processors and this heterogeneity complicates the design of efficient collective communication protocols. For example, it is a very hard combinatorial problem to find an optimal reduction schedule for such heterogeneous clusters. Nevertheless, we show that a simple technique called slowest-node-first (SNF) is very effective in designing efficient reduction protocols for heterogeneous clusters. First, we show that SNF is actually an approximation algorithm with competitive ratio two. In addition, we show that SNF does give the optimal reduction time when the cluster consists of two types of processors, when the ratio of communication speed between them is at...

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Pangfeng Liu, Da-Wei Wang
• Keywords: Distributed And Parallel Computing, IPPS 2000, Optimal Reduction, Optimal Reduction Schedule, Optimal Reduction Time